Fast two dimensional to three dimensional registration of fluoroscopy and CT-scans using Octrees on segmentation maps
Open Access
- 1 January 2012
- journal article
- research article
- Published by American Institute of Mathematical Sciences (AIMS) in Mathematical Biosciences and Engineering
- Vol. 9 (3) , 527-537
Abstract
We introduce a computationally efficient approach to the generation of Digital Reconstructed Radiographs (DRRs) needed to perform three dimensional to two dimensional medical image registration and apply this algorithm to virtual surgery. The DRR generation process is the bottleneck of any three dimensional to two dimensional registration system, since its computational complexity scales with the number of voxels in the Computed Tomography Data, which can be of the order of tens to hundreds of millions. Our approach originates from the segmentation of the volumetric data into multiple regions, which allows a compact representation via Octree Data Structures. This, in turn, yields efficient storage and access of the attenuation indexes of the volumetric cells, required in the projection procedure that generates the DRR. A functional based on Mutual Information is then maximized to obtain the alignment of the DRR with the two dimensional X-ray fluoroscopy scans acquired during the operation. Promising experimental results on real data are presented.Keywords
This publication has 10 references indexed in Scilit:
- On the Length and Area Regularization for Multiphase Level Set SegmentationInternational Journal of Computer Vision, 2010
- A second order accurate level set method on non-graded adaptive cartesian gridsJournal of Computational Physics, 2007
- Local level set method in high dimension and codimensionJournal of Computational Physics, 2004
- Fast intensity-based 2D-3D image registration of clinical data using light2003
- A Multiphase Level Set Framework for Image Segmentation Using the Mumford and Shah ModelInternational Journal of Computer Vision, 2002
- Active contours without edgesIEEE Transactions on Image Processing, 2001
- Tree Methods for Moving InterfacesJournal of Computational Physics, 1999
- A fast marching level set method for monotonically advancing fronts.Proceedings of the National Academy of Sciences, 1996
- Efficient algorithms for globally optimal trajectoriesIEEE Transactions on Automatic Control, 1995
- Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulationsJournal of Computational Physics, 1988