PubMed Health⌕ Search

Biomedical subjects

Frédéric Noo

Publications and source records attributed to Frédéric Noo.

9 recordsLinked to original sources

Cone-beam reconstruction using the backprojection of locally filtered projections.

This paper describes a flexible new methodology for accurate cone beam reconstruction with source positions on a curve (or set of curves). The inversion formulas employed by this methodology are based on first backprojecting a simple derivative in the projection space and then applying a Hilbert transform inversion in the image space. The local nature of the projection space filtering distinguishes this approach from conventional filtered-backprojection methods. This characteristic together with a degree of flexibility in choosing the direction of the Hilbert transform used for inversion offers two important features for the design of data acquisition geometries and reconstruction algorithms. First, the size of the detector necessary to acquire sufficient data for accurate reconstruction of a given region is often smaller than that required by previously documented approaches. In other words, more data truncation is allowed. Second, redundant data can be incorporated for the purpose of noise reduction. The validity of the inversion formulas along with the application of these two properties are illustrated with reconstructions from computer simulated data. In particular, in the helical cone beam geometry, it is shown that 1) intermittent transaxial truncation has no effect on the reconstruction in a central region which means that wider patients can be accommodated on existing scanners, and more importantly that radiation exposure can be reduced for region of interest imaging and 2) at maximum pitch the data outside the Tam-Danielsson window can be used to reduce image noise and thereby improve dose utilization. Furthermore, the degree of axial truncation tolerated by our approach for saddle trajectories is shown to be larger than that of previous methods.

Algorithms↗

A two-step Hilbert transform method for 2D image reconstruction.

The paper describes a new accurate two-dimensional (2D) image reconstruction method consisting of two steps. In the first step, the backprojected image is formed after taking the derivative of the parallel projection data. In the second step, a Hilbert filtering is applied along certain lines in the differentiated backprojection (DBP) image. Formulae for performing the DBP step in fanbeam geometry are also presented. The advantage of this two-step Hilbert transform approach is that in certain situations, regions of interest (ROIs) can be reconstructed from truncated projection data. Simulation results are presented that illustrate very similar reconstructed image quality using the new method compared to standard filtered backprojection, and that show the capability to correctly handle truncated projections. In particular, a simulation is presented of a wide patient whose projections are truncated laterally yet for which highly accurate ROI reconstruction is obtained.

Algorithms↗

Exact and approximate algorithms for helical cone-beam CT.

This paper concerns image reconstruction for helical x-ray transmission tomography (CT) with multi-row detectors. We introduce two approximate cone-beam (CB) filtered-backprojection (FBP) algorithms of the Feldkamp type, obtained by extending to three dimensions (3D) two recently proposed exact FBP algorithms for 2D fan-beam reconstruction. The new algorithms are similar to the standard Feldkamp-type FBP for helical CT. In particular, they can reconstruct each transaxial slice from data acquired along an arbitrary segment of helix, thereby efficiently exploiting the available data. In contrast to the standard Feldkamp-type algorithm, however, the redundancy weight is applied after filtering, allowing a more efficient numerical implementation. To partially alleviate the CB artefacts, which increase with increasing values of the helical pitch, a frequency-mixing method is proposed. This method reconstructs the high frequency components of the image using the longest possible segment of helix, whereas the low frequencies are reconstructed using a minimal, short-scan, segment of helix to minimize CB artefacts. The performance of the algorithms is illustrated using simulated data.

Algorithms↗

Investigation of saddle trajectories for cardiac CT imaging in cone-beam geometry.

This paper investigates cone-beam tomography for a wide class of x-ray source trajectories called saddles. In particular, a mathematical analysis of the number of intersections between a saddle and an arbitrary plane is given. This analysis demonstrates that axially truncated cone-beam projections acquired along a saddle can be used for exact reconstruction at any point in a large volume. The reconstruction can be achieved either using a new algorithm presented herein or using a formula recently introduced by Katsevich (2003 Int. J. Math. Math. Sci. 21 1305-21). The shape of the reconstructed volume and the properties of saddles make saddles attractive for cardiac imaging. Three examples of saddles are presented with a discussion of implementation on devices similar to modern C-arm systems and multislice CT scanners. Reconstruction with one of these saddles has been tested using computer-simulated data, with and without truncation. The imaged phantom for the truncated data is a FORBILD head phantom (representing the heart) that has been modified and embedded inside the FORBILD thorax phantom. The non-truncated data were generated by excluding the thorax. The reconstructed images demonstrate the accuracy of the mathematical results.

