The M-term pursuit for image representation and progressive compression

• Published in: IEEE International Conference on Image Processing 2005 Vol. 1; pp. I - 73
• Main Authors: Rahmoune, A., Vandergheynst, P., Frossard, P.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 2005
• Subjects: Approximation algorithms; Computational complexity; Dictionaries; Image coding; Image representation; Iterative algorithms; Matching pursuit algorithms; Partitioning algorithms; Pursuit algorithms; Signal representations
• ISBN: 9780780391345; 0780391349
• ISSN: 1522-4880; 2381-8549
• DOI: 10.1109/ICIP.2005.1529690

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) (S. Mallat and Z. Zhang, 1993); 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 /spl les/ L, followed by an orthogonal projection. The approximation performances of the MTP algorithm have been shown to yield comparable results with those of the matching pursuit. However, it presents the advantage of a reduced computational complexity. For progressive image compression, an embedded quantization and coding step is applied on the series of obtained atoms based on the subset approach (A. Rahomoune, et al, 2004); to generate a flexible bitstream. The performances of the MTP image coder are finally shown to compare favorably against those of the state-of-the-art JPEG-2000 scheme, in terms of rate-distortion characteristics.