Sparse and redundant representations

The field of sparse and redundant representation modeling has gone through a major revolution in the past two decades. This started with a series of algorithms for approximating the sparsest solutions of linear systems of equations, later to be followed by surprising theoretical results that guarantee these algorithms’ performance. With these contributions in place, major barriers in making this model practical and applicable were removed, and sparsity and redundancy became central, leading to state-of-the-art results in various disciplines. One of the main beneficiaries of this progress is…