| HAL : hal-00659913, version 1 |
| Voir la fiche détaillée | BibTeX,EndNote,... |
|
|
| International Conference on Latent Variable Analysis and Source Separation, Tel Aviv : Israël (2012) |
|
|
|
|
| Some uniqueness results in sparse convolutive source separation |
|
|
| Alexis Benichoux 1Prasad Sudhakar 1 |
|
|
| (12/03/2012) |
|
|
| The fundamental problems in the traditional frequency do- main approaches to convolutive blind source separation are 1) arbitrary permutations and 2) arbitrary scaling in each frequency bin of the esti- mated 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 ex- perimental results bring out the potential as well as the extent to which sparsity can be used as a hypothesis to formulate a well posed permuta- tion problem. |
|
|
|
|
|
|
|
|
|
|
| 1 : | METISS (INRIA - IRISA) |
| CNRS : UMR6074 – INRIA – Institut National des Sciences Appliquées (INSA) - Rennes – Université de Rennes 1 | |
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Traitement du signal et de l'image Sciences de l'ingénieur/Traitement du signal et de l'image Mathématiques/Combinatoire |
|
|
| sparse filters – convolutive blind source separation – permuta- tion ambiguity – lp minimization – Hall's Marriage Theorem – bi-stochastic matrices. |
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|
|
| hal-00659913, version 1 | |
| http://hal.inria.fr/hal-00659913 | |
| oai:hal.inria.fr:hal-00659913 | |
| Contributeur : Prasad Sudhakar | |
| Soumis le : Samedi 14 Janvier 2012, 09:16:51 | |
| Dernière modification le : Lundi 16 Janvier 2012, 09:46:46 | |