scispace - formally typeset
Open Access

Laboratory Investigations Techniques for Fast and Accurate Intrasurgical Registration

Reads0
Chats0
TLDR
It is demonstrated, using data from a human femur, that dis- crete-point data sets selected using the method are superior to those selected by human experts in terms of the resulting pose-refinement accuracy.
Abstract
The goal of intrasurgical registration is to establish a common reference frame be- tween presurgical and intrasurgical three-dimensional data sets that correspond to the same anatomy. This paper presents two novel techniques that have application to this problem, high-speed pose tracking and intrasurgical data selection. In the first part of this paper, we describe an approach for tracking the pose of arbitrarily shaped rigid objects at rates up to 10 Hz. Static accuracies on the order of 1 nun in translation and 1" in rotation have been achieved. We have demonstrated the technique on a human face using a high-speed VLSI range sensor; however, the technique is independent of the sensor used or the anatomy tracked. In the second part of this paper, we describe a general purpose approach for selecting near-optimal intrasurgical registration data. Because of the high costs of acqui- sition of htrasurgical data, our goal is to minimize the amount of data acquired while ensuring regis- tration accuracy. We synthesize near-optimal intrasurgical data sets, based on an analysis of differential surface properties of presurgical data. We demonstrate, using data from a human femur, that dis- crete-point data sets selected using our method are superior to those selected by human experts in terms of the resulting pose-refinement accuracy. J Image Guid Surg 2:27-29 (2995)). 01995 Wiley-Liss, Inc. ~

read more

Content maybe subject to copyright    Report

References
More filters
Journal ArticleDOI

A method for registration of 3-D shapes

TL;DR: In this paper, the authors describe a general-purpose representation-independent method for the accurate and computationally efficient registration of 3D shapes including free-form curves and surfaces, based on the iterative closest point (ICP) algorithm, which requires only a procedure to find the closest point on a geometric entity to a given point.
Journal ArticleDOI

Multidimensional binary search trees used for associative searching

TL;DR: The multidimensional binary search tree (or k-d tree) as a data structure for storage of information to be retrieved by associative searches is developed and it is shown to be quite efficient in its storage requirements.
Journal ArticleDOI

An Algorithm for Finding Best Matches in Logarithmic Expected Time

TL;DR: An algorithm and data structure are presented for searching a file containing N records, each described by k real valued keys, for the m closest matches or nearest neighbors to a given query record.
Journal ArticleDOI

Iterative point matching for registration of free-form curves and surfaces

TL;DR: A heuristic method has been developed for registering two sets of 3-D curves obtained by using an edge-based stereo system, or two dense3-D maps obtained by use a correlation-based stereoscopic system, and it is efficient and robust, and yields an accurate motion estimate.
Journal ArticleDOI

Estimation of planar curves, surfaces, and nonplanar space curves defined by implicit equations with applications to edge and range image segmentation

TL;DR: It is shown how this unified representation can be used for object recognition, object position estimation, and segmentation of objects into meaningful subobjects, that is, the detection of 'interest regions' that are more complex than high curvature regions and, hence, more useful as features for object Recognition.
Related Papers (5)