Share Email Print
cover

Proceedings Paper

Fast two-phased initial search technique for arbitrary-shaped queries
Author(s): Khanh Vu; Kien A. Hua; Nualsawat Hiransakolwong
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Most content-based image retrieval techniques are not able to eliminate noise from similarity matching since they capture the features of the entire image area or pre- perceived objects at the database build time. Recent approaches address this outstanding issue by allowing users to arbitrarily exclude noise in formulating their queries. This capability has resulted in high retrieval effectiveness for a wide range of queries. However, implementing these techniques for large image collections presents a great challenge since we can not assume any shape for queries defined by users. In this paper, we propose an efficient indexing/retrieval technique for arbitrarily-shaped queries which is able to eliminate a majority of unqualified images. Moreover, we improve the retrieval process with a filtering phase to prune out additional false matches before the detailed similarity measure is carried out. We have implemented the proposed technique in our image retrieval system for a large image collection. Our experimental results show that our technique is capable of handling image matching very well and 70 times on average faster than the straightforward sequential scanning.

Paper Details

Date Published: 1 January 2001
PDF: 10 pages
Proc. SPIE 4315, Storage and Retrieval for Media Databases 2001, (1 January 2001); doi: 10.1117/12.410961
Show Author Affiliations
Khanh Vu, Univ. of Central Florida (United States)
Kien A. Hua, Univ. of Central Florida (United States)
Nualsawat Hiransakolwong, Univ. of Central Florida (United States)


Published in SPIE Proceedings Vol. 4315:
Storage and Retrieval for Media Databases 2001
Minerva M. Yeung; Chung-Sheng Li; Rainer W. Lienhart, Editor(s)

© SPIE. Terms of Use
Back to Top