Abstract:
An image reconstruction method for a computer tomograph produces arbitrary eccentric segments of images. The method is a modified linogram reconstruction, more precisely a combination of linogram and gridding methods, by means of which it is possible to reconstruct arbitrary eccentric segments directly, by producing points directly on a Cartesian grip, without the necessity of transformations or interpolations.

Description:
BACKGROUND OF THE INVENTION 
     1. Field of the Invention 
     The present invention is directed to a method for generating a displayable image from data obtained by irradiation of an examination subject in a computed tomography apparatus, and in particular to a method for image reconstruction suitable for use in such a computed tomography apparatus. 
     2. Description of the Prior Art 
     In computed tomography, CT images can be reconstructed by the linogram method. The linogram method was introduced by P. Edholm in 1987, see P. R. Edholm, G. T. Herman, &#34;Linograms in Image Reconstruction from Projections,&#34;IEEE Trans. on Med. Imag., vol. MI-6, No. 4, 1987, pp. 301-307. It is a special Fourier reconstruction method that functions entirely without interpolation in the frequency space. A disadvantage of the usual Fourier reconstruction method is that after the one-dimensional fast Fourier transformation of the measured projections f lk , discrete spectrum values are defined on a polar grid. The transition to the Cartesian grid in the frequency space takes place by means of a two-dimensional interpolation, which leads to flawed images if insufficient care is taken. The essential idea of the linogram method is to organize discrete spectrum values on a &#34;quasi-Cartesian&#34; grid from the outset through suitable measures, so that interpolation in the frequency space is no longer necessary. 
     In the known linogram method, a spectrum is always generated that corresponds to the image in the overall measurement field with the diameter D M . As in the direct Fourier transformation methods, this results in that a very large number of points must be reckoned with in the frequency space with matrices. In the original linogram method, spectral values with a fixed grid ##EQU1## result in the ρ x  direction in the angle region [-45°, 45°] in the frequency space, while spectral values with a fixed grid ##EQU2## result in the ρ y  direction in the angle region [45°, 135°] (ρ x  and ρ y  are the Cartesian frequency variables). If there are N p  =2048 projections in the angle region [-45°, 135°] with N=1024 measurement values per projection in the sampling grid ##EQU3## this means that the two sub-matrices for [-45°, 45°] or [45°, 135°] in the frequency space each have ##EQU4## 
     If the method is to be of practical importance, it must be possible to reconstruct arbitrary eccentric image segments. For this purpose, in the known linogram method chirp-z transformations are undertaken on the desired image segment D B  ·D B  with N Pix  ·N pix  image elements in the grid ##EQU5## on the basis of the two sub-matrices, in both the ρ x  and the ρ y  directions. This step is so expensive in terms of processing outlay that it far outweighs the advantage of the lack of interpolation in the frequency space. 
     SUMMARY OF THE INVENTION 
     An object of the present invention is to provide a Fourier reconstruction method for image reconstruction for computed tomograph with which arbitrary eccentric image segments can be directly reconstructed. 
     This object is inventively solved in accordance with the principles of the present invention in a method which is a modified linogram reconstruction method, with which the problem of the representation of an eccentric segment of a CT image is solved with a greatly reduced expense. It is a combination of linogram and gridding methods (on gridding methods, see J. D. O&#39;Sullivan, &#34;A Fast Sinc Function Gridding Algorithm for Fourier Inversion in Computer Tomography,&#34;IEEE Trans. on Med. Image., vol. MI-4, no. 4, 1985, pp. 200-207), with which it is possible to reconstruct arbitrary eccentric image segments directly. The matrix that thereby results in the frequency space has, instead of ##EQU6## or ##EQU7## as in the original linogram method, the frequency grid ##EQU8## (D B  is the side length of the desired image segment). In addition, the points lie on a Cartesian grid, not on the &#34;quasi-Cartesian&#34; grid of the linogram method. If the image consists of N Pix  ·N Pix  =512·512 image elements, then the Cartesian frequency matrix has 2N Pix  ·2N Pix  =1024·1024 points, independent of the choice of D B . In contrast to the original, known gridding method, in the inventive method the gridding itself is only one-dimensional. The back-transformation of the spectrum into the spatial domain can be carried out with fast Fourier transformations; chirp-z transformations, as in the original linogram method, are not necessary. 
     DESCRIPTION OF THE DRAWINGS 
     FIG. 1 is a schematic illustration of a computed tomography apparatus wherein data are obtained, and an image reconstruction is undertaken, in accordance with the principles of the present invention. 
    
    
     DESCRIPTION OF THE PREFERRED EMBODIMENTS 
     The computed tomography apparatus shown in the drawing has a measurement unit consisting of an X-ray source 1, which emits a fan-shaped X-ray beam 2, and a radiation receiver 3, consisting of a row of individual detectors, e.g. 1024 individual detectors. The focus is designated 11. The patient 4 to be examined lies on a patient bed 5. For the scanning the patient 4, the measurement unit formed by the source 1 and the receiver mounted on a ring 14 3 is rotated through 360° around a measurement field 9 in which the patient 4 lies by a rotation drive 15. The axis of rotation is designated 10. The X-ray source 1, fed by a high voltage 6, is operated in a pulsed manner or with continuous radiation. At predetermined rotational angle positions of the measurement unit, sets of data are produced that are supplied from the receiver 3 to a computer 7, which calculates the attenuation coefficients of predetermined image points from the registered data sets and graphically reproduces the coefficients on a viewing apparatus 8. An image of the transilluminated layer of the patient accordingly appears on the viewing apparatus 8. 
     The starting point for the reconstruction is a parallel data set with N P  projections in the angle area [-45°, 135°] and N channels per projection in the scanning grid a. If a CT scanner measures data in fan geometry, the parallel data are obtained by rebinning. If f LK  is the measurement value at the projection l in the channel k, then: 
     
         θ.sub.l =-45°+lΔθ.sub.l l=0, 1, 2, . . . , N.sub.P -1                                                        (1) 
    
     
         p.sub.k =(k-0.5+a.sub.m)a k=. . . , -1, 0, 1, . . .        (2) 
    
     wherein a m  is the alignment factor. 
     Furthermore, Δ tan θ or Δ cot θ is constant: ##EQU9## The only image that can be calculated from these measurement values without additional assumptions is defined as follows: ##EQU10## wherein M A  (ρ) is the modulation transfer function of the reconstruction. 
     Furthermore, one can set ##EQU11## L C  and L S  do not form the basis for restrictions as in a convolution back-projection reconstruction, where L C  is the CT convolution kernel and L S  is the interpolation function necessary in the back projection; however, L S  is a smoothing function with little extension in the spatial domain. 
     The basic idea of the inventive method is to carry out the necessary convolution of the measurement values f lk  with the CT convolution Kernel in the frequency space as a multiplication, and then to center the image in the desired reconstruction center -r z   as the new origin by means of multiplication by a phase factor. After the one-dimensional back-transformation of the measurement values into the spatial domain, the subsequently convoluted, centered projections can be limited to the desired image field D B . This is followed by one-dimensional chirp-z transformations to the desired frequency grid ##EQU12## for the angle area [-45°, 45°], or ##EQU13## for the angle area [45°, 135°]. This is theoretically grounded below. 
     If the reconstruction center is chosen at -r z , one first forms B 0  (r-r z ) as: ##EQU14## Consider the convoluted, &#34;centered&#34; projections ##EQU15## The function f c  (p q , θ l ) can be periodically repeated without degrading the image in an area with diameter D M  (now however centered around -r z ), if for the period length w, w≧2D M  =2Na holds, and if L c  (p) for |p| &gt;D M  is set to 0, i.e. ##EQU16## If the image is to be reconstructed in a square centered around -r z  with side length D B  ·D B , with D B  ≦D M , then the function f&#39; c  (p q , θ l ) can be limited to this square through multiplication by a rectangular window R l  (p q ), since values outside it do not contribute to the image. A rectangular window R l  (p q ), with extension v l  dependent on the angle of projection θ l , is chosen. This is possible as long as the following holds: ##EQU17## In particular, one can set 
     
         v.sub.l =2D.sub.B cos θ.sub.l -45°≦θ.sub.l ≦45° 
    
     
         v.sub.l =2D.sub.B sin θ.sub.l -45°≦θ.sub.l ≦135°                                       (13) 
    
     The function f&#39; c  (p q , θ l ), limited to v l  with the rectangular window R l  (p q ) and convoluted with L S , can be periodically repeated with period length v l  without influencing the image in the square D B  ·D B . This results in ##EQU18## The Fourier-transform B LG  (ρ x , ρ y ) of B LG  (r-r z ) is as follows: ##EQU19## 
     As in the linogram method, B LG  (r-r z ) is decomposed into a partial image B LG ,1 (r-r z ) with -45°≦θ l  ≦45° and into a partial image B LG ,w (r-r z ) with 45°&lt;θ l  135° . All following considerations relate to B LG ,1 (r-r z ); for B LG ,2 (r-r z ) the results are similar. 
     With r z  ·n l  =x z  cos θ l  +y z  sin θ l  and ##EQU20## the following holds: ##EQU21## Likewise, with r·n l  =x cos θ l+y  sin θ l  and ##EQU22## one can write: ##EQU23## It thus follows for B LG ,1 (ρ x ,ρ y ): ##EQU24## is the one-dimensional Fourier transform of the f lk  to the grid ##EQU25## In the frequency space, ##EQU26## is multiplied by the Fourier transform of the convolution Kernel, ##EQU27## and the phase factor ##EQU28## which controls the position of the reconstruction center. There then follows an FFT back into the spatial domain; this results in the convoluted projections f&#39; c  (p q , θ l ), centered around -r z  : ##EQU29## In the spatial domain, the f&#39; c  (p q , θ l ) are limited to the desired image field region v l  =2D B  cos θ l , i.e. to ##EQU30## values, through multiplication by R l  (p q ), and are newly transformed in the frequency space to the grid ##EQU31## with a chirp-z transformation ##EQU32## The spectrum B LG ,1 (ρ x , ρ y ) is defined in the ρ x  direction at discrete grid points sΔρ x   LG , with ##EQU33## B LG ,1 ( x ,ρ y ) belongs to an image limited in the x direction with an ideal rectangular window width 2D B . The grid values sΔρ x   LG  can thus be used directly as starting points for the FFT in the x direction back into the spatial domain, without requiring an additional interpolation in the frequency space. As in the gridding method, a region of side length D R  =2D B  is thereby reconstructed. If the image D B  ·D B , having 512·512 pixels is thereby represented, 1024 frequency values are necessary in the ρ x  direction. If more frequency support points are present in the ρ x  direction after the chirp-z transformation of the projections, because the maximum frequency contained in the convoluted projections is larger than the frequency that can be represented with the image matrix, the additional frequency points must be rearranged as aliasing components after the gridding in the ρ y  direction (see below). 
     In the ρ y  direction, the grid values are likewise equidistant; the grid depending on sΔρ x   LG  is ##EQU34## As in the original linogram method, for each s, a chirp-z transformation to the desired pixel grid Δy can now follow in the ρ y  direction. 
     In order to avoid the costly chirp-z transformation with the grid Δρ y   LG  (s), which depends on sΔρ x   LG , it is desirable to carry out a one-dimensional interpolation in each column s of the frequency matrix in such a way that a frequency grid Δρ y  that is equal for all s results, i.e. a Cartesian matrix. In order for no image deterioration is to appear through this interpolation, it must be implemented as a one-dimensional &#34;gridding.&#34; The basic idea for the choice of the interpolation function T(ρ y ) is to limit the image B LG ,1 (x,y) to the desired width D R  conceptually through multiplication by a window function T(y) in the y direction, so that no coverage errors occur during the periodic repetition of the image in the spatial domain caused by the spectrum sampling in the Cartesian coordinates. The limiting is not carried out in the spatial domain, but rather in the frequency space, as one-dimensional convolution in the ρ y  direction of the image spectrum defined at discrete points ##EQU35## with the Fourier-transform T(ρ y ) of T(y). The address calculations may thereby be simplified due to the equidistant starting points sΔρ y   LG  (s). The resulting spectrum, continuous in the ρ y  direction, is then sampled at the grid points jΔρ y , with Δρ y  =1/D R . In order to obtain the smallest possible extension of T(ρ) in the frequency space, and thereby as short a convolution as possible, the side length of the reconstruction field D R  is chosen twice as large as the side length of the desired image field D B . T(y) can then fall gently to a sufficiently small value in the area D B  /2≦|y|≦D R  -D B  /2. 
     In the ρ x  direction, no gridding is necessary, since here the Cartesian grid is already present. The image resulting from this spectrum through Cartesian sampling and two-dimensional Fourier back-transformation is identical with the convolution back-projection image in the desired image area up to aliasing errors in the spatial domain, which are caused by the finite extension of T in the frequency space. Through suitable choice of T, these aliasing errors can be made negligibly small. 
     Through the convolution with T(ρ y ) in the frequency space, the image is multiplied by T(y) in the spatial domain, and thus has a &#34;bump&#34;. This bump can easily be corrected by dividing the reconstructed image B LG ,1 (x,y) in the region |y|≦D B  /2 by T(y). After the gridding and a possible rearrangement of the aliasing components, there are 1024 Cartesian values both in the ρ x  direction and the ρ y  direction, so that one obtains the partial image B LG ,1 (r-r z ) through two-dimensional back-transformation of 1024·1024 frequency points. The inner 512 ·512 pixels are the image that must be corrected in the y direction through multiplication by ##EQU36## In the same way, but with x and y exchanged, the partial image B LG ,2 (r-r z ) is obtained from ##EQU37## Since this partial image must be corrected after the gridding and the back-transformation in the x direction, the spectra of B LG ,1 (r-r z ) and B LG ,2 (r-r z ) cannot simply be added and back-transformed together. Rather, each spectrum must be separately transformed into the spatial domain. The final image results from the sum of the two corrected partial images. 
     A summary of the invention processing step is as follows: 
     In the following, the necessary processing steps are shown for a third-generation CT apparatus with 1024 measurement values per projection and ˜1200 fan projections in the region [0,2π] (e.g. Siemens SOMATOM AR/HP). 
     1.) Rebinning to parallel data f lk  : 
     N=1024 channels per projection, N p  ≈600 projections with Δtan θ=const in the angle area [-45°, 45°] or Δcot θ=const in the angle area [-45°, 135°]. 
     2.) Zero padding of the f lk  and one-dimensional FFT of the f lk  with 2048 values. Through the zero padding, the grid ##EQU38## results in the frequency space. 
     3.) Multiplication of the f l  (mΔρ) with the Fourier transform of the convolution Kernel L c  (mΔρ) and with the phase factor exp (-2πimΔρ(x z  cos θ+y z  sin θ l )). 
     4.) FFT of length 2048 back into the spatial domain; limitation of each convoluted, centered projection f&#39; c  (p q , θ l ) to ##EQU39## values for -45°≦θ l  ≦45°, or to ##EQU40## values for 45°&lt;θ l  ≦135°. 
     5.) One -dimensional chirp-z transformation of the bounded function f&#39; c  (p q ,θ l ) to a maximum of 1024 frequency points in the grid ##EQU41## The number of points depends on the size of the represented image segment and on the maximum frequency of the reconstruction. 
     6.) Multiplication of the F l  (sΔρ F   l ) by the Fourier transform of the &#34;smoothing Kernel&#34; L s  (sΔρ F   l ). 
     7.) Calculation of two sub-images for the angle areas [-45°, 45°] and [45°, 135°]: Sub-image 1: for each frequency value sΔρ x  in the ρ x  direction, a gridding is carried out in the ρ y  direction, on the basis of N P  frequency support points in the s-dependent grid Δρ y   LG  (s), to 1024 values in the grid ##EQU42## Since the matrix is complexly conjugate, only the positive s must be taken into account; at most there are thus ˜1024·600 starting points. After the rearrangement of the aliasing components, a Fourier transformation of the 1024·1024 frequency values into the spatial domain follows; the inner 512·512 pixels are the image. Sub-image 2: proceed as for sub-image 1, with x and y exchanged. 
     8.) Correction and addition of the two sub-images. 
     Although modifications and changes may be suggested by those skilled in the art, it is the intention of the inventors to embody within the patent arranged hereon all changes and modifications as reasonably and properly come with the scope of their contribution to the art.