Abstract
This paper studied the minimum ℓ1-norm signal recovery in underdetermined source separation, which is a problem of separating n sources blindly from m linear mixtures for n>m. Based on our previous result of submatrix representation and decision regions, we describe the property of the minimum ℓ1-norm sequence from the viewpoint of source separation, and discuss how to construct it geometrically from the observed sequence and the mixing matrix, and the unstability for a perturbation of mixing matrix.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abrard, F., Deville, Y., White, P.: From blind source separation to blind source cancellation in the underdetermined case: a new approach based on time-frequency analysis. In: Proceedings of ICA 2001 (2001)
Lewicki, M., Sejnowski, T.J.: Learning overcomplete representations. Neural Computation 12, 337–365 (2000)
Lee, T.W., Lewicki, M.S., Girolami, M., Sejnowski, T.J.: Blind source separation of more sources than mixtures using overcomplete representations. IEEE Signal Processing Letters 4 (1999)
Bofill, P., Zibulevsky, M.: Underdetermined blind source separation using sparse representations. Signal Processing 81, 2353–2362 (2001)
Li, Y., Cichocki, A., Amari, S.: Sparse component analysis for blind source separation with less sensors than sources. In: Proceedings of ICA 2003 (2003)
Zibulevsky, M., Pearlmutter, B.A.: Blind source separation by sparse decomposition. Neural Computations 13 (2001)
Olshausen, B.A., Field, D.J.: Sparse coding with an overcomplete basis set: A strategy employed by v1? Vision Research 37, 3311–3325 (1997)
Takigawa, I., Kudo, M., Toyama, J.: Performance analysis of minimum _1-norm solutions for underdetermined source separation. IEEE Transactions on Signal Processing 52, 582–591 (2004)
Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM Journal on Scientific Computing 20, 33–61 (1998)
Donoho, D.L., Elad, M.: Optimally sparse representation in general (nonorthogonal) dictionaries via _1 minimization. Proceedings of the National Academy of Sciences 100 (2004)
Donoho, D.L., Huo, X.: Undertainty principles and ideal atomic decomposition. IEEE Transactions on Information Theory 47 (2001)
Malioutov, M., Cȩtin, M., Willsky, A.S.: Optimal sparse representations in general overcomplete bases. Accepted to IEEE International Conference on Acoustics, Speech, and Signal Processing (2004)
Elad, M., Bruckstein, A.M.: A generalized uncertainty principle and sparse representation in pairs of bases. IEEE Transactions on Information Theory 48 (2002)
Freuer, A., Nemirovski, A.: On sparse representation in pairs of bases. IEEE Transactions on Information Theory 49 (2003)
Mallat, S., Zhang, Z.: Matching pursuits with time-frequency dictionaries. IEEE Transactions on Signal Processing 41 (1993)
Takigawa, I.: Analysis of Solutions in Underdetermined Source Separation. PhD thesis, Graduate School of Engineering, Hokkaido University (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Takigawa, I., Kudo, M., Nakamura, A., Toyama, J. (2004). On the Minimum ℓ1-Norm Signal Recovery in Underdetermined Source Separation. In: Puntonet, C.G., Prieto, A. (eds) Independent Component Analysis and Blind Signal Separation. ICA 2004. Lecture Notes in Computer Science, vol 3195. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30110-3_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-30110-3_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23056-4
Online ISBN: 978-3-540-30110-3
eBook Packages: Springer Book Archive