From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images

A full-rank matrix ${\bf A}\in {\Bbb R}^{n\times m}$ with n < m generates an underdetermined system of linear equations Ax = b having infinitely many solutions. Suppose we seek the sparsest solution, i.e., the one with the fewest nonzero entries. Can it ever be unique? If so, when? As optimizatio...

Ausführliche Beschreibung