Approximate nearest-subspace representations for sound mixtures

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper we present a novel approach to describe sound mixtures which is based on a geometric viewpoint. In this approach we extend the idea of a nearest-neighbor representation to address the case of superimposed sources. We show that in order to account for mixing effects we need to perform a search for nearest-subspaces, as opposed to nearest-neighbors. In order to reduce the excessive computational complexity of this search we present an efficient algorithm to solve this problem which amounts to a sparse coding approach. We demonstrate the efficacy of this algorithm by using it to separate mixtures of speech.

Original languageEnglish (US)
Title of host publication2011 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2011 - Proceedings
Pages5892-5895
Number of pages4
DOIs
StatePublished - 2011
Event36th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2011 - Prague, Czech Republic
Duration: May 22 2011May 27 2011

Other

Other36th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2011
CountryCzech Republic
CityPrague
Period5/22/115/27/11

Keywords

  • audio
  • separation
  • Sound mixtures
  • speech

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Approximate nearest-subspace representations for sound mixtures'. Together they form a unique fingerprint.

Cite this