Performance Analysis of Minimum ℓ1-Norm Solutions for Underdetermined Source Separation

IEEE Transactions on Signal Processing

Volumn 52, Issue 3, 2004, Pages 582-591

  Takigawa, Ichigaku ^a   Kudo, Mineichi ^a   Toyama, Jun ^a  

^a HOKKAIDO UNIVERSITY   (Japan)

Author keywords

Laplace prior distribution; Linear programming; Maximum a posteriori probability solution; Minimum 1 norm solution; Underdetermined source separation

Indexed keywords

FUNCTION EVALUATION; INDEPENDENT COMPONENT ANALYSIS; LAPLACE TRANSFORMS; LINEAR PROGRAMMING; MATRIX ALGEBRA; PROBABILITY DISTRIBUTIONS; SIGNAL THEORY; THEOREM PROVING;

LAPLACE PRIOR DISTRIBUTION; MAXIMUM A POSTERIORI PROBABILITY (MAP); UNDERDETERMINED SOURCE SEPARATION;

BLIND SOURCE SEPARATION;

EID: 1542333710     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2003.822284     Document Type: Article

References (20)

1. T.-W. Lee, Independent Component Analysis - Theory and Applications. Boston, MA: Kluwer, 1998.
2. J.-F. Cardoso, "Blind signal separation: statistical principles," Proc. IEEE (Special Issue on Blind Identification and Estimation), vol. 90, pp. 2009-2026, Oct. 1998.
3. P. Comon, "Independent component analysis, a new concept?," Signal Process., vol. 36, pp. 287-314, 1994.
4. M. Girolami, Self-Organizing Neural Networks - Independent Component Analysis and Blind Source Separation. New York: Springer-Verlag, 1999.
5. T.-W. Lee, M. S. Lewicki, M. Girolami, and T. J. Sejnowski, "Blind source separation of more sources than mixtures using overcomplete representations," IEEE Signal Processing Lett., vol. 4, pp. 87-90, Apr. 1999.
6. P. Bofill and M. Zibulevsky, "Blind separation of more sources than mixtures using sparsity of their short-time fourier transform," in Proc. Independent Component Anal., 2000, pp. 87-92.
7. P. Comon and O. Grellier, "Non-linear inversion of underdetermined mixtures," in Proc. IEEE Workshop Independent Component Anal. Blind Signal Separation, 1999, pp. 461-465.
8. A. Belouchrani and J.-F. Cardoso, "Maximum likelihood source separation for discrete sources," in Proc. EUSIPCO, 1994, pp. 768-771.
9. M. S. Lewicki and T. J. Sejnowski, "Learning overcomplete representations," Neural Comput., vol. 12, pp. 337-365, 2000.
10. F. Theis and E. Lang, "Formalization of the two-step approach to overcomplete BSS," in Proc. SIP, 2002, pp. 207-212.
11. S. L. Campbell and C. D. Meyer Jr., Generalized Inverses of Linear Transformations. London, U.K.: Pitman, 1979.
12. B. A. Olshausen and D. J. Field, "Sparse coding with an overcomplete basis set: a strategy employed by vl?," Vision Res., vol. 37, pp. 3311-3325, 1997.
13. M. Zibulevsky and B. A. Pearlmutter, "Blind source separation by sparse decomposition," Neural Comput., vol. 13, no. 4, 2001.
14. S. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit," SIAM J. Sci. Comput., vol. 20, no. 1, pp. 33-61, 1998.
15. P. Bloomfield and W. L. Steiger, Least Absolute Deviations: Theory, Applications, and Algorithms. Boston, MA: Birkhäuser, 1983.
16. D. Bertsimas and J. N. Tsitsiklis, Introduction to Linear Optimization: Athena Scientific, 1997.
17. P. Kall, Stochastic Linear Programming: Springer-Verlag, 1976.
18. B. Bereanu, "The generalized distribution problem of stochastic linear programming," in Symposia Mathematica. New York: Academic, 1976, vol. XIX, pp. 229-267.
19. A. S.Albert S. Bregman, Auditory Scene Analysis: Perceptual Organization of Sound. Cambridge, MA: MIT Press, 1990.
20. R. M. Corless, G. H. Gonnet, D. E. G. Hare, D. J. Jeffrey, and D. E. Knuth, "On the Lambert W function," Adv. Comput. Math., vol. 5, pp. 329-359, 1996.