A model for entropy coding in matching pursuit

Author

Gharavi-Aikhansari, M.

Author_Institution

Beckman Inst. for Adv. Sci. & Technol., Illinois Univ., Urbana, IL

Volume

1

fYear

1998

fDate

4-7 Oct 1998

Firstpage

778

Abstract

Matching pursuit is a powerful and flexible optimisation technique that has found applications in different areas, including image and video compression. This paper proposes an underlying probabilistic model for the entropy coding of the parameters generated by the matching pursuit algorithm in the context of image coding. It also distinguishes between orthogonal and fully-orthogonal matching pursuit, and provides a formulation for rate-distortion optimized matching pursuit

Keywords

discrete cosine transforms; entropy codes; fractals; image coding; optimisation; probability; rate distortion theory; transform coding; DCT; entropy coding; fractal coding; fully-orthogonal matching pursuit; image coding; image compression; integer programming; matching pursuit algorithm; optimisation technique; orthogonal matching pursuit; probabilistic model; quantization; rate-distortion optimized matching pursuit; transform coding; video compression; Context modeling; Entropy coding; Greedy algorithms; Image coding; Least squares approximation; Libraries; Matching pursuit algorithms; Pursuit algorithms; Rate-distortion; Vectors;

fLanguage

English

Publisher

ieee

Conference_Titel

Image Processing, 1998. ICIP 98. Proceedings. 1998 International Conference on

Conference_Location

Chicago, IL

Print_ISBN

0-8186-8821-1

Type

conf

DOI

10.1109/ICIP.1998.723617

Filename

723617