Sciweavers

214 search results - page 40 / 43
» Computing the Closest Point to a Circle
Sort
View
NIPS
2001
13 years 8 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
Pascal Vincent, Yoshua Bengio
JMM2
2007
218views more  JMM2 2007»
13 years 7 months ago
A Novel Method for 3D Face Detection and Normalization
—When automatically analyzing images of human faces, either for recognition in biometry applications or facial expression analysis in human machine interaction, one has to cope w...
Robert Niese, Ayoub Al-Hamadi, Bernd Michaelis
SMA
2005
ACM
239views Solid Modeling» more  SMA 2005»
14 years 1 months ago
Bender: a virtual ribbon for deforming 3D shapes in biomedical and styling applications
In contrast to machined mechanical parts, the 3D shapes encountered in biomedical or styling applications contain many tubular parts, protrusions, engravings, embossings, folds, a...
Ignacio Llamas, Alexander Powell, Jarek Rossignac,...
ICPR
2008
IEEE
14 years 8 months ago
Solving quadratically constrained geometrical problems using lagrangian duality
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
Carl Olsson, Anders Eriksson
CVPR
2006
IEEE
14 years 9 months ago
Object Pose Detection in Range Scan Data
We address the problem of detecting complex articulated objects and their pose in 3D range scan data. This task is very difficult when the orientation of the object is unknown, an...
Jim Rodgers, Dragomir Anguelov, Hoi-Cheung Pang, D...