2127 search results - page 26 / 426 » Computing large matchings fast |
ICIP
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we present a new algorithm for solving the block matching problem which is independent of image content and is faster than other full-search methods. The method emp...
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper we propose to transform an image descriptor so that nearest neighbor (NN) search for correspondences becomes the optimal matching strategy under the assumption that ...
ICIP
2004
IEEE
15 years 11 months ago
2004
IEEE
In this paper we propose a fast motion estimation technique that works in the wavelet domain. The computational cost of the algorithm turns out to be proportional to the linear si...
SPIRE
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. In this paper, we extend the SHIFT-AND approach by BaezaYates and Gonnet (CACM 35(10), 1992) to the matching problem for network expressions, which are regular expression...
IWOCA
2009
Springer
15 years 4 months ago
2009
Springer
We develop a method for performing boolean convolutions efficiently in word RAM model of computation, having a word size of w = Ω(log n) bits, where n is the input size. The tech...