By Topic

Fast progressive image retrieval schemes based on updating enhanced equal-average equal-variance K nearest neighbour search in vector quantised feature 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
$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

3 Author(s)
Wei-Min Zheng ; Hong Kong Univ. of Sci. & Technol, Hong Kong ; Zhe-Ming Lu ; Burkhardt, H.

This paper concerns with the problem of how to retrieve the images similar to the query image as fast as possible. The feature space is vector quantized to obtain several clusters, each cluster being denoted by a codeword. The feature vectors in each cluster are sorted in the ascending order of their mean values. The online image retrieval for a given query image is then progressively performed from its nearest cluster to its farthest cluster to find the first K nearest neighbors of the query feature vector as soon as possible. Experimental results show that the proposed retrieval methods can largely speed up the retrieval process.

Published in:

Information, Communications & Signal Processing, 2007 6th International Conference on

Date of Conference:

10-13 Dec. 2007