Title :
On sparse representation in pairs of bases
Author :
Feuer, Arie ; Nemirovski, Arkadi
Author_Institution :
Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel
fDate :
6/1/2003 12:00:00 AM
Abstract :
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.
Keywords :
linear programming; matrix algebra; minimisation; signal representation; Elad-Bruckstein condition; linear programming minimization; necessary condition; optimization problems; orthogonal matrices; pairs of bases; signal representation; sparse representation; sufficient condition; Cities and towns; Dictionaries; Industrial engineering; Laboratories; Linear programming; Robot control; Service robots; Sparse matrices; Sufficient conditions; Technology management;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2003.811926
