Separation of convolved mixtures in frequency domain ICA
Angelo Ciaramella, Roberto Tagliaferri, Maria Funaro · International Mathematical Forum · 2006
In this paper, a novel approach to solve the permutation indeter-minacy in the separation of convolved mixtures in frequency domain is proposed. A fixed-point algorithm in complex domain is used to sep-arate the signals in each frequency bin. These are obtained applying a Short Time Fourier Transform on a set of fixed frames. To solve the ambiguity of the amplitude dilation, a simple method is proposed. The permutation indeterminacy is solved using an approach based on the Hungarian algorithm that solves an Assignment Problem and an algorithm of Dynamic Programming. To obtain the distances in the Assignment Problem, a Kullback-Leibler divergence is adopted. The results of the experiments, performed using both synthetic and bench-mark data, allows us to conclude that the approach presents a good performance and permits to obtain a clear separation of the signals also when they are more than two.