Optimally sparse representation in general (nonorthogonal) dictionaries via l minimization.

Abstract

Given a dictionary D = {d(k)} of vectors d(k), we seek to represent a signal S as a linear combination S = summation operator(k) gamma(k)d(k), with scalar coefficients gamma(k). In particular, we aim for the sparsest representation possible. In general, this requires a combinatorial optimization process. Previous work considered the special case where D is an overcomplete system consisting of exactly two orthobases and has shown that, under a condition of mutual incoherence of the two bases, and assuming that S has a sufficiently sparse representation, this representation is unique and can be found by solving a convex optimization problem: specifically, minimizing the l(1) norm of the coefficients gamma. In this article, we obtain parallel results in a more general setting, where the dictionary D can arise from two or several bases, frames, or even less structured systems. We sketch three applications: separating linear features from planar ones in 3D data, noncooperative multiuser encoding, and identification of over-complete independent component models.

Extracted Key Phrases

050100150'04'06'08'10'12'14'16'18
Citations per Year

1,658 Citations

Semantic Scholar estimates that this publication has 1,658 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Donoho2003OptimallySR, title={Optimally sparse representation in general (nonorthogonal) dictionaries via l minimization.}, author={David L. Donoho and Michael Elad}, journal={Proceedings of the National Academy of Sciences of the United States of America}, year={2003}, volume={100 5}, pages={2197-202} }