By Topic

Stable and efficient shift-variant algorithm for circle-plus-lines orbits in cone-beam CT

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

6 Author(s)

Defrise and Clack (see IEEE Trans. Med. Imag., vol.13, p.186-95, 1994) , and also Kudo and Saito (see IEEE Trans. Med. Imag., vol.13, p.196-211, 1994), have derived an exact algorithm suited to accurately reconstruct cone-beam data acquired from any complete orbit. These algorithms are written in the form of a shift-variant filtered backprojection. Their main characteristic is their capability to handle in many different ways the redundancy inherent to cone-beam data sets. We investigate the interplay between the redundancy handling and the stability and efficiency of the algorithm. Specifically, we show how to handle the redundancy to turn shift-variant filtering of some projections into shift-invariant filtering. Invoking this result, we define then a new algorithm suited to accurately and efficiently reconstruct data acquired from circle-plus-lines orbits. The new algorithm is tested on simulated data and real data from industrial imaging of waste containers

Published in:

Image Processing, 1996. Proceedings., International Conference on  (Volume:3 )

Date of Conference:

16-19 Sep 1996