Algorithms↗

General reconstruction theory for multislice X-ray computed tomography with a gantry tilt.

This paper discusses image reconstruction with a tilted gantry in multislice computed tomography (CT) with helical (spiral) data acquisition. The reconstruction problem with gantry tilt is shown to be transformable into the problem of reconstructing a virtual object from multislice CT data with no gantry tilt, for which various algorithms exist in the literature. The virtual object is related to the real object by a simple affine transformation that transforms the tilted helical trajectory of the X-ray source into a nontilted helix, and the real object can be computed from the virtual object using one-dimensional interpolation. However, the interpolation may be skipped since the reconstruction of the virtual object on a Cartesian grid provides directly nondistorted images of the real object on slices parallel to the tilted plane of the gantry. The theory is first presented without any specification of the detector geometry, then applied to the curved detector geometry of third-generation CT scanners with the use of Katsevich's formula for example. Results from computer-simulated data of the FORBILD thorax phantom are given in support of the theory.

Algorithms↗

The cone-beam algorithm of Feldkamp, Davis, and Kress preserves oblique line integrals.

The algorithm of Feldkamp, Davis, and Kress [J. Opt. Soc. Am. A 1, 612-619 (1984)] is a widely used filtered-backprojection algorithm for three-dimensional image reconstruction from cone-beam (CB) projections measured with a circular orbit of the x-ray source. A well-known property of this approximate algorithm is that the integral of the reconstructed image along any axial line orthogonal to the plane of the orbit is exact when the cone-beam projections are not truncated. We generalize this result to oblique line integrals, thus providing an efficient method to compute synthetic radiographs from cone-beam projections. Our generalized result is obtained by showing that the FDK algorithm is invariant under transformations that map oblique lines onto axial lines.

Algorithms↗

Exact helical reconstruction using native cone-beam geometries.

This paper is about helical cone-beam reconstruction using the exact filtered backprojection formula recently suggested by Katsevich (2002a Phys. Med. Biol. 47 2583-97). We investigate how to efficiently and accurately implement Katsevich's formula for direct reconstruction from helical cone-beam data measured in two native geometries. The first geometry is the curved detector geometry of third-generation multi-slice CT scanners, and the second geometry is the flat detector geometry of C-arms systems and of most industrial cone-beam CT scanners. For each of these two geometries, we determine processing steps to be applied to the measured data such that the final outcome is an implementation of the Katsevich formula. These steps are first described using continuous-form equations, disregarding the finite detector resolution and the source position sampling. Next, techniques are presented for implementation of these steps with finite data sampling. The performance of these techniques is illustrated for the curved detector geometry of third-generation CT scanners, with 32, 64 and 128 detector rows. In each case, resolution and noise measurements are given along with reconstructions of the FORBILD thorax phantom.

Algorithms↗

Inversion of the 3D exponential x-ray transform for a half equatorial band and other semi-circular geometries.

This work presents new mathematical results on the inversion of the exponential x-ray transform. It is shown that a reconstruction formula can be obtained for any dataset whose projection directions consist of a union of half great circles on the unit sphere. A basic example of such a dataset is the semi-equatorial band. The discussion in the paper is mostly focused on this example. The reconstruction formula takes the form of a Neumann (geometric) series and is both exact and stable. The exponential x-ray transform has been mainly studied in SPECT imaging. In this context, our results demonstrate mathematically that fully 3D image reconstruction in SPECT with non-zero attenuation does not always require symmetric datasets (opposing views).

Algorithms↗

Image reconstruction from fan-beam projections on less than a short scan.

This work is concerned with 2D image reconstruction from fan-beam projections. It is shown that exact and stable reconstruction of a given region-of-interest in the object does not require all lines passing through the object to be measured. Complete (non-truncated) fan-beam projections provide sufficient information for reconstruction when 'every line passing through the region-of-interest intersects the vertex path in a non-tangential way'. The practical implications of this condition are discussed and a new filtered-backprojection algorithm is derived for reconstruction. Experiments with computer-simulated data are performed to support the mathematical results.

Algorithms↗