loading...
Fast Similarity Search for High-Dimensional Dataset
San Diego, CA December 11-December 13
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISM.2006.78Eighth IEEE International Symposium o ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Quan Wang, University of Southern California, USA
Suya You, University of Southern California, USA
This paper addresses the challenging problem of rapidly searching and matching high-dimensional features for the applications of multimedia database retrieval and pattern recognition. Most current methods suffer from the problem of dimensionality curse. A number of theoretical and experimental studies lead us to pursue a new approach, called Fast Filtering Vector Approximation (FFVA) to tackle the problem. FFVA is a nearest neighbor search technique that facilitates rapidly indexing and recovering the most similar matches to a high-dimensional database of features or spatial data. Extensive experiments have demonstrated effectiveness of the proposed approach.
Citation:
Quan Wang, Suya You, "Fast Similarity Search for High-Dimensional Dataset," ism, pp.799-804, Eighth IEEE International Symposium on Multimedia (ISM'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.