By Topic

On sparse representation in pairs 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)
Feuer, A. ; Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel ; Nemirovski, A.

In previous work, Elad and Bruckstein (EB) have provided a sufficient condition for replacing an l0 optimization by linear programming minimization when searching for the unique sparse representation. We establish here that the EB condition is both sufficient and necessary.

Published in:

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