Block-based, memory-efficient JPEG2000 images indexing in compressed-domain

The contribution of this paper is the development of a fast, block-based JPEG2000 image indexing system in the compressed domain which achieves high memory efficiency. By high memory efficiency we mean the entire wavelet-decomposed coefficient matrix never needs to be buffered. The feature extracted is the variance of each rectangular block in the compressed domain. The extraction of this feature is of very low complexity. Retrieval performance on the VisTex image database has shown its effectiveness.

[1]  Antonio Ortega,et al.  Line based reduced memory, wavelet image compression , 1998, Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225).

[2]  David S. Taubman,et al.  High performance scalable image compression with EBCOT , 1999, Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348).

[3]  Thomas S. Huang,et al.  Relevance feedback: a power tool for interactive content-based image retrieval , 1998, IEEE Trans. Circuits Syst. Video Technol..

[4]  William A. Pearlman,et al.  A new, fast, and efficient image codec based on set partitioning in hierarchical trees , 1996, IEEE Trans. Circuits Syst. Video Technol..

[5]  Shih-Fu Chang,et al.  Transform features for texture classification and discrimination in large image databases , 1994, Proceedings of 1st International Conference on Image Processing.

[6]  Mrinal K. Mandal,et al.  Fast image indexing based on JPEG2000 packet header , 2001, MULTIMEDIA '01.

[7]  Michael W. Marcellin,et al.  JPEG2000 - image compression fundamentals, standards and practice , 2002, The Kluwer International Series in Engineering and Computer Science.

[8]  Sethuraman Panchanathan,et al.  Region-based indexing in the JPEG2000 framework , 2001, SPIE ITCom.

[9]  Thomas S. Huang,et al.  Optimizing learning in image retrieval , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).