Paper
6 October 1997 Inverted image indexing and compression
Author Affiliations +
Proceedings Volume 3229, Multimedia Storage and Archiving Systems II; (1997) https://doi.org/10.1117/12.290346
Event: Voice, Video, and Data Communications, 1997, Dallas, TX, United States
Abstract
Inverted file indexing and its compression have proved to be highly successful for free-text retrieval. Although the 'inverted' nature of the data structure provides an efficient mechanism for searching key words or terms in large documents, for image retrieval, the application of inverted files to the title, caption, or description of the images are not sufficient. One must be able to index and retrieve images based on the visual contents. Many content-based image retrieval techniques are used for the images as a whole picture. Analogous to free-text retrieval, a novel technique, called inverted image indexing and compression, is proposed in this paper. Similar to works in a document, each image can have multiple areas which are perceived to be meaningful visual contents. These areas are selected by users and then undergo two processes: automatic signature generation based on wavelet signatures, and users specification of high-level contents using ternary fact model. The contents in compressed form are inserted into an inverted image file. The concept of composite bitplane signature is also introduced.
© (1997) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Simon Wing-Wah So and Clement H. C. Leung "Inverted image indexing and compression", Proc. SPIE 3229, Multimedia Storage and Archiving Systems II, (6 October 1997); https://doi.org/10.1117/12.290346
Lens.org Logo
CITATIONS
Cited by 3 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image compression

Image retrieval

Composites

Visualization

Wavelets

Databases

Content based image retrieval

Back to Top