2,408 research outputs found

    Exact Weighted-FBP Algorithm for Three-Orthogonal-Circular Scanning Reconstruction

    Get PDF
    Recently, 3D image fusion reconstruction using a FDK algorithm along three-orthogonal circular isocentric orbits has been proposed. On the other hand, we know that 3D image reconstruction based on three-orthogonal circular isocentric orbits is sufficient in the sense of Tuy data sufficiency condition. Therefore the datum obtained from three-orthogonal circular isocentric orbits can derive an exact reconstruction algorithm. In this paper, an exact weighted-FBP algorithm with three-orthogonal circular isocentric orbits is derived by means of Katsevich's equations of filtering lines based on a circle trajectory and a modified weighted form of Tuy's reconstruction scheme

    Circle plus Partial Helical Scan Scheme for a Flat Panel Detector-Based Cone Beam Breast X-Ray CT

    Get PDF
    Flat panel detector-based cone beam breast CT (CBBCT) can provide 3D image of the scanned breast with 3D isotropic spatial resolution, overcoming the disadvantage of the structure superimposition associated with X-ray projection mammography. It is very difficult for Mammography to detect a small carcinoma (a few millimeters in size) when the tumor is occult or in dense breast. CBBCT featured with circular scan might be the most desirable mode in breast imaging due to its simple geometrical configuration and potential applications in functional imaging. An inherited large cone angle in CBBCT, however, will yield artifacts in the reconstruction images when only a single circular scan is employed. These artifacts usually manifest themselves as density drop and object geometrical distortion that are more noticeable in the reconstructed image areas that are further away from the circular scanning plane. In order to combat this drawback, a circle plus partial helical scan scheme is proposed. An exact circle plus straight line scan scheme is also conducted in computer simulation for the purpose of comparison. Computer simulations using a numerical breast phantom demonstrated the practical feasibility of this new scheme and correction to those artifacts to a certain degree

    Artefact Reduction Methods for Iterative Reconstruction in Full-fan Cone Beam CT Radiotherapy Applications

    Get PDF
    A cone beam CT (CBCT) system acquires two-dimensional projection images of an imaging object from multiple angles in one single rotation and reconstructs the object geometry in three dimensions for volumetric visualization. It is mounted on most modern linear accelerators and is routinely used in radiotherapy to verify patient positioning, monitor patient contour changes throughout the course of treatment, and enable adaptive radiotherapy planning. Iterative image reconstruction algorithms use mathematical methods to iteratively solve the reconstruction problem. Iterative algorithms have demonstrated improvement in image quality and / or reduction in imaging dose over traditional filtered back-projection (FBP) methods. However, despite the advancement in computer technology and growing availability of open-source iterative algorithms, clinical implementation of iterative CBCT has been limited. This thesis does not report development of codes for new iterative image reconstruction algorithms. It focuses on bridging the gap between the algorithm and its implementation by addressing artefacts that are the results of imperfections from the raw projections and from the imaging geometry. Such artefacts can severely degrade image quality and cannot be removed by iterative algorithms alone. Practical solutions to solving these artefacts will be presented and this in turn will better enable clinical implementation of iterative CBCT reconstruction

    REVIEW OF RECENT DEVELOPMENTS IN CONE-BEAM CT RECONSTRUCTION ALGORITHMS FOR LONG-OBJECT PROBLEM

    Full text link

    An Efficient Estimation Method for Reducing the Axial Intensity Drop in Circular Cone-Beam CT

    Get PDF
    Reconstruction algorithms for circular cone-beam (CB) scans have been extensively studied in the literature. Since insufficient data are measured, an exact reconstruction is impossible for such a geometry. If the reconstruction algorithm assumes zeros for the missing data, such as the standard FDK algorithm, a major type of resulting CB artifacts is the intensity drop along the axial direction. Many algorithms have been proposed to improve image quality when faced with this problem of data missing; however, development of an effective and computationally efficient algorithm remains a major challenge. In this work, we propose a novel method for estimating the unmeasured data and reducing the intensity drop artifacts. Each CB projection is analyzed in the Radon space via Grangeat's first derivative. Assuming the CB projection is taken from a parallel beam geometry, we extract those data that reside in the unmeasured region of the Radon space. These data are then used as in a parallel beam geometry to calculate a correction term, which is added together with Hu's correction term to the FDK result to form a final reconstruction. More approximations are then made on the calculation of the additional term, and the final formula is implemented very efficiently. The algorithm performance is evaluated using computer simulations on analytical phantoms. The reconstruction comparison with results using other existing algorithms shows that the proposed algorithm achieves a superior performance on the reduction of axial intensity drop artifacts with a high computation efficiency

    Development and Implementation of Fully 3D Statistical Image Reconstruction Algorithms for Helical CT and Half-Ring PET Insert System

    Get PDF
    X-ray computed tomography: CT) and positron emission tomography: PET) have become widely used imaging modalities for screening, diagnosis, and image-guided treatment planning. Along with the increased clinical use are increased demands for high image quality with reduced ionizing radiation dose to the patient. Despite their significantly high computational cost, statistical iterative reconstruction algorithms are known to reconstruct high-quality images from noisy tomographic datasets. The overall goal of this work is to design statistical reconstruction software for clinical x-ray CT scanners, and for a novel PET system that utilizes high-resolution detectors within the field of view of a whole-body PET scanner. The complex choices involved in the development and implementation of image reconstruction algorithms are fundamentally linked to the ways in which the data is acquired, and they require detailed knowledge of the various sources of signal degradation. Both of the imaging modalities investigated in this work have their own set of challenges. However, by utilizing an underlying statistical model for the measured data, we are able to use a common framework for this class of tomographic problems. We first present the details of a new fully 3D regularized statistical reconstruction algorithm for multislice helical CT. To reduce the computation time, the algorithm was carefully parallelized by identifying and taking advantage of the specific symmetry found in helical CT. Some basic image quality measures were evaluated using measured phantom and clinical datasets, and they indicate that our algorithm achieves comparable or superior performance over the fast analytical methods considered in this work. Next, we present our fully 3D reconstruction efforts for a high-resolution half-ring PET insert. We found that this unusual geometry requires extensive redevelopment of existing reconstruction methods in PET. We redesigned the major components of the data modeling process and incorporated them into our reconstruction algorithms. The algorithms were tested using simulated Monte Carlo data and phantom data acquired by a PET insert prototype system. Overall, we have developed new, computationally efficient methods to perform fully 3D statistical reconstructions on clinically-sized datasets

    Cone-Beam Composite-Circling Scan and Exact Image Reconstruction for a Quasi-Short Object

    Get PDF
    Here we propose a cone-beam composite-circling mode to solve the quasi-short object problem, which is to reconstruct a short portion of a long object from longitudinally truncated cone-beam data involving the short object. In contrast to the saddle curve cone-beam scanning, the proposed scanning mode requires that the X-ray focal spot undergoes a circular motion in a plane facing the short object, while the X-ray source is rotated in the gantry main plane. Because of the symmetry of the proposed mechanical rotations and the compatibility with the physiological conditions, this new mode has significant advantages over the saddle curve from perspectives of both engineering implementation and clinical applications. As a feasibility study, a backprojection filtration (BPF) algorithm is developed to reconstruct images from data collected along a composite-circling trajectory. The initial simulation results demonstrate the correctness of the proposed exact reconstruction method and the merits of the proposed mode

    Partial-Data Interpolation During Arcing of an X-Ray Tube in a Computed Tomography Scanner

    Get PDF
    X-ray tubes are used in computed tomography (CT) scanners as the energy source for generation of images. These tubes occasionally tend to arc, an undesired phenomenon where high current surges through the tube. During the time that the x-ray tube recovers to full voltage after an arc, image data is being collected. Normally this data, acquired at less than full voltage, is discarded and interpolation is performed over the arc duration. However, this is not ideal and some residual imperfections in images, called artifacts, still remain. Proposed here is an algorithm that corrects for improper tube voltage, allowing previously discarded data to be used for imaging. Instead of throwing away all data during the arc period, we use some of the data that is available as the voltage is rising back to its programmed value. This method reduces the length of the interpolation period, thus reducing artifacts. Results of implementation on a CT scanner show that there is an improvement in image quality using the partial-data interpolation method when compared to standard interpolation and that we can save up to 30 of data from being lost during an arc. With the continuous drive from the imaging field to have faster scanners with short image acquisition times, adverse effects due to arcing are becoming more significant and the improvement proposed in this research is increasingly relevan

    Partial-Data Interpolation During Arcing of an X-Ray Tube in a Computed Tomography Scanner

    Get PDF
    X-ray tubes are used in computed tomography (CT) scanners as the energy source for generation of images. These tubes occasionally tend to arc, an undesired phenomenon where high current surges through the tube. During the time that the x-ray tube recovers to full voltage after an arc, image data is being collected. Normally this data, acquired at less than full voltage, is discarded and interpolation is performed over the arc duration. However, this is not ideal and some residual imperfections in images, called artifacts, still remain. Proposed here is an algorithm that corrects for improper tube voltage, allowing previously discarded data to be used for imaging. Instead of throwing away all data during the arc period, we use some of the data that is available as the voltage is rising back to its programmed value. This method reduces the length of the interpolation period, thus reducing artifacts. Results of implementation on a CT scanner show that there is an improvement in image quality using the partial-data interpolation method when compared to standard interpolation and that we can save up to 30 of data from being lost during an arc. With the continuous drive from the imaging field to have faster scanners with short image acquisition times, adverse effects due to arcing are becoming more significant and the improvement proposed in this research is increasingly relevan
    corecore