Loading…
Recovering the position and orientation of free-form objects from image contours using 3D distance maps
The accurate matching of 3D anatomical surfaces with sensory data such as 2D X-ray projections is a basic problem in computer and robot assisted surgery, In model-based vision, this problem can be formulated as the estimation of the spatial pose (position and orientation) of a 3D smooth object from...
Saved in:
Published in: | IEEE transactions on pattern analysis and machine intelligence 1995-04, Vol.17 (4), p.378-390 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | The accurate matching of 3D anatomical surfaces with sensory data such as 2D X-ray projections is a basic problem in computer and robot assisted surgery, In model-based vision, this problem can be formulated as the estimation of the spatial pose (position and orientation) of a 3D smooth object from 2D video images. The authors present a new method for determining the rigid body transformation that describes this match. The authors' method performs a least squares minimization of the energy necessary to bring the set of the camera-contour projection lines tangent to the surface. To correctly deal with projection lines that penetrate the surface, the authors consider the minimum signed distance to the surface along each line (i.e., distances inside the object are negative). To quickly and accurately compute distances to the surface, the authors introduce a precomputed distance map represented using an octree spline whose resolution increases near the surface. This octree structure allows the authors to quickly find the minimum distance along each line using best-first search. Experimental results for 3D surface to 2D projection matching are presented for both simulated and real data. The combination of the authors' problem formulation in 3D, their computation of line to surface distances with the octree-spline distance map, and their simple minimization technique based on the Levenberg-Marquardt algorithm results in a method that solves the 3D/2D matching problem for arbitrary smooth shapes accurately and quickly.< > |
---|---|
ISSN: | 0162-8828 1939-3539 |
DOI: | 10.1109/34.385980 |