52 search results - page 6 / 11 » Approximate nearest neighbors and the fast Johnson-Lindenstr... |
ECCV
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
239
Voted
ICDAR
2011
IEEE
13 years 9 months ago
2011
IEEE
—In this paper we present a novel approach for fast search of handwritten Arabic word-parts within large lexicons. The algorithm runs through three steps to achieve the required ...
JMLR
2010
14 years 4 months ago
2010
To save memory and improve speed, vectorial data such as images and signals are often represented as strings of discrete symbols (i.e., sketches). Chariker (2002) proposed a fast ...
ISM
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper addresses the challenging problem of rapidly searching and matching high-dimensional features for the applications of multimedia database retrieval and pattern recognit...
104
click to vote
CVPR
2004
IEEE
15 years 11 months ago
2004
IEEE
This paper introduces BoostMap, a method that can significantly reduce retrieval time in image and video database systems that employ computationally expensive distance measures, ...