Fast progressively refined image retrieval

Mitchell D. Swanson; Ahmed H. Tewfik

doi:10.1117/1.482611

Abstract

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.

Citation Download Citation

Mitchell D. Swanson, Ahmed H. Tewfik, "Fast progressively refined image retrieval," Journal of Electronic Imaging 7(3), (1 July 1998). https://doi.org/10.1117/1.482611 . Submission:

ACCESS THE FULL ARTICLE

PERSONAL SIGN IN
Full access may be available with your subscription

Email or Username Forgot your username?

Password Forgot your password?

Show

Remember Email/Username on this computer

Remember Password

No SPIE account? Create an account
or Institutional Sign In via Shibboleth

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $20.00

Non-members: $25.00 ADD TO CART

Show All Keywords

Keywords/Phrases

Search In:

Publication Years