Color image scalable coding with matching pursuit

The paper presents a new scalable and highly flexible color image coder based on a matching pursuit expansion. The matching pursuit algorithm provides an intrinsically progressive stream and the proposed coder allows us to reconstruct color information from the first bit received. In order to capture edges in natural images efficiently, the dictionary of atoms is built by translation, rotation and anisotropic refinement of a wavelet-like mother function. This dictionary is moreover invariant under shifts and isotropic scaling, thus leading to very simple spatial resizing operations. This flexibility and adaptivity of the MP coder makes it appropriate for asymmetric applications with heterogeneous end user terminals.

[1]  Vladimir N. Temlyakov,et al.  Vector greedy algorithms , 2003, J. Complex..

[2]  Pascal Frossard,et al.  Highly flexible image coding using non-linear representations , 2003 .

[3]  Mark D. Fairchild,et al.  Color Appearance Models , 1997, Computer Vision, A Reference Guide.

[4]  Ian H. Witten,et al.  Arithmetic coding for data compression , 1987, CACM.

[5]  Michael H. Brill,et al.  Color appearance models , 1998 .

[6]  Pascal Frossard,et al.  A posteriori quantization of progressive matching pursuit streams , 2004, IEEE Transactions on Signal Processing.

[7]  Mahdi Nezamabadi,et al.  Color Appearance Models , 2014, J. Electronic Imaging.

[8]  Pascal Frossard,et al.  High-flexibility scalable image coding , 2003, Visual Communications and Image Processing.

[9]  S. Mallat,et al.  Adaptive time-frequency decomposition with matching pursuits , 1992, [1992] Proceedings of the IEEE-SP International Symposium on Time-Frequency and Time-Scale Analysis.

[10]  Donald L. Duttweiler,et al.  Probability estimation in arithmetic and adaptive-Huffman entropy coders , 1995, IEEE Trans. Image Process..

[11]  Stéphane Mallat,et al.  Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..