Michel Defrise

Symmetric phase-only matched filtering of Fourier-Mellin transforms for image registration and recognition

Presents a new method to match a 2D image to a translated, rotated and scaled reference image. The approach consists of two steps: the calculation of a Fourier-Mellin invariant (FMI) descriptor for each image to be matched, and the matching of the FMI descriptors. The FMI descriptor is translation invariant, and represents rotation and scaling as translations in parameter space. The matching of the FMI descriptors is achieved using symmetric phase-only matched filtering (SPOMF). The performance of the FMI-SPOMF algorithm is the same or similar to that of phase-only matched filtering when dealing with image translations. The significant advantage of the new technique is its capability to match rotated and scaled images accurately and efficiently. The innovation is the application of SPOMF to the FMI descriptors, which guarantees high discriminating power and excellent robustness in the presence of noise. This paper describes the principle of the new method and its discrete implementation for either image detection problems or image registration problems. Practical results are presented for various applications in medical imaging, remote sensing, fingerprint recognition and multiobject identification. >

Iterative reconstruction for helical CT: a simulation study

Iterative reconstruction algorithms for helical CT are presented. The algorithms are derived from two-dimensional reconstruction algorithms, by adapting the projector/backprojector to the helical orbit of the source, and by constraining the axial frequencies with a Gaussian sieve. Simulations have been carried out and the performance of the iterative algorithms is compared to that of filtered backprojection of synthetic (interpolated) two-dimensional sinograms. The iterative algorithms produce superior bias-noise curves. Axial resolution is superior, but disturbing edge-artefacts are introduced.

A cone-beam reconstruction algorithm using shift-variant filtering and cone-beam backprojection

An exact inversion formula written in the form of shift-variant filtered-backprojection (FBP) is given for reconstruction from cone-beam data taken from any orbit satisfying H.K. Tuys (1983) sufficiency conditions. The method is based on a result of P. Grangeat (1987), involving the derivative of the three-dimensional (3D) Radon transform, but unlike Grangeats algorithm, no 3D rebinning step is required. Data redundancy, which occurs when several cone-beam projections supply the same values in the Radon domain, is handled using an elegant weighting function and without discarding data. The algorithm is expressed in a convenient cone-beam detector reference frame, and a specific example for the case of a dual orthogonal circular orbit is presented. When the method is applied to a single circular orbit (even though Tuys condition is not satisfied), it is shown to be equivalent to the well-known algorithm of L.A. Feldkamp et al. (1984).

Fully three-dimensional reconstruction for a PET camera with retractable septa

A fully 3-D reconstruction algorithm has been developed to reconstruct data from a 16 ring PET camera (a Siemens/CTI 953B) with automatically retractable septa. The tomograph is able to acquire coincidences between any pair of detector rings and septa retraction increases the total system count rate by a factor of 7.8 (including scatter) and 4.7 (scatter subtracted) for a uniform, 20 cm diameter cylinder. The reconstruction algorithm is based on 3-D filtered backprojection, expressed in a form suitable for the multi-angle sinogram data. Sinograms which are not measured due to the truncated cylindrical geometry of the tomograph, but which are required for a spatially invariant response function, are obtained by forward projection. After filtering, the complete set of sinograms is backprojected into a 3-D volume of 128*128*31 voxels using a voxel-driven procedure. The algorithm has been validated with simulation, and tested with both phantom and clinical data from the 953B. >

Truncated Hilbert transform and image reconstruction from limited tomographic data

A data sufficiency condition for 2D or 3D region-of-interest (ROI) reconstruction from a limited family of line integrals has recently been introduced using the relation between the backprojection of a derivative of the data and the Hilbert transform of the image along certain segments of lines covering the ROI. This paper generalizes this sufficiency condition by showing that unique and stable reconstruction can be achieved from an even more restricted family of data sets, or, conversely, that even larger ROIs can be reconstructed from a given data set. The condition is derived by analysing the inversion of the truncated Hilbert transform, here defined as the problem of recovering a function of one real variable from the knowledge of its Hilbert transform along a segment which only partially covers the support of the function but has at least one end point outside that support. A proof of uniqueness and a stability estimate are given for this problem. Numerical simulations of a 2D thorax phantom are presented to illustrate the new data sufficiency condition and the good stability of the ROI reconstruction in the presence of noise.

