Cart (Loading....) | Create Account
Close category search window

Sparse representations in unions of bases

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Gribonval, R. ; IRISA/INRIA, France ; Nielsen, M.

The purpose of this correspondence is to generalize a result by Donoho and Huo and Elad and Bruckstein on sparse representations of signals in a union of two orthonormal bases for RN. We consider general (redundant) dictionaries for RN, and derive sufficient conditions for having unique sparse representations of signals in such dictionaries. The special case where the dictionary is given by the union of L≥2 orthonormal bases for RN is studied in more detail. In particular, it is proved that the result of Donoho and Huo, concerning the replacement of the ℓ0 optimization problem with a linear programming problem when searching for sparse representations, has an analog for dictionaries that may be highly redundant.

Published in:

Information Theory, IEEE Transactions on  (Volume:49 ,  Issue: 12 )

Date of Publication:

Dec. 2003

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.