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. © Springer-Verlag 2004.
Cite
CITATION STYLE
Takigawa, I., Kudo, M., Nakamura, A., & Toyama, J. (2004). On the minimum ℓ1-norm signal recovery in underdetermined source separation. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3195, 193–200. https://doi.org/10.1007/978-3-540-30110-3_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
