From sparse solutions of systems of equations to sparse modeling of signals and images.

*(English)* Zbl 1178.68619
Summary: A full-rank matrix ${\bold A}\in \Bbb{R}^{n\times m}$ with $n<m$ generates an underdetermined system of linear equations ${\bold {Ax}} = {\bold 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 optimization of sparsity is combinatorial in nature, are there efficient methods for finding the sparsest solution? These questions have been answered positively and constructively in recent years, exposing a wide variety of surprising phenomena, in particular the existence of easily verifiable conditions under which optimally sparse solutions can be found by concrete, effective computational methods.
Such theoretical results inspire a bold perspective on some important practical problems in signal and image processing. Several well-known signal and image processing problems can be cast as demanding solutions of undetermined systems of equations. Such problems have previously seemed, to many, intractable, but there is considerable evidence that these problems often have sparse solutions. Hence, advances in finding sparse solutions to underdetermined systems have energized research on such signal and image processing problems-to striking effect. In this paper we review the theoretical results on sparse solutions of linear systems, empirical results on sparse modeling of signals and images, and recent applications in inverse problems and compression in image processing. This work lies at the intersection of signal processing and applied mathematics, and arose initially from the wavelets and harmonic analysis research communities. The aim of this paper is to introduce a few key notions and applications connected to sparsity, targeting newcomers interested in either the mathematical aspects of this area or its applications.

##### MSC:

68U10 | Image processing (computing aspects) |

94A08 | Image processing (compression, reconstruction, etc.) |

15A29 | Inverse problems in matrix theory |

15A06 | Linear equations (linear algebra) |

90C25 | Convex programming |