1 July 1998 Fast progressively refined image retrieval
Mitchell D. Swanson, Ahmed H. Tewfik
Author Affiliations +
We develop a new image representation which combines support for coding and content-based retrieval. The algorithm minimizes a weighted sum of the expected compressed file size and query response time. Our approach leads to a progressive refinement retrieval by successively reducing the number of searched files as more bits are read. Furthermore, no distance computations are required during a query. Only simple bit pattern comparisons are required. In our experimental results based on a 1.4 Mbyte image database, the number of bits read during a typical retrieval was less than 1000 bytes (less than 0.08% of the database). The approach supports compressed data modification and low-bit-rate high quality browsing.
Mitchell D. Swanson and Ahmed H. Tewfik "Fast progressively refined image retrieval," Journal of Electronic Imaging 7(3), (1 July 1998). https://doi.org/10.1117/1.482611
Published: 1 July 1998
Lens.org Logo
CITATIONS
Cited by 1 patent.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image retrieval

Image compression

Databases

Prototyping

Associative arrays

Image quality

Wavelets

RELATED CONTENT

Approximate search in image database
Proceedings of SPIE (December 23 1999)
Image coding for content-based retrieval
Proceedings of SPIE (February 27 1996)
Multiresolution image retrieval using B-splines
Proceedings of SPIE (October 06 1997)
Image retrieval based on wavelet vector quantization
Proceedings of SPIE (October 01 1998)
Fractal-based image storage and indexing
Proceedings of SPIE (December 23 1999)

Back to Top