By Topic

Fast Image Retrieval Based on Equal-average Equal-variance K-Nearest Neighbour Search

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
$31 $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

2 Author(s)
Zhe-Ming Lu ; Visual Inf. Anal. & Process. Res. Center, Harbin Inst. of Technol. Shenzhen ; Burkhardt, H.

This paper presents two fast schemes to speed up the retrieval process for conventional content-based image retrieval systems. The traditional features such as color and invariant histograms are extracted offline from each image to compose a feature vector. All these feature vectors construct the feature database. Then the system performs the online retrieval based on this database as soon as possible. In the case of a small number of returned images, an equal-average equal-variance k nearest neighbour search (EEKNNS) method is used to speed up the retrieval process. In the case of a large number of returned images, an iterative EEKNNS (IEEKNNS) method is given. Experimental results show that the proposed retrieval methods can largely accelerate the retrieval process while guaranteeing the same recall and precision

Published in:

Pattern Recognition, 2006. ICPR 2006. 18th International Conference on  (Volume:2 )

Date of Conference:

0-0 0