Sciweavers

824 search results - page 32 / 165
» Efficient Distance Computation Between Non-Convex Objects
Sort
View
3DOR
2008
13 years 10 months ago
Isometry-invariant Matching of Point Set Surfaces
Shape deformations preserving the intrinsic properties of a surface are called isometries. An isometry deforms a surface without tearing or stretching it, and preserves geodesic d...
Mauro R. Ruggeri, Dietmar Saupe
CVPR
2001
IEEE
14 years 10 months ago
Learning Models for Object Recognition
We consider learning models for object recognition from examples. Our method is motivated by systems that use the Hausdorff distance as a shape comparison measure. Typically an ob...
Pedro F. Felzenszwalb
ASSETS
2006
ACM
14 years 2 months ago
Interactive tracking of movable objects for the blind on the basis of environment models and perception-oriented object recognit
In previous work we have presented a prototype of an assistant system for the blind that can be used for self-localization and interactive object identification of static objects ...
Andreas Hub, Tim Hartter, Thomas Ertl
CVPR
2000
IEEE
14 years 10 months ago
Robust and Efficient Skeletal Graphs
There has recently been significant interest in using repions based on abstractions of Blum's skeleton into a graph, for qualitative shape matching. The application of these ...
Pavel Dimitrov, Carlos Phillips, Kaleem Siddiqi
ICCV
2009
IEEE
13 years 5 months ago
Local distance functions: A taxonomy, new algorithms, and an evaluation
We present a taxonomy for local distance functions where most existing algorithms can be regarded as approximations of the geodesic distance defined by a metric tensor. We categor...
Deva Ramanan, Simon Baker