In this paper, a novel approach to solve the permutation indeterminacy in the separation of convolved mixtures in frequency domain is proposed. A fixed-point algorithm in complex domain is used to separate 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 benchmark 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.
Separation of Convolved Mixtures in Frequency Domain ICA
CIARAMELLA, Angelo;
2006-01-01
Abstract
In this paper, a novel approach to solve the permutation indeterminacy in the separation of convolved mixtures in frequency domain is proposed. A fixed-point algorithm in complex domain is used to separate 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 benchmark 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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
