Sciweavers

22 search results - page 2 / 5
» Fast approximate kernel-based similarity search for image re...
Sort
View
TMM
2008
201views more  TMM 2008»
13 years 9 months ago
Fast Best-Match Shape Searching in Rotation-Invariant Metric Spaces
Object recognition and content-based image retrieval systems rely heavily on the accurate and efficient identification of shapes. A fundamental requirement in the shape analysis p...
Dragomir Yankov, Eamonn J. Keogh, Li Wei, Xiaopeng...
ICCV
2009
IEEE
1022views Computer Vision» more  ICCV 2009»
15 years 2 months ago
Kernelized Locality-Sensitive Hashing for Scalable Image Search
Fast retrieval methods are critical for large-scale and data-driven vision applications. Recent work has explored ways to embed high-dimensional features or complex distance fun...
Brian Kulis, Kristen Grauman
CVPR
2010
IEEE
14 years 5 months ago
SPEC Hashing: Similarity Preserving algorithm for Entropy-based Coding
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
Ruei-Sung Lin, David Ross, Jay Yagnik
CVPR
2004
IEEE
14 years 11 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell
SDM
2007
SIAM
201views Data Mining» more  SDM 2007»
13 years 11 months ago
Fast Best-Match Shape Searching in Rotation Invariant Metric Spaces
Object recognition and content-based image retrieval systems rely heavily on the accurate and efficient identification of shapes. A fundamental requirement in the shape analysis ...
Dragomir Yankov, Eamonn J. Keogh, Li Wei, Xiaopeng...