Sciweavers

255 search results - page 33 / 51
» An Efficient Euclidean Distance Transform
Sort
View

Presentation
3660views
16 years 11 months ago
Robust Centerline Extraction Framework Using Level Sets
In this paper, we present a novel framework for computing centerlines for both 2D and 3D shape analysis. The framework works as follows: an object centerline point is selected auto...
M. Sabry Hassouna
CIKM
2006
Springer
15 years 1 months ago
Describing differences between databases
We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...
Heiko Müller, Johann Christoph Freytag, Ulf L...
ADCM
2010
147views more  ADCM 2010»
14 years 10 months ago
Edge offset meshes in Laguerre geometry
A mesh M with planar faces is called an edge offset (EO) mesh if there exists a combinatorially equivalent mesh M d such that corresponding edges of M and M d lie on parallel lines...
Helmut Pottmann, Philipp Grohs, Bernhard Blaschitz
ICPR
2008
IEEE
15 years 4 months ago
Image transformation for object tracking in high-resolution video
We propose a new method for warping highresolution images to efficiently track objects on the ground plane in real time. Recently, the emergence of high resolution video cameras (...
Tae Eun Choe, Krishnan Ramnath, Mun Wai Lee, Niels...
BTW
2007
Springer
183views Database» more  BTW 2007»
15 years 2 months ago
Efficient Reverse k-Nearest Neighbor Estimation
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
Elke Achtert, Christian Böhm, Peer Kröge...