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.
Block-based, memory-efficient JPEG2000 images indexing in compressed-domain
2002-01-01
430627 byte
Conference paper
Electronic Resource
English
Block-Based, Memory-Efficient JPEG2000 Images Indexing in Compressed-Domain
British Library Conference Proceedings | 2002
|Subband-Based, Memory-Efficient JPEG2000 Images Indexing in Compressed-Domain
British Library Conference Proceedings | 2002
|Efficient image indexing techniques in the JPEG2000 domain
British Library Online Contents | 2004
|Face recognition in JPEG and JPEG2000 compressed domain
British Library Online Contents | 2009
|