Sparse representations in unions of bases

被引:624
作者
Gribonval, R
Nielsen, M
机构
[1] INRIA, IRISA, F-35042 Rennes, France
[2] Univ Aalborg, Dept Math Sci, DK-9220 Aalborg E, Denmark
关键词
dictionaries; Grassmannian frames; linear programming; mutually incoherent bases; nonlinear approximation; sparse representations;
D O I
10.1109/TIT.2003.820031
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The purpose of this correspondence is to generalize a result by Donoho and Huo and Elad and Bruckstein on sparse representations of signals in a union of two orthonormal bases for R-N. We consider general (redundant) dictionaries for R (N), and derive sufficient conditions for having unique sparse representations of signals in such dictionaries. The special case where the dictionary is given by the union of L greater than or equal to 2 orthonormal bases for R-N is studied in more detail. In particular, it is proved that the result of Donoho and Hun, concerning the replacement of the l(0) optimization problem with a linear programming problem when searching for sparse representations, has an analog for dictionaries that may be highly redundant.
引用
收藏
页码:3320 / 3325
页数:6
相关论文
共 7 条