14 search results - page 3 / 3 » Bi-level Locality Sensitive Hashing for k-Nearest Neighbor C... |
ACCV
2007
Springer
14 years 2 months ago
2007
Springer
This paper presents an efficient indexing and retrieval scheme for searching in document image databases. In many non-European languages, optical character recognizers are not very...
NIPS
2004
14 years 6 days ago
2004
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...
CVPR
2004
IEEE
15 years 26 days ago
2004
IEEE
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...
ICCV
2009
IEEE
15 years 3 months ago
2009
IEEE
Median-shift is a mode seeking algorithm that relies on
computing the median of local neighborhoods, instead of
the mean. We further combine median-shift with Locality
Sensitive...