Sparse approximation using M-term pursuit and application in image and video coding

This paper introduces a novel algorithm for sparse approximation in redundant dictionaries called the M-term pursuit (MTP). This algorithm decomposes a signal into a linear combination of atoms that are selected in order to represent the main signal components. The MTP algorithm provides an adaptive...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1992. - 21(2012), 4 vom: 31. Apr., Seite 1950-62
1. Verfasser: Rahmoune, Adel (VerfasserIn)
Weitere Verfasser: Vandergheynst, Pierre, Frossard, Pascal
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2012
Zugriff auf das übergeordnete Werk:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
Schlagworte:Journal Article Research Support, Non-U.S. Gov't
LEADER 01000caa a22002652 4500
001 NLM214172279
003 DE-627
005 20250213124351.0
007 cr uuu---uuuuu
008 231224s2012 xx |||||o 00| ||eng c
024 7 |a 10.1109/TIP.2011.2181525  |2 doi 
028 5 2 |a pubmed25n0714.xml 
035 |a (DE-627)NLM214172279 
035 |a (NLM)22203716 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Rahmoune, Adel  |e verfasserin  |4 aut 
245 1 0 |a Sparse approximation using M-term pursuit and application in image and video coding 
264 1 |c 2012 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 18.07.2012 
500 |a Date Revised 22.03.2012 
500 |a published: Print-Electronic 
500 |a Citation Status MEDLINE 
520 |a This paper introduces a novel algorithm for sparse approximation in redundant dictionaries called the M-term pursuit (MTP). This algorithm decomposes a signal into a linear combination of atoms that are selected in order to represent the main signal components. The MTP algorithm provides an adaptive representation for signals in any complete dictionary. The basic idea behind the MTP is to partition the dictionary into L quasi-disjoint subdictionaries. A k-term signal approximation is then iteratively computed, where each iteration leads to the selection of M ≤ L atoms based on thresholding. The MTP algorithm is shown to achieve competitive performance with the matching pursuit (MP) algorithm that greedily selects atoms one by one. This is due to efficient partitioning of the dictionary. At the same time, the computational complexity is dramatically reduced compared to MP due to the batch selection of atoms. We finally illustrate the performance of MTP in image and video compression applications, where we show that the suboptimal atom selection of MTP is largely compensated by the reduction in complexity compared with MP 
650 4 |a Journal Article 
650 4 |a Research Support, Non-U.S. Gov't 
700 1 |a Vandergheynst, Pierre  |e verfasserin  |4 aut 
700 1 |a Frossard, Pascal  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on image processing : a publication of the IEEE Signal Processing Society  |d 1992  |g 21(2012), 4 vom: 31. Apr., Seite 1950-62  |w (DE-627)NLM09821456X  |x 1941-0042  |7 nnns 
773 1 8 |g volume:21  |g year:2012  |g number:4  |g day:31  |g month:04  |g pages:1950-62 
856 4 0 |u http://dx.doi.org/10.1109/TIP.2011.2181525  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 21  |j 2012  |e 4  |b 31  |c 04  |h 1950-62