The M-Term Pursuit for Image Representation and Progressive Compression

This paper introduces a sparse signal representation algorithm in redundant dictionaries, called the M-Term Pursuit (MTP), with an application to image representation and scalable coding. The MTP algorithm belongs to the framework of the matching pursuit (MP); it expands the image into a linear combination of atoms, selected from a large collection of spatial atoms. The MTP relies on the concept of dictionary partitioning, i.e., as splitting the dictionary into $L$ disjoint sub-dictionaries, each carrying some specific information. Then, it iteratively finds a $K$-term approximation, by selecting $M$ atoms at a time, where $M


Published in:
Proceedings of the IEEE International Conference on Image Processing
Year:
2005
Publisher:
EUSIPCO
Keywords:
Laboratories:




 Record created 2006-06-14, last modified 2018-11-26

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)