By Topic

Reconstruction of 3-D binary tree-like structures from three mutually orthogonal projections

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
$33 $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)
Ying Sun ; Dept. of Electr. Eng., Rhode Island Univ., Kingston, RI, USA ; Iching Liu ; J. K. Grady

A method is developed to generate the 3D binary representation for a tree-like object from three mutually orthogonal projections. This is done by first backprojecting the binarized images from three directions and then iteratively removing artifacts in the backprojection. Three different algorithms have been developed: the Lagrange multiplier algorithm, the conjugate gradient algorithm, and the minimum-voxel representation algorithm (MRA). The performance of these algorithms under noise-free conditions is evaluated using mathematically projected images of a 3D tree structure. While all three algorithms are capable of producing a relatively accurate reconstruction, the MRA is superior not only because it requires the least amount of computation but also because it uses binary instead of gray-scale information in the input images. Reconstruction of 3D coronary arterial structures using MRA is further verified with X-ray images of a human chest phantom and shows a satisfactory performance. The result of this study should be valuable for 3D imaging of blood vessels

Published in:

IEEE Transactions on Pattern Analysis and Machine Intelligence  (Volume:16 ,  Issue: 3 )