83 search results - page 11 / 17 » Fast Euclidean Distance Transform using a Graph-Search Algor... |
103
Voted
ECCV
2002
Springer
15 years 11 months ago
2002
Springer
Abstract. The plane-based calibration consists in recovering the internal parameters of the camera from the views of a planar pattern with a known geometric structure. The existing...
ICIP
2003
IEEE
15 years 2 months ago
2003
IEEE
We propose a novel algorithm to compute Voronoi diagrams of order k in arbitrary 2D and 3D domains. The algorithm is based on a fast ordered propagation distance transformation ca...
SIAMREV
2010
14 years 4 months ago
2010
Computational Convex Analysis algorithms have been rediscovered several times in the past by researchers from different fields. To further communications between practitioners, we ...
WADS
2007
Springer
15 years 3 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
69
Voted
PAMI
2008
14 years 9 months ago
2008
This paper describes a method for robust real time pattern matching. We first introduce a family of image distance measures, the "Image Hamming Distance Family". Members ...