On sparse representation in pairs of bases

被引：82

作者：

Feuer, A ^{[1
]}

Nemirovski, A

机构：

[1] Technion Israel Inst Technol, Control & Robot Lab, Dept Elect Engn, IL-32000 Haifa, Israel

[2] Technion Israel Inst Technol, Dept Ind Engn & Management, IL-32000 Haifa, Israel

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2003年 / 49卷 / 06期

关键词：

dictionary; sparse representation; tight frame;

D O I：

10.1109/TIT.2003.811926

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：1579 / 1581

页数：3