Dark energy in sparse atomic estimations

被引:10
作者
Sturm, Bob L. [1 ]
Shynk, John J. [1 ]
Daudet, Laurent [2 ]
Roads, Curtis [3 ]
机构
[1] Univ Calif Santa Barbara, Dept Elect & Comp Engn, Santa Barbara, CA 93106 USA
[2] Univ Paris 06, UPMC, IJLRDA, LAM, F-75005 Paris, France
[3] Univ Calif Santa Barbara, Media Arts & Technol Program, Santa Barbara, CA 93106 USA
来源
IEEE TRANSACTIONS ON AUDIO SPEECH AND LANGUAGE PROCESSING | 2008年 / 16卷 / 03期
基金
美国国家科学基金会;
关键词
matching pursuit; signal estimation; sparse overcomplete methods;
D O I
10.1109/TASL.2007.914975
中图分类号
O42 [声学];
学科分类号
070206 ; 082403 ;
摘要
Sparse overcomplete methods, such as matching pursuit, attempt to find an efficient estimation of a signal using terms (atoms) selected from an overcomplete dictionary. In some cases, atoms can be selected that have energy in regions of the signal that have no energy. Other atoms are then used to destructively interfere with these terms in order to preserve the original waveform. Because some terms may even "disappear" in the reconstruction, we refer to the destructive and constructive interference between the atoms of a sparse atomic estimation as "dark energy." In this paper, we formally define dark energy for matching pursuit, explore its properties, and present empirical results for decompositions of audio signals. This paper demonstrates that dark energy is a useful measure of the interference between the terms of a sparse atomic estimation and might provide information for the decomposition process.
引用
收藏
页码:671 / 676
页数:6
相关论文
共 17 条
[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]   Video compression using matching pursuits [J].
Al-Shaykh, OK ;
Miloslavsky, E ;
Nomura, T ;
Neff, R ;
Zakhor, A .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 1999, 9 (01) :123-143
[3]  
[Anonymous], 2006, P IEEE INT C AC SPEE
[4]   Atomic decomposition by basis pursuit [J].
Chen, SSB ;
Donoho, DL ;
Saunders, MA .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1998, 20 (01) :33-61
[5]   Hybrid representations for audiophonic signal encoding [J].
Daudet, L ;
Torrésani, B .
SIGNAL PROCESSING, 2002, 82 (11) :1595-1617
[6]   Matching pursuits sinusoidal speech coding [J].
Etemoglu, ÇÖ ;
Cuperman, V .
IEEE TRANSACTIONS ON SPEECH AND AUDIO PROCESSING, 2003, 11 (05) :413-424
[7]   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
[8]   Analysis of sound signals with high resolution matching pursuit [J].
Gribonval, R ;
Bacry, E ;
Mallat, S ;
Depalle, P ;
Rodet, X .
PROCEEDINGS OF THE IEEE-SP INTERNATIONAL SYMPOSIUM ON TIME-FREQUENCY AND TIME-SCALE ANALYSIS, 1996, :125-128
[9]   Sinusoidal modeling using psychoacoustic-adaptive matching pursuits [J].
Heusdens, R ;
Vafin, R ;
Kleijn, WB .
IEEE SIGNAL PROCESSING LETTERS, 2002, 9 (08) :262-265
[10]   High resolution pursuit for feature extraction [J].
Jaggi, S ;
Karl, WC ;
Mallat, S ;
Willsky, AS .
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 1998, 5 (04) :428-449