loading...
Using Constraint Inequality on Estimated Correlation for Rapid Image Search
Quebec City, QC, Canada August 11-August 15
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPR.2002.104461916th International Conference on Patt ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Shun 'ichi Kaneko, Hokkaido University
Takahiro Mae, Hokkaido University
Atsushi Miyamoto, Hitachi Co. Ltd.
A rapid algorithm of searching for similar images to an object image in a set of registered images is proposed. Provided that correlations of all the pairs of registered images in advance, we can derive a constraint inequality for similarity of the object. By use of the upper bounds defined by the inequality, three conditions of neglect can be derived, which enable to quicken computation of searching. Efficiency rate of eight times in average could be obtained for searching 204 images in the set of 1,200 registered images.
Citation:
Shun 'ichi Kaneko, Takahiro Mae, Atsushi Miyamoto, "Using Constraint Inequality on Estimated Correlation for Rapid Image Search," icpr, vol. 1, pp.10087, 16th International Conference on Pattern Recognition (ICPR'02) - Volume 1, 2002
Usage of this product signifies your acceptance of the Terms of Use.