Multiscale Framework For Blind Source Separation

We consider the problem of blind separation of sources from a set of their linear mixtures. It was discovered recently, that exploiting the sparsity of sources, appropriately represented according to some signal dictionary, dramatically improves the quality of separation. In this study we take advantage of the properties of multiscale transforms, such as wavelet or wavelet packets, to decompose signals into sets of local features with various degrees of sparsity. We study how the separation error is affected by the sparsity of decomposition coefficients, and by the misfit between the probabilistic model of these coefficients and their actual distribution. Our error estimator, based on the Taylor expansion of the quasi-ML function, is used in selection of the best subsets of coefficients, utilized in turn for further separation. The performance of the algorithm is verified on noise-free and noisy data. Experiments with simulated signals, musical sounds and images demonstrate significant improvement of separation quality over previously reported results.

[1]  Dinh-Tuan Pham,et al.  Blind separation of instantaneous mixture of sources via an independent component analysis , 1996, IEEE Trans. Signal Process..

[2]  J. Cardoso Infomax and maximum likelihood for blind source separation , 1997, IEEE Signal Processing Letters.

[3]  David L. Donoho,et al.  De-noising by soft-thresholding , 1995, IEEE Trans. Inf. Theory.

[4]  Andrzej Cichocki,et al.  Robust learning algorithm for blind separation of signals , 1994 .

[5]  Barak A. Pearlmutter,et al.  A Context-Sensitive Generalization of ICA , 1996 .

[6]  A. Hyvärinen,et al.  Nonlinear Blind Source Separation by Self-Organizing Maps , 1996 .

[7]  Terrence J. Sejnowski,et al.  Learning Overcomplete Representations , 2000, Neural Computation.

[8]  M. Victor Wickerhauser,et al.  Adapted wavelet analysis from theory to software , 1994 .

[9]  Barak A. Pearlmutter,et al.  Blind Source Separation via Multinode Sparse Representation , 2001, NIPS.

[10]  Barak A. Pearlmutter,et al.  Blind source separation by sparse decomposition , 2000, SPIE Defense + Commercial Sensing.

[11]  David J. Field,et al.  Sparse coding with an overcomplete basis set: A strategy employed by V1? , 1997, Vision Research.

[12]  Andrzej Cichocki,et al.  A New Learning Algorithm for Blind Signal Separation , 1995, NIPS.

[13]  Andreas Ziehe,et al.  Unmixing Hyperspectral Data , 1999, NIPS.

[14]  James C. Bezdek,et al.  Pattern Recognition with Fuzzy Objective Function Algorithms , 1981, Advanced Applications in Pattern Recognition.

[15]  Julio Ortega Lopera,et al.  Separation of sources: A geometry-based procedure for reconstruction of n-valued signals , 1995, Signal Process..

[16]  Barak A. Pearlmutter,et al.  Independent Component Analysis: Blind source separation by sparse decomposition in a signal dictionary , 2001 .

[17]  Pierre Comon,et al.  Blind separation of sources, part II: Problems statement , 1991, Signal Process..

[18]  Michael A. Saunders,et al.  Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..

[19]  Terrence J. Sejnowski,et al.  An Information-Maximization Approach to Blind Separation and Blind Deconvolution , 1995, Neural Computation.

[20]  Aapo Hyvärinen,et al.  Survey on Independent Component Analysis , 1999 .

[21]  Ronald R. Coifman,et al.  Entropy-based algorithms for best basis selection , 1992, IEEE Trans. Inf. Theory.

[22]  Eero P. Simoncelli,et al.  Image compression via joint statistical characterization in the wavelet domain , 1999, IEEE Trans. Image Process..

[23]  S. Mallat A wavelet tour of signal processing , 1998 .

[24]  Yehoshua Y. Zeevi,et al.  2D multiwavelets for image representation , 1996, Proceedings of 19th Convention of Electrical and Electronics Engineers in Israel.