On the Strong Uniqueness of Highly Sparse Representations from Redundant Dictionaries

A series of recent results shows that if a signal admits a sufficiently sparse representation (in terms of the number of nonzero coefficients) in an “incoherent” dictionary, this solution is unique and can be recovered as the unique solution of a linear programming problem. We generalize these results to a large class of sparsity measures which includes the p

• Type: Conference
• Year: 2004
• Where: ICA
• Authors: Rémi Gribonval, Morten Nielsen
• Keywords: ICA 2004, Linear Programming Problem, Sparse Representation, Unique Solution