90 search results - page 3 / 18 » Efficient Parallel Algorithms for Template Matching |
DELOS
2000
13 years 7 months ago
2000
: This paper presents an overview over parallel architectures for the efficient realisation of digital libraries by considering image databases as an example. The state of the art ...
ICPR
2006
IEEE
14 years 6 months ago
2006
IEEE
The recovery of writing trajectory from offline handwritten image is generally regarded as a difficult problem [1]. This paper introduced a method to recover the writing trajector...
ICCV
1999
IEEE
14 years 7 months ago
1999
IEEE
Existing sequential feature-based registration algorithms involving search typically either select features randomly (eg. the RANSAC[8] approach) or assume a predefined, intuitive...
CVPR
2003
IEEE
14 years 7 months ago
2003
IEEE
This paper compares two methods for object localization from contours: shape context and chamfer matching of templates. In the light of our experiments, we suggest improvements to...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...