## Date of Award

2003

## Document Type

Dissertation - Restricted

## Degree Name

Doctor of Philosophy (PhD)

## Department

Biomedical Engineering

## First Advisor

Johnson, Roger

## Second Advisor

Clough, Anne

## Third Advisor

Ropella, Kristina

## Abstract

In order to increase scanning speed, the trend in clinical helical CT has been toward more detector rows, leading naturally to cone beam geometry. Therefore, algorithms accounting properly for the cone beam geometry have to be developed. There are two types of helical cone beam algorithms: one approximate, the other exact. Approximate methods are basically extensions of two dimensional tomography. They are usually efficient but will fail when the cone angle becomes large. Exact methods are based on inverse 3D Radon transform. They are relatively inefficient but their performance is independent of the cone angle. In this dissertation, we focus on the development of an exact helical cone beam algorithm for long object imaging. Our approach is based on the theory of short object imaging by Kudo et al. 1998. One of the key findings in their work is that filtering the truncated projection can be divided into two parts: One, finite in the axial direction, results from ramp filtering the data within the Tam window. The other, infinite in the z direction, results from unbounded filtering of ray sums over PI lines only. We show that for an ROI defined by PI lines emanating from the initial and final source positions on a helical segment, the boundary data which would otherwise contaminates the reconstruction of the ROI can be completely excluded. This novel definition of the ROI leads to a simple algorithm for long object imaging. The overscan of the algorithm is analytically calculated and it is the same as that of the zero boundary method. The reconstructed ROI can be divided into two regions: One is minimally contaminated by the portion outside the ROI, while the other is reconstructed free of contamination...