Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
562037 | Signal Processing | 2006 | 16 Pages |
Abstract
Finding the sparsest solution to a set of underdetermined linear equations is NP-hard in general. However, recent research has shown that for certain systems of linear equations, the sparsest solution (i.e. the solution with the smallest number of nonzeros), is also the solution with minimal ℓ1ℓ1 norm, and so can be found by a computationally tractable method.For a given n by m matrix ΦΦ defining a system y=Φαy=Φα, with n
Related Topics
Physical Sciences and Engineering
Computer Science
Signal Processing
Authors
Yaakov Tsaig, David L. Donoho,