loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
18th International Conference on Pattern Recognition (ICPR'06) Volume 2
Fast Image Retrieval Based on Equal-average Equal-variance K-Nearest Neighbour Search
Hong Kong
August 20-August 24
ISBN: 0-7695-2521-0
Zhe-Ming Lu, Harbin Institute of Technology Shenzhen Graduate School,China
Hans Burkhardt, University of Freiburg, D-79110 Freiburg, Germany
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 equalvariance 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.
Citation:
Zhe-Ming Lu, Hans Burkhardt, "Fast Image Retrieval Based on Equal-average Equal-variance K-Nearest Neighbour Search," icpr, vol. 2, pp.853-, 18th International Conference on Pattern Recognition (ICPR'06) Volume 2, 2006
Usage of this product signifies your acceptance of the Terms of Use.