By Topic

Diagramming registration connectivity and structure [computer-assisted surgery]

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Lea, J.T. ; Dept. of Mech. Eng., Northwestern Univ., Evanston, IL, USA ; Santos Munne, J. ; Peshkin, M.A.

Connectivity properties of registration graphs are useful in the study of registration pathways and immobilization requirements of computer-assisted surgery (CAS) systems. They can also be used as a diagrammatic technique for explaining CAS registration strategies and procedures. Several caveats should be observed: the relative technical difficulty of operations represented by the graphs is obscured; the graphs do not address the accuracy of individual measurement operations. At the level of detail shown here, the graphs do not distinguish measurement operations of full rank from those of reduced rank (fewer than six degrees of freedom). The authors know of at least one other way of forming an induced link, besides closing a simultaneous connected subgraph around it. This will be addressed in a subsequent report. Systems graphed here are represented to the best of the authors' knowledge and inference of their actual procedures. In some cases the authors have had to presume that, for instance, a measurement is established by a coordinate measuring machine, when it may in fact have been established some other way

Published in:

Engineering in Medicine and Biology Magazine, IEEE  (Volume:14 ,  Issue: 3 )