This paper deals with the problem of Blind Source Separation. Contrary to the vast majority of works, we do not assume the statistical independence between the sources and explicitly consider that they are dependent. We introduce three particular models of dependent sources and show that their cumulants have interesting properties. Based on these properties, we investigate the behaviour of classical Blind Source Separation algorithms when applied to these sources: depending on the source vector, the separation may be sucessful or some additionnal indeterminacies can be identified. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Castella, M., & Comon, P. (2007). Blind separation of instantaneous mixtures of dependent sources. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4666 LNCS, pp. 9–16). Springer Verlag. https://doi.org/10.1007/978-3-540-74494-8_2
Mendeley helps you to discover research relevant for your work.