论文信息 - Sparse separation: principles and tricks

Sparse separation: principles and tricks

Blind separation of linearly mixed white Gaussian sources is impossible, due to rotational symmetry. For this reason, all blind separation algorithms are based on some assumption concerning the fashion in which the situation departs from that insoluble case. Here we discuss the assumption of sparseness and try to put various algorithms that make the sparseness assumption in a common framework. The main objective of this paper is to give some rough intuitions, and to provide suitable hooks into the literature.

Vamsi K. Potluru | Barak A. Pearlmutter | V. Potluru

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

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

[3] Bhaskar D. Rao,et al. Sparse signal reconstruction from limited data using FOCUSS: a re-weighted minimum norm algorithm , 1997, IEEE Trans. Signal Process..

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

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

[6] S. Rickard,et al. DOA estimation of many W-disjoint orthogonal sources from two mixtures using DUET , 2000, Proceedings of the Tenth IEEE Workshop on Statistical Signal and Array Processing (Cat. No.00TH8496).

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

[8] Sam T. Roweis,et al. One Microphone Source Separation , 2000, NIPS.

[9] Michael C. Mozer,et al. Monaural Separation and Classification of Mixed Signals : a Support-vector Regression Perspective , 2001 .

[10] Barak A. Pearlmutter,et al. Blind Source Separation by Sparse Decomposition in a Signal Dictionary , 2001, Neural Computation.