Key points are not available for this paper at this time.
In previous work, Elad and Bruckstein (EB) have provided a sufficient condition for replacing an l/sub 0/ optimization by linear programming minimization when searching for the unique sparse representation. We establish here that the EB condition is both sufficient and necessary.
Feuer et al. (Thu,) studied this question.