Sciweavers

214 search results - page 11 / 43
» Computing the Closest Point to a Circle
Sort
View
CGI
2004
IEEE
13 years 11 months ago
Range Image Registration via Probability Field
This paper presents a powerful variant of the ICP (Iterative Closest Point) algorithm for registering range images using a probability field. The probability field (p-field) repre...
Haitao Zhang, Olaf A. Hall-Holt, Arie E. Kaufman
CVPR
2004
IEEE
13 years 11 months ago
Scale-Invariant Shape Features for Recognition of Object Categories
We introduce a new class of distinguished regions based on detecting the most salient convex local arrangements of contours in the image. The regions are used in a similar way to ...
Frédéric Jurie, Cordelia Schmid
GD
2000
Springer
13 years 11 months ago
Fast Layout Methods for Timetable Graphs
Abstract. Timetable graphs are used to analyze transportation networks. In their visualization, vertex coordinates are fixed to preserve the underlying geography, but due to small ...
Ulrik Brandes, Galina Shubina, Roberto Tamassia, D...
ISSAC
1998
Springer
101views Mathematics» more  ISSAC 1998»
13 years 11 months ago
Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
Markus A. Hitz, Erich Kaltofen
CVPR
2004
IEEE
14 years 9 months ago
A Minimal Solution to the Generalised 3-Point Pose Problem
It is a well known classical result that given the image projections of three known world points it is possible to solve for the pose of a calibrated perspective camera to up to f...
David Nistér