Tiny a priori knowledge solves the interior problem in computed tomography

Based on the differentiated backprojection (DBP) framework [1-3], this paper shows that the solution to the interior problem in computed tomography is unique if a tiny a priori knowledge on the object f(x,y) is available in the form that f(x,y) is known on a small region located inside the region of interest. Furthermore, we advance the uniqueness result to obtain a more general uniqueness result which can be applied to a wider class of imaging configurations. The experimental results show evidence that the inversion corresponding to each obtained uniqueness result is stable.

A solution to the long-object problem in helical cone-beam tomography

This paper presents a new algorithm for the long-object problem in helical cone-beam (CB) computerized tomography (CT). This problem consists in reconstructing a region-of-interest (ROI) bounded by two given transaxial slices, using axially truncated CB projections corresponding to a helix segment long enough to cover the ROI, but not long enough to cover the whole axial extent of the object. The new algorithm is based on a previously published method, referred to as CB-FBP (Kudo et al 1998 Phys. Med. Biol. 43 2885-909), which is suitable for quasi-exact reconstruction when the helix extends well beyond the support of the object. We first show that the CB-FBP algorithm simplifies dramatically, and furthermore constitutes a solution to the long-object problem, when the object under study has line integrals which vanish along all PI-lines. (A PI line is a line which connects two points of the helix separated by less than one pitch.) Exploiting a geometric property of the helix, we then show how the image can be expressed as the sum of two images, where the first image can be reconstructed from the measured CB projections by a simple backprojection procedure, and the second image has zero PI-line integrals and hence can be reconstructed using the simplified CB-FBP algorithm. The resulting method is a quasi-exact solution to the long-object problem, called the ZB method. We present its implementation and illustrate its performance using simulated CB data of the 3D Shepp phantom and of a more challenging head-like phantom.

Fast reconstruction of 3-D PET data with accurate statistical modeling

This paper presents the results of combining high sensitivity 3D PET whole-body acquisition followed by fast 2D iterative reconstruction methods based on accurate statistical models. This combination is made possible by Fourier rebinning (FORE), which accurately converts a 3D data set to a set of 2D sinograms. The combination of volume imaging with statistical reconstruction allows improvement of noise-bias trade-offs when image quality is dominated by measurement statistics. The rebinning of the acquired data into a 2D data set reduces the computation time of the reconstruction. For both penalized weighted least squares (PWLS) and ordered-subset EM (OSEM) reconstruction methods, the usefulness of a realistic model of the expected measurement statistics is shown when the data are pre-corrected for attenuation and random and scattered coincidences, as required for the FORE rebinning algorithm. The results presented are based on 3D simulations of whole body scans that include the major statistical effects of PET acquisition and data correction procedures. As the PWLS method requires knowledge of the variance of the projection data, a simple model for the effect of FORE rebinning on data variance is developed.

Time-of-flight PET data determine the attenuation sinogram up to a constant

In positron emission tomography (PET), a quantitative reconstruction of the tracer distribution requires accurate attenuation correction. We consider situations where a direct measurement of the attenuation coefficient of the tissues is not available or is unreliable, and where one attempts to estimate the attenuation sinogram directly from the emission data by exploiting the consistency conditions that must be satisfied by the non-attenuated data. We show that in time-of-flight PET, the attenuation sinogram is determined by the emission data except for a constant and that its gradient can be estimated efficiently using a simple analytic algorithm. The stability of the method is illustrated numerically by means of a 2D simulation.

Cone-beam filtered-backprojection algorithm for truncated helical data

This paper investigates 3D image reconstruction from truncated cone-beam (CB) projections acquired with a helical vertex path. First, we show that a rigorous derivation of Grangeats formula for truncated projections leads to a small additional term compared with previously published similar formulations. This correction term is called the boundary term. Next, this result is used to develop a CB filtered-backprojection (FBP) algorithm for truncated helical projections. This new algorithm only requires the CB projections to be measured within the region that is bounded, in the detector, by the projections of the upper and lower turns of the helix. Finally, simulations with mathematical phantoms demonstrate that: (i) the boundary term is necessary to obtain high-quality imaging of low-contrast structures and (ii) good image quality is obtained even with large values of the pitch of the helix.