A hardware architecture using finite-field arithmetic for computing maximum-likelihood estimates in emission tomography.

A special-purpose hardware architecture is proposed to implement the expectation-maximization algorithm to compute, in clinically useful times, the maximum-likelihood estimate of a radionuclide distribution for a positron-emission tomogram from time-of-flight measurements. Two-dimensional convolutions required for forming the estimate are converted into a series of one-dimensional convolutions that can be evaluated in parallel. Each one-dimensional convolution is evaluated using a number-theoretic transform. All numerical calculations are performed using finite-field arithmetic. To avoid the use of large finite fields and to increase parallelism, each convolution is performed by a series of convolutions with small digits in a Galois field. The hardware architecture allows a two-dimensional convolution of dimension NxN to be formed with O(N) operations, permitting one iteration of the expectation-maximization algorithm to be formed in approximately 100 ms when N=128 and the number of view angles is 32.

[1]  L. J. Thomas,et al.  Noise and Edge Artifacts in Maximum-Likelihood Reconstructions for Emission Tomography , 1987, IEEE Transactions on Medical Imaging.

[2]  Hideo Kosako,et al.  General Division in the Symmetric Residue Number System , 1973, IEEE Transactions on Computers.

[3]  Thompson Fourier Transforms in VLSI , 1983, IEEE Transactions on Computers.

[4]  Donald L. Snyder,et al.  Image Reconstruction from List-Mode Data in an Emission Tomography System Having Time-of-Flight Measurements , 1983, IEEE Transactions on Nuclear Science.

[5]  Harper J. Whitehouse,et al.  Parallel Processing Algorithms And Architectures For Real-Time Signal Processing , 1982, Optics & Photonics.

[6]  Linda Kaufman,et al.  Implementing and Accelerating the EM Algorithm for Positron Emission Tomography , 1987, IEEE Transactions on Medical Imaging.

[7]  I. S. Reed,et al.  Integer Convolutions over the Finite Field $GF( {3 \cdot 2^n + 1} )$ , 1977 .

[8]  D. Snyder,et al.  The use of constraints to eliminate artifacts in maximum-likelihood image estimation for emission tomography , 1988 .

[9]  Trieu-Kien Truong,et al.  On the application of a fast polynomial transform and the Chinese remainder theorem to compute a two-dimensional convolution , 1981 .

[10]  I. S. Reed,et al.  X-Ray Reconstruction by Finite Field Transforms , 1977, IEEE Transactions on Nuclear Science.

[11]  B. Arambepola,et al.  Discrete transforms over polynomial rings with applications in computing multidimensional convolutions , 1980 .

[12]  Ernest L. Hall,et al.  Image Processing by Transforms Over a Finite Field , 1977, IEEE Transactions on Computers.

[13]  G. Robert Redinbo,et al.  Finite Field Arithmetic on an Array Processor , 1979, IEEE Transactions on Computers.

[14]  L. Shepp,et al.  Maximum Likelihood Reconstruction for Emission Tomography , 1983, IEEE Transactions on Medical Imaging.