A generalized uncertainty principle and sparse representation in pairs of bases

被引:375
作者
Elad, M [1 ]
Bruckstein, AM
机构
[1] Stanford Univ, SCCM Program, Dept Comp Sci, Palo Alto, CA 94304 USA
[2] Technion Israel Inst Technol, Dept Comp Sci, IL-32000 Haifa, Israel
关键词
dictionaries comprising pairs of orthogonal; bases; linear programming (LP); sparse representation; uncertainty principle;
D O I
10.1109/TIT.2002.801410
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
An elementary proof of a basic uncertainty principle concerning pairs of representations of R-N vectors in different orthonormal bases is provided. The result, slightly stronger than stated before, has a direct impact on the uniqueness property of the sparse representation of such vectors using pairs of orthonormal bases as overcomplete dictionaries. The main contribution in this paper is the improvement of an important result due to Donoho and Huo concerning the replacement of the l(o) optimization problem by a linear programming (LP) minimization when searching for the unique sparse representation.
引用
收藏
页码:2558 / 2567
页数:10
相关论文
共 6 条