Reconstruction of 3-D binary tree-like structures from threemutually orthogonal projections
Ying Sun
Iching Liu
Grady, J.K.
Dept. of Electr. Eng., Rhode Island Univ., Kingston, RI;
This paper appears in: Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publication Date: Mar 1994
Volume: 16,
Issue: 3
On page(s): 241-248
ISSN: 0162-8828
References Cited: 12
CODEN: ITPIDJ
INSPEC Accession Number: 4679812
Digital Object Identifier: 10.1109/34.276123
Current Version Published: 2002-08-06
Abstract
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
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
