83 search results - page 8 / 17 » Fast Euclidean Distance Transform using a Graph-Search Algor... |
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
This paper addresses the image registration problem applying genetic algorithms. The image registration’s objective is the definition of a mapping that best match two set of poi...
245
click to vote
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 ...
SODA
1998
ACM
14 years 11 months ago
1998
ACM
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
ISVC
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. This paper presents a fast algorithm for robust registration of shapes implicitly represented by signed distance functions(SDF). The proposed algorithm aims to recover th...
69
Voted
MFCS
1994
Springer
15 years 1 months ago
1994
Springer
We show that the wavefront approach to Voronoi diagrams (a deterministic line sweep algorithm that does not use geometric transform) can be generalized to distance measures more g...