Sciweavers

999 search results - page 40 / 200
» Finding shapes in a set of points
Sort
View
ICPR
2002
IEEE
15 years 10 months ago
The Trimmed Iterative Closest Point Algorithm
The problem of geometric alignment of two roughly preregistered, partially overlapping, rigid, noisy 3D point sets is considered. A new natural and simple, robustified extension o...
Dmitry Chetverikov, D. Svirko, Dmitry Stepanov, Pa...
SIGGRAPH
1992
ACM
15 years 1 months ago
Surface reconstruction from unorganized points
We describe and demonstrate an algorithm that takes as input an unorganized set of points fx1; : : : ; xng IR3 on or near an unknown manifold M, and produces as output a simplicia...
Hugues Hoppe, Tony DeRose, Tom Duchamp, John Alan ...
PAMI
2006
168views more  PAMI 2006»
14 years 9 months ago
Graphical Models and Point Pattern Matching
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...
Tibério S. Caetano, Terry Caelli, Dale Schu...
ICCV
1998
IEEE
15 years 11 months ago
A Real-Time Algorithm for Medical Shape Recovery
In this paper, we present a shape recovery technique in 2 0 and 3 0 with specific applications in visualizing and measuring anatomical shapes from medical images. This algorithm m...
Ravi Malladi, James A. Sethian
BMVC
1998
14 years 11 months ago
Building Shape Models from Image Sequences using Piecewise Linear Approximation
A method of extracting, classifying and modelling non-rigid shapes from an image sequence is presented. Shapes are approximated by polygons where the number of sides is related to...
Derek R. Magee, Roger D. Boyle