Efficient 3D-3D vascular registration based on multiple orthogonal 2D projections

15Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we present a new and efficient multi-modal 3D-3D vascular registration algorithm, which transforms the 3D-3D registration problem into a multiple 2D-3D vascular registration problem. Along each orthogonal axis, projected 2D image from a segmented binary 3D floating volume is compared with maximum intensity projection (MIP) image of the reference volume. At the preprocessing stage of the floating image volume, vessels are segmented and represented by a number of spheres with centers located at the skeleton points of the vessels and radii equal to the distance from the skeleton points to their closest boundary. To generate projected images from the binary 3D volume, instead of using the conventional ray-casting technique, the spheres are projected to the three orthogonal projection planes. The discrepancy between the projected image and the reference MIP image is measured by a relatively simple similarity measure, sum of squared differences (SSD). By visual comparison, we found that the performances of our method and the Mutual Information (MI)-based method are visually comparable. Moreover, based on the experimental results, our method for 3D-3D vascular registration is more computationally efficient than the MI-based method. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Chan, H. M., & Chung, A. C. S. (2003). Efficient 3D-3D vascular registration based on multiple orthogonal 2D projections. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2717, 301–310. https://doi.org/10.1007/978-3-540-39701-4_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free