Fast orthogonal sparse approximation algorithms over local dictionaries

被引：22

作者：

Mailhe, Boris ^{[1
,2
]}

Gribonval, Remi ^{[3
]}

Vandergheynst, Pierre ^{[4
]}

Bimbot, Frederic ^{[2
,5
]}

机构：

[1] Univ Rennes 1, F-35014 Rennes, France

[2] IRISA, Rennes, France

[3] INRIA Rennes Bretagne Atlantique, Ctr Rech, Rennes, France

[4] Ecole Polytech Fed Lausanne, CH-1015 Lausanne, Switzerland

[5] CNRS, F-75700 Paris, France

来源：

SIGNAL PROCESSING | 2011年 / 91卷 / 12期

关键词：

Sparse approximation; Greedy algorithms; Shift invariance; Orthogonal Matching Pursuit; MATCHING PURSUITS;

D O I：

10.1016/j.sigpro.2011.01.004

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

In this work we present a new greedy algorithm for sparse approximation called LocOMP. LocOMP is meant to be run on local dictionaries made of atoms with much shorter supports than the signal length. This notably encompasses shift-invariant dictionaries and time-frequency dictionaries, be they monoscale or multiscale. In this case, very fast implementations of Matching Pursuit are already available. LocOMP is almost as fast as Matching Pursuit while approaching the signal almost as well as the much slower Orthogonal Matching Pursuit. (C) 2011 Elsevier B.V. All rights reserved.

引用

页码：2822 / 2835

页数：14

共 13 条

[1]

[Anonymous], 1993, PROC 27 ANN ASILOMAR, DOI DOI 10.1109/ACSSC.1993.342465

[2]

BLUMENSATH T, 2009, NORMALISED ITERATIVE

[3]

BLUMENSATH T, 2008, P EUSIPCO 08

[4] Iterative hard thresholding for compressed sensing [J].