By Topic

Speeding up the similarity search in multimedia database

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
T. Chen ; Beckman Inst. for Adv. Sci. & Technol., Illinois Univ., Urbana, IL, USA ; M. Nakazato ; T. S. Huang

In recent years, applications in multimedia databases have been more and more important. One new capability is to search by similarity in low-level image features (such as color, texture, shape, and motion). The performance of the similarity search highly relies on efficient index structures. However, current high-dimensional indexing techniques have limitations and a simple sequential scan algorithm can outperform them in many cases. We notice that few researchers have really evaluated the utilization of the actual memory size and the trade-off between I/O access time and computation time. Some methods tried to reduce the I/O access time but caused computation overhead. We propose a novel indexing technique, the RA-Blocks (Region Approximated Blocks), to overcome these limitations and improve the similarity search in multimedia databases. We also demonstrate the better performance of our work in experiments.

Published in:

Multimedia and Expo, 2002. ICME '02. Proceedings. 2002 IEEE International Conference on  (Volume:2 )

Date of Conference: