HAL - INRIA :: [hal-00460558, version 3] Fast orthogonal sparse approximation algorithms over local dictionaries

hal-00460558, version 3

Fast orthogonal sparse approximation algorithms over local dictionaries

Boris Mailhé () ¹, Rémi Gribonval () ¹, Pierre Vandergheynst () ², Frédéric Bimbot () ¹

Signal Processing (2011)

Résumé : 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.

1 : METISS (INRIA - IRISA)
CNRS : UMR6074 – INRIA – INSA Rennes – Université de Rennes 1
2 : LTS2 - EPFL
École Polytechnique Fédérale de Lausanne

hal-00460558, version 3
http://hal.inria.fr/hal-00460558
oai:hal.inria.fr:hal-00460558
Contributeur : Boris Mailhé <>
Soumis le : Mardi 26 Avril 2011, 11:39:51
Dernière modification le : Mardi 26 Avril 2011, 11:43:45

Voir la fiche détaillée

Documents associés

PDF :

DOI : 10.1016/j.sigpro.2011.01.004

Texte intégral chez l'éditeur

Exporter

Bibtex EndNote TEI RefWorks

<?xml version="1.0" encoding="UTF-8"?>
<listBibl xmlns="http://www.tei-c.org/ns/1.0" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML">
<listBibl type="article"><head>Articles dans des revues avec comité de lecture</head>
<biblStruct type="article" xml:id="hal-00460558"><analytic>
<author><persName><forename>Boris</forename><surname>Mailhé</surname></persName>
<affiliation>
<orgName type="laboratory">INRIA - IRISA</orgName>
<orgName type="team">METISS</orgName>
<country>FR</country>
<orgName type="institution">CNRS : UMR6074</orgName>
<orgName type="institution">INRIA</orgName>
<orgName type="institution">INSA Rennes</orgName>
<orgName type="institution">Université de Rennes 1</orgName>
</affiliation>
</author>
<author><persName><forename>Rémi</forename><surname>Gribonval</surname></persName>
<affiliation>
<orgName type="laboratory">INRIA - IRISA</orgName>
<orgName type="team">METISS</orgName>
<country>FR</country>
<orgName type="institution">CNRS : UMR6074</orgName>
<orgName type="institution">INRIA</orgName>
<orgName type="institution">INSA Rennes</orgName>
<orgName type="institution">Université de Rennes 1</orgName>
</affiliation>
</author>
<author><persName><forename>Pierre</forename><surname>Vandergheynst</surname></persName>
<affiliation>
<orgName type="team">LTS2 - EPFL</orgName>
<country>CH</country>
<orgName type="institution">École Polytechnique Fédérale de Lausanne</orgName>
</affiliation>
</author>
<author><persName><forename>Frédéric</forename><surname>Bimbot</surname></persName>
<affiliation>
<orgName type="laboratory">INRIA - IRISA</orgName>
<orgName type="team">METISS</orgName>
<country>FR</country>
<orgName type="institution">CNRS : UMR6074</orgName>
<orgName type="institution">INRIA</orgName>
<orgName type="institution">INSA Rennes</orgName>
<orgName type="institution">Université de Rennes 1</orgName>
</affiliation>
</author>
<title type="main" level="a">Fast orthogonal sparse approximation algorithms over local dictionaries</title></analytic><monogr><title level="j" type="main">Signal Processing</title><imprint><publisher>Elsevier</publisher><biblScope type="publicationDate">2011-01-08</biblScope></imprint></monogr><idno type="doi">10.1016/j.sigpro.2011.01.004</idno><idno type="HALid">http://hal.inria.fr/hal-00460558</idno><idno type="HALFile">http://hal.inria.fr/hal-00460558/PDF/LocOMP.pdf</idno></biblStruct>
</listBibl>
</listBibl>