Some uniqueness results in sparse convolutive source separation

  • Authors:
  • Alexis Benichoux;Prasad Sudhakar;Fréderic Bimbot;Rémi Gribonval

  • Affiliations:
  • METISS Team, INRIA Rennes-Bretagne Atlantique, Rennes Cedex, France;ICTEAM/ELEN, Université catholique de Louvain, Louvain-la-Neuve, Belgium;METISS Team, INRIA Rennes-Bretagne Atlantique, Rennes Cedex, France;METISS Team, INRIA Rennes-Bretagne Atlantique, Rennes Cedex, France

  • Venue:
  • LVA/ICA'12 Proceedings of the 10th international conference on Latent Variable Analysis and Signal Separation
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

The fundamental problems in the traditional frequency domain approaches to convolutive blind source separation are 1) arbitrary permutations and 2) arbitrary scaling in each frequency bin of the estimated filters or sources. These ambiguities are corrected by taking into account some specific properties of the filters or sources, or both. This paper focusses on the filter permutation problem, assuming the absence of the scaling ambiguity, investigating the use of temporal sparsity of the filters as a property to aid permutation correction. Theoretical and experimental results bring out the potential as well as the extent to which sparsity can be used as a hypothesis to formulate a well posed permutation problem.