Sparse Approximation and the Pursuit of Meaningful Signal Models With Interference Adaptation

被引:9
作者
Sturm, Bob L. [1 ]
Shynk, John J. [1 ]
机构
[1] Univ Calif Santa Barbara, Dept Elect & Comp Engn, Santa Barbara, CA 93106 USA
来源
IEEE TRANSACTIONS ON AUDIO SPEECH AND LANGUAGE PROCESSING | 2010年 / 18卷 / 03期
基金
美国国家科学基金会;
关键词
Sparse approximation; orthogonal matching pursuit; signal decomposition; overcomplete dictionary; DICTIONARIES; ALGORITHM;
D O I
10.1109/TASL.2009.2037395
中图分类号
O42 [声学];
学科分类号
070206 ; 082403 ;
摘要
In the pursuit of a sparse signal model, mismatches between the signal and the dictionary, as well as atoms poorly selected by the decomposition process, can diminish the efficiency and meaningfulness of the resulting representation. These problems increase the number of atoms needed to model a signal for a given error, and they obscure the relationships between signal content and the elements of the model. To increase the efficiency and meaningfulness of a signal model built by an iterative descent pursuit, such as matching pursuit (MP), we propose integrating into its atom selection criterion a measure of interference between an atom and the model. We define interference and illustrate how it describes the contribution of an atom to modeling a signal. We show that for any nontrivial signal, the convergent model created by MP must have as much destructive as constructive interference, i.e., MP cannot avoid correction in the signal model. This is not necessarily a shortcoming of orthogonal variants of MP, such as orthogonal MP (OMP). We derive interference-adaptive iterative descent pursuits and show how these can build signal models that better fit the signal locally, and reduce the corrections made in a signal model. Compared with MP and its orthogonal variants, our experimental results not only show an increase in model efficiency, but also a clearer correspondence between the signal and the atoms of a representation.
引用
收藏
页码:461 / 472
页数:12
相关论文
共 24 条
[1]   K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation [J].
Aharon, Michal ;
Elad, Michael ;
Bruckstein, Alfred .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (11) :4311-4322
[2]  
[Anonymous], 2009, WAVELET TOUR SIGNAL
[3]  
Boyd S., 2004, CONVEX OPTIMIZATION, VFirst, DOI DOI 10.1017/CBO9780511804441
[4]   FAST ORTHOGONAL LEAST-SQUARES ALGORITHM FOR EFFICIENT SUBSET MODEL SELECTION [J].
CHEN, S ;
WIGGER, J .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1995, 43 (07) :1713-1715
[5]  
Chen Y, 1998, NONCON OPTIM ITS APP, V20, P1
[6]   Sparse and structured decompositions of signals with the Molecular Matching Pursuit [J].
Daudet, Laurent .
IEEE TRANSACTIONS ON AUDIO SPEECH AND LANGUAGE PROCESSING, 2006, 14 (05) :1808-1816
[7]   Uncertainty principles and ideal atomic decomposition [J].
Donoho, DL ;
Huo, XM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (07) :2845-2862
[8]   Stochastic time-frequency dictionaries for matching pursuit [J].
Durka, PJ ;
Ircha, D ;
Blinowska, KJ .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2001, 49 (03) :507-510
[9]  
GOODWIN M, 1997, THESIS U CALIFORNIA
[10]   Matching pursuit and atomic signal models based on recursive filter banks [J].
Goodwin, MM ;
Vetterli, M .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1999, 47 (07) :1890-1902