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 to perform the separation of the signals for each frequency domain, is used. To ohtain the frequency bins a Short Time Fourier transform on a set of fixed frames, is considered. 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 alnorithm of Dynanmic Programming. To ohtain the distances in the Assignment Problem, a Kullback-Leibler divergence is adopted. The approach presents a good performanee and permits to ohtain a clear separation of the signals.
Amplitude and Permutation Indeterminacies in Frequency Domain Convolved ICA
CIARAMELLA, Angelo;
2003-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 to perform the separation of the signals for each frequency domain, is used. To ohtain the frequency bins a Short Time Fourier transform on a set of fixed frames, is considered. 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 alnorithm of Dynanmic Programming. To ohtain the distances in the Assignment Problem, a Kullback-Leibler divergence is adopted. The approach presents a good performanee and permits to ohtain a clear separation of the signals.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
