On sparse representation in pairs of bases
In previous work, Elad and Bruckstein (EB) have provided a sufficient condition for replacing an l(o) optimization by linear programming minimization when searching for the unique sparse representation. We establish here that the EB condition is both sufficient and necessary.
sparse representation dictionary tight frame