Abstract:
A system is provided for reconstructing x-ray tomographic images based upon the circle-and-line orbit. The system includes the steps of combining, in the frequency domain, images reconstructed separately from the circular and linear orbit data. Specifically, the method involves the steps of (1) converting the shadow zone into a shadow cone in frequency domain, (2) mapping the shadow cone in 3D Fourier space onto a set of 2D Fourier planes, (3) removing data lying within the region marked as the projection of the shadow cone from the Fourier transform of the circular orbit data and patching the same from the Fourier transform of the line orbit data, (4) transforming each 2D Fourier plane into a respective 2D image plane, and (5) converting the horn-shaped volume back to a grid volume. An interpolation technique is also provided for reconstructing the line orbit data using a Direct Fourier method (DFM).

Description:
BACKGROUND OF THE INVENTION 
     The field of the invention relates to computer tomography and more particularly to x-ray medical computer tomography. 
     Computer tomography (CT) using cone-beam projection technology typically employs an x-ray source to form a vertex in the shape of a cone. A scanning orbit of the x-ray source is a curve along which the vertex of the cone beam moves during a scan. A set of detectors are disposed at a fixed distance from the cone-beam source. Methods currently exist which have established a relationship between cone-beam projections and a first derivative of the three dimensional (3D) Radon transforms of such projections. Theoretically, each source position &#34;S&#34; can deliver Radon data positioned on a sphere, the Radon shell of &#34;S.&#34; The corresponding spheres on a circular orbit sweep out the Radon space of the object, referred to as a torus. Regions inside the smallest sphere containing the object, but exterior to the torus, is called the shadow zone. The shadow zone characterize the region where Radon data is missing from the circular orbit. 
     When using a circle-and-line orbit, the line-orbit data is typically used for filling in the shadow zone. Even though the shadow zone is very small, as compared to the volume of the entire valid Radon data delivered by the circular orbit, current cone-beam projection techniques are computationally intensive. Accordingly, a need exists for simplifying image reconstruction based on the circle-and-line orbit. 
     BRIEF SUMMARY OF THE INVENTION 
     A system is provided for reconstructing x-ray tomographic images based upon the circle-and-line orbit. The system includes the steps of combining, in the frequency domain, images reconstructed separately from the circular and linear orbit data. Specifically, the method involves the steps of (1) converting the shadow zone into a shadow cone in the frequency domain, (2) mapping the shadow cone in 3D Fourier space onto a set of 2D Fourier planes, (3) removing data lying within the region marked as the projection of the shadow cone from the Fourier transform of the circular orbit data and patching the same from the Fourier transform of the line orbit data, (4) transforming each 2D Fourier plane into a respective 2D image plane, and (5) converting the horn-shaped volume back to a grid volume. An interpolation technique is also provided for reconstructing the line orbit data using a Direct Fourier Method (DFM). 
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS 
     FIG. 1 depicts an x-ray tomography imaging system of the present invention; 
     FIG. 2 depicts a cross-section of the circular orbit formed by the system of FIG. 1; 
     FIG. 3 depicts a shadow zone of FIG. 2 and corresponding shadow cone; 
     FIGS. 4a and 4b illustrate a cross-section of the shadow cone of FIG. 2 projected onto a plane; 
     FIG. 5 depicts incremental processing steps performed in the z-direction by the system of FIG. 1; 
     FIG. 6 depicts a set of parallel projection data at the θ max  angle (obtained from the M th  row of the detector array as depicted in FIG. 5); 
     FIG. 7 depicts a set of parallel projection data at the θ min  angle (obtained from the first row of the detector array as depicted in FIG. 5); and 
     FIG. 8 depicts inverse bilinear interpolation of the system of FIG. 1. 
    
    
     DETAILED DESCRIPTION OF THE INVENTION 
     FIG. I depicts a CT imaging system 10, generally, in accordance with an illustrated embodiment of the invention. Included within the system 10 is a central processing unit (CPU) 16, a sampling device 12, and other image support and processing subsystems 14, 18, 20, 22. The sampling device 12 includes an x-ray source 34 and an image detecting array 32 along with actuating devices. The image support devices 14, 18, 22 include a Fast Fourier processor 14, an interpolator 18, a memory 20, and a display 22. 
     In two dimensional (2D) tomographic reconstruction one alternative to Filtered Back Projection (FBP) is Direct Fourier Method (DFM) back projection. Direct Fourier Method back projection is based on the projection slice theorem, which postulates that a one dimensional (1D) Fourier Transform (FT) of a projection at a specific angle corresponds to the cross section of the 2D FT of the object at the same angle. DFM shall be used as an alternative to the conventional back-projection reconstruction involving the line orbit. 
     In a CT system 10, (FIG. 1) using circular orbit data and alternatively the circle and line orbit data which is to be reconstructed, represented in the function defined by f(r), can be expressed by the following equation: 
     
         f(r)=f.sub.c0 (r)+f.sub.c1 (r)+f.sub.l (r). 
    
     The first two elements, f c0  (r) and f c1  (r), are evaluated using circularly-scanned data and techniques (e.g., as given by Feldkamp et al. and Hu). For example, Feldkamp et al. has published cone-beam algorithms in a paper entitled, PRACTICAL CONE-BEAM ALGORITHM, published in the Journal of the Optical Society of America, Vol. 1, No. 6, June 1984, pages 612-619, herein incorporated by reference. The second element is needed only when the third term is evaluated in the Radon space. Since we will evaluate the third term in the Fourier space, thus the second term will be ignored. 
     The third element, f 1  (r), is evaluated from the linear orbit data. It is typically used for filling in a shadow zone 28 defined by a torus 24, which is swept out by the circular orbit about the axis of rotation, and the smallest sphere containing the object 40 (FIG. 2). Even though this shadow zone 28, which is defined in Radon space, is small as compared to the torus 24, the current back-projection process is computationally intensive, as is apparent from the complexity of f 1  (r) as defined, for example in a paper by Hui Hu, entitled, CONE BEAM RECONSTRUCTION ALGORITHM FOR THE CIRCULAR ORBIT AND A CIRCLE-AND-LINE ORBIT, published by the Applied Science Laboratory, GE Medical Systems, Jan. 31, 1997, herein incorporated by reference, in equation 1 listed below. ##EQU1## where ##EQU2## and where H(z o ,Θ,l) is the weighted second derivative of Radon data computed from a snapshot incurred at z=z o . For each point in the object space, r, the point is associated with a point (Y o ,Z o ) on the detector plane. If a circle is drawn on the detector plane using the origin (0, 0) and (Y o ,Z o ) as two ends of a diameter, then all the valid Radon data, H(z o , Θ, l), intercepted by the circle satisfy the constraint: l=Y o  sin Θ+Z 0  cos θ. For each point (Y o ,Z o ), there is a corresponding set of Radon data, H(z o ,Θ,l), to be summed and then back-projected onto the object space. The computational complexity of this process is thus close to O(N 5 ). 
     The present invention describes a method for determining a computational efficient CT reconstruction using data obtained from a line orbit scan of the object 40 (illustrated in FIG. 2). First, the shadow zone 28 in Radon space is augmented and converted into a shadow cone 30 in frequency space (FIG. 3). Secondly, the patching process performed by CPU 16 is simplified from the original three-dimensional frequency space into multiple 2D frequency slices. 
     The first step is based on the fact that the Fourier transform of a radial line in 3D Radon space is equivalent to the same radial line in 3D Fourier space. If a radial line in 3D Radon space intercepts the shadow zone 28, then its counterpart in the 3D Fourier space is &#34;contaminated&#34; because some Radon data in the radial Radon line has been missing. Since all the radial lines intercepting the shadow zone 28 form a shadow cone 30, the collection of their counterparts in the 3D Fourier space also form a frequency-insufficient cone. The frequency-insufficient cone (or the contaminated cone) of the first term of equation (1), which is defined in Fourier space, will be replaced by that of the third term of equation (1). 
     The second step is to show that the linear orbit supports enough frequency data to replace the contaminated cone (which is due to the circular orbit), followed by a procedure for replacing the contaminated cone in 2D Fourier space. 
     FIG. 5 shows that the linear scanning orbit may be implemented by holding an x-ray source 34 and a detector panel 32 stationary, while moving object 40 along the z-axis 36 (which is also the rotational axis of the circular orbit). The object 40 is shown to move in the &#34;z direction&#34; in discrete increments identified at &#34;z --  step&#34; 36 increments. Each vertical column of detectors 32 together with the source 34 defines a plane through the object 40. Within each vertical plane, every detector position defines a specific angle and the data collected by that detector corresponds to a parallel projection of the object sampled by intervals of z-step 36. FIG. 6 shows a number of parallel projections of object 40 at angle θ m  =θ max  and FIG. 7 shows parallel projections of object 40 at angle θ m  =θ min . These parallel projections are used to fill in the corresponding missing angular segment in the 2D FT plane. θ max  and θ min  are angles selected so that the data volume for the shadow cone 30 (FIG. 3) used to replace the shadow zone 28 data volume encompasses the shadow zone data volume. This condition is satisfied when θ 0  =θ m , as illustrated in FIG. 2, where ##EQU3## wherein &#34;R&#34; is the radius of the smallest sphere containing object 40 and &#34;d&#34; is the radius of the circular orbit. 
     The shadow cone 30 (FIG. 3) in 3D Fourier space may be projected as a 2D shadow cone onto a set of 2D Fourier planes. The inverse transform of each of these 2D Fourier planes corresponds to an image plane defined by the x-ray source and a column &#34;N&#34; of detectors 32 (FIG. 5). 
     First, let F(u,v) be the Fourier transform of a 2D function f(x,y). The 1D Fourier data on x=x 0  is derived as follows: ##EQU4## 
     Similarly, for the Fourier transform of a 3D function f(x, y, z), the 2D Fourier transform of the object slice at x=x 0  is identified as follows: ##EQU5## 
     For the case when the desired &#34;n&#34; dimensional Fourier space is not orthogonal to the (n+1) th  dimension of the augmented (n+1) th  dimensional Fourier space. For example, if the desired 1D Fourier transform lies on a line defined by the equation x cos θ+y sin θ-p=0, it is appropriate to rotate the original 2D coordinates, (x,y), into new coordinates, (x&#39;,y&#39;), by angle θ. Let F(u&#39;,v&#39;) be the Fourier transform of f(x&#39;,y&#39;). Then F(u&#39;,v&#39;) is also obtained by rotating F(u,v) by the angle θ. The Fourier transform along the line, x cos θ+y sin θ-p=0, is identified as follows: 
     
         F.sub.x&#39;-p (v&#39;)=∫F(u&#39;,v&#39;)e.sup.j2πpu&#39; du&#39;.         (4) 
    
     Similarly, the 2D Fourier transform along the plane defined by x cos φ+y sin φ-ρ=0 is given by 
     
         F.sub.x&#39;-p (v&#39;,w)=∫F(u&#39;,v&#39;,w)e.sup.j2πpu&#39; du&#39;.     (5) 
    
     Again, F(u&#39;,v&#39;,w) is obtained by rotating the (u,v) coordinates by an angle φ, as illustrated in FIG. 4a, while keeping the w-coordinate unchanged. The rotated coordinate system is graphically illustrated in FIGS. 4a and 4b, where the new coordinates, (u&#39;,v&#39;,w), are chosen such that u&#39; is parallel to the normal of the plane of interest (shown as the SO&#39; line). As such, the shadow disc 26 (which is a cross-section of shadow cone 30 (FIG. 4a), intersecting a horizontal plane 27 (FIG. 4b), is projected onto SO&#39; as a line segment centered at &#34;O&#39;&#34; and having end points &#34;f&#34; and &#34;e.&#34; The length of the line segment fe equals the diameter of the shadow cone 30 centered at &#34;O.&#34; 
     In summary, shadow cone 30 (FIG. 4a), defining the area in Radon space in 3D Fourier space, is projected onto 2D Fourier subspace by applying a 1D inverse Fourier transform. In other words, rather than by replacing the shadow cone in 3D Fourier space, the scanned object 40 is represented in a series of 2D Fourier planes, and replaces the projected 2D shadow disc 26 in all the individual planes. 
     In applying the principle described above, the following array and scanner parameters will be assumed. Detector array 32 (FIG. 5) will be referred to by the expression, D(M×N), where the detector array 32 has &#34;M&#34; rows and &#34;N&#34; columns. Projection data of circular orbit will be referred to by the expression P C  (M×N×V C ), where V C  is the total number of views. Projection data of the line orbit will be referred to by the expression P I  (M×N×V I ), where V I  is also the total number of views. An image reconstructed from circular orbit data will have the form, I C  (K×K×K) or I CS  (K×N×K); the former is a cubic volume, while the latter is a &#34;horn-shaped&#34; volume defined by the x-ray source and the detector panel. An image reconstructed from line orbit data will have the form, I l  (K×K×K) or I lS  (K×N×K); likewise, the former is a cubic volume and the latter is a &#34;horn-shaped&#34; volume. 
     The image is reconstructed from the line-orbit data. As a first step, the line-orbit projection data is modified to accommodate the effect of divergence as a plurality of rays passes from source 34 to detector array 32, as graphically illustrated in FIGS. 5, 6, and 7. The divergent ray detected on the detector panel is modified by multiplying the detector values with a weighting function as follows: ##EQU6## where &#34;D&#34; in this case is the source-to-detector distance (FIG. 5), and wherein ISO is projected onto (m 0 ,n 0 ) of the detector panel 32. The values &#34;a&#34; and &#34;b&#34; are the detector pitches in the row and column dimensions, respectively. Detector pitches are standard definitions defining the distance between the centers of two adjacent detectors. 
     The n th  angular vertical plane is reconstructed next. To reconstruct the n th  angular vertical plane, the projection data, P ln  (M×V 1 ), is extracted from the n th  column of the P l  array, where the m th  row corresponds to a fixed beam angle of θ m . 
     The row elements of P m  are shifted such that the object center of this vertical slice is realigned at ##EQU7## Let P&#39; ln  be the realigned projection array. 
     To return to object space, either one of two methods may be taken. As a first option, apply a 1D FFT to each row of P&#39; ln . Place each set of FFT data on a radial line at an angle θ m  for m 1 . . . M. An inverse FFT is utilized to convert the Fourier data set to object space. 
     As a second option the filtered P&#39; ln  for all &#34;N&#34; columns are back-projected to obtain a horn-shape volume comprising &#34;N&#34; vertical planes defined by the x-ray source 34 and &#34;N&#34; detector columns &#34;N.&#34; Let f n  (x,y) be the reconstructed image based on the n th  column, and Q n  the filtered projection array, then ##EQU8## 
     The results of applying the above equation to the shifted row elements are identified as a volumetric array I 1s , having a horn shape. 
     The final image may be reconstructed by one of two possible methods. First, the shadow cone 30 may be replaced in 3D Fourier space. Alternatively, the shadow cone 30 may be replaced in 2D Fourier spaces and then interpolated from the horn shape volume back to cubic volume. 
     The replacement of the shadow cone 30 in 3D space is presented first. As a first step, the Feldkamp algorithm is used to reconstruct the image, I C , associated with torus 24, from the circular orbit data. Next, a 3D Fourier transform, F(I C ), is obtained from I C . 
     The horn shaped volume, I I .sbsb.S, is interpolated to obtain a corresponding cubic volume, I I . A 3D Fourier transform, F(I I ) is obtained from I I . 
     The shadow cone portion of F(I C ) is replaced with its counterpart from F(I I ) to provide a repaired Fourier data array. An inverse Fourier transform is then applied to the repaired Fourier data array to return to cubic space. 
     Replacing the shadow cone in 2D Fourier spaces is presented next. As a first step, the Feldkamp algorithm is again used to reconstruct image I C  from the circular orbit data. Next, I C  is interpolated to I CS , in which I S  defines a plurality of angular vertical planes. I Is  is obtained from the line orbit data, as described above. 
     The Fourier transform F(I CS ) and F(I I .sbsb.S) is obtained from I CS  and I I .sbsb.S. The shadow cone is substituted into each 2D plane of F(I CS ), with its counterpart defined in F(I I .sbsb.S). An inverse Fourier transform is applied to each of the repaired 2D sets of Fourier data. Finally, the horn-shape volume is interpolated back to cubic volume. 
     The DFM method described above requires interpolation from polar coordinates to rectangular coordinates. 
     The cone beam reconstruction described above is based on circle and line orbits which requires that the missing shadow zone 28 of circle orbit data in the Fourier domain to be replaced by the line orbit data. For the line orbit orientation illustrated in FIG. 5, the object 40 is shown to move in the &#34;z direction&#34; in discrete increments identified as &#34;z --  step&#34; 36 increments. Each vertical column of detectors 32 together with the source 34 defines a plane through the object 40. Within each vertical plane, every detector position defines a specific angle and the data collected by that detector corresponds to a parallel projection of the object sampled by intervals of z-step (FIGS. 5, 6, and 7). FIG. 6 shows a number of parallel projections of object 40 at angle θ m  =θ max  and FIG. 7 shows parallel projections of object 40 at angle θ m  =θ min . These parallel projections are used to fill in the corresponding missing angular segment in the 2D FT plane. θ max  and θ min  are angles selected so that the data volume for the shadow cone 30 (FIG. 3) used to replace the shadow zone 28 data volume encompasses the shadow zone data volume. This condition is satisfied when θ 0  =θ m , as illustrated in FIG. 2. 
     One approach is to reconstruct the filtered back-projection (FBP) image for each angular plane using the parallel projections from the set of limited angular views and then to compute the 2D FT and use it to replace the missing angular segment. 
     Another alternative is to convert the polar grid data from 1D FT of parallel projections to rectangular grid directly in 2D FT domain. This method is similar to the interpolation required in Direct Fourier Method back-projection. 
     In the line orbit, for each plane, a number of projections (equal to &#34;M&#34; detectors in each vertical column) are acquired, for an angular range from θ min  to θ max . Interpolation techniques for the line data provide the methodology for developing the below described interpolation techniques that are useful for calculating the cone beam reconstruction methods. 
     First, let μ.sub.φ (x, y) be the image in a fixed coordinate system x-y and μ.sub.φ (x, y) represent the object in a coordinate system x-y rotated from x-y by an angle φ. The projection of the object at a view angle φ is 
     
         P.sub.φ (x)=∫μ.sub.φ (x,y)dy.              (7) 
    
     The 1D FT of p.sub.φ (x) is given as 
     
         P.sub.φ (u)=∫p.sub.φ (x)e.sup.-j2πxu du.   (8) 
    
     If M.sub.φ (ρ, φ) denotes the 2D FT of μ.sub.φ (x, y) in polar coordinates, then based on the Projection slice theorem, 
     
         M(ρ, φ)=P.sub.φ (ρ), where 
    
     
         ρ&gt;0, 0≦φ&lt;2π                              (9) 
    
     Assuming that M(ρ, φ) is known, this FT data on polar coordinates may be converted to Cartesian coordinates by the expression, M(ρ cos φ, ρ sin φ)=M(ρ, φ). The object is reconstructed by 2D inverse FT using the expression, 
     
         μ(x, y)=∫M.sub.C (u, v)e.sup.-j2(μx+vy) dudy.   (10) 
    
     However, M(ρ, φ) is not known at all positions but only at finite set of discrete points (ρ j , φ k ). The problem then becomes interpolating from the known values of polar points to the values requires over a rectangular Cartesian grid. 
     An existing theorem is utilized to solve this problem. First, let x(t) be a periodic function in time space &#34;t&#34; with period &#34;T.&#34; If x(t) is angularly band-limited to a value ##EQU9## where &#34;c&#34; is a constant, and &#34;K&#34; is an integer relating to the number of samples of x(t), then x(t) can be written as: ##EQU10## 
     The proof follows from Shannon&#39;s sampling theorem as follows: ##EQU11## were the number of data array columns N=2K+1. 
     Angular interpolation employs the function M(ρ, φ) wherein variable φ has a period of 2π. Since M(ρ, φ) is angularly band-limited to &#34;K&#34; (i.e., Fourier series coefficients satisfy c n  =0 for |n|&gt;K), then ##EQU12## 
     Radial interpolation is described next. If the object is space limited to diameter 2A, where &#34;A&#34; is equivalent to radius &#34;R&#34;, identified previously as the radius of the smallest sphere containing the object 40, its projections are also limited to diameter 2A and therefore the FT of the projection Pφ(u) can be reconstructed as ##EQU13## using Shannon&#39;s sampling theorem. 
     Combining angular and radial interpolation: ##EQU14## 
     M C  (u l , v m ) is computed over the Cartesian space as: ##EQU15## 
     To reduce interpolation error, a number of steps may be taken, as described below. Error from inadequate sampling in space will be considered first. 
     During the line orbit, the parallel projection data are sampled in intervals of a predetermined z-step 36. As the projections are space limited they will not be band-limited. Sampling the projections over a predetermined z-step window (for example 2A) will effectively reduce the bandwidth and introduce aliasing artifacts into the 2D FT domain. Consequently, the &#34;z --  step&#34; 36 is selected to be small enough such that the effective bandwidth, ##EQU16## [points/cycle], will substantially include the frequency content of the projections. 
     Another source of error is inadequate sampling in a radial frequency. If the object is space limited in diameter to ##EQU17## its projections will also be space limited to 2A, as such, the FT is sampled uniformly at intervals of at least, ##EQU18## [points/cycle], in order to avoid aliasing. 
     For the line data, the effective bandwidth is defined as &#34;B.&#34; The number of radial samples &#34;N&#34; are chosen such that ##EQU19## Also the grid spacing in the 2D FT domain is at most ##EQU20## [points/cycle]. 
     Another source of error is an insufficient number of views. Non-isotropic and off-centered objects will not be angularly band-limited. So, the number of projections may be very large. However, in practice the number of projections is chosen such that in the 2D FT domain the sampling between two neighboring radial lines will be approximately equal to the maximum grid spacing of ##EQU21## [points/cycle]. 
     Interpolation in the 2D FT domain is described next. For the line orbit data, a rectangular grid spacing of ##EQU22## [points/cycle], is used in the 2D FT domain. In a computer implementation, typically, the Fast Fourier Transform (FFT) is used for computing the 1D FT of each projection. In order to improve radial sampling, zero padding of the projection data is performed before applying FFT. In this specification zero padding involves the steps of adding zeros to the data set to minimize artifacts after an FFT is performed. Once a radial sampling has been obtained, Nearest neighbor interpolation or Linear interpolation is used to compute the values between the new sample points. 
     As mentioned previously, for the line orbit a plurality of projections are required for a small angular segment (i.e., angular direction is over-sampled compared to radial sampling). One concern is how to use this data efficiently. A simple interpolation scheme such as nearest neighbor will not use all of the available data. One alternative approach is to decimate the number of views by grouping the rows and then summing the rows from each group so as to increase the signal to noise ratio (SNR) utilizing an inverse bilinear interpolation technique, as further described below. 
     In the present invention, an inverse bilinear interpolation technique is used on data in the polar grid format. For optimal interpolation in the azimuthal direction, σ(φ) the function defined in equation (13) may be used. However, this function is computationally impractical. For a computer implementation, values in the interpolation function must be truncated which causes artifacts. 
     From a computational standpoint, the simplest interpolation algorithm to implement is the Nearest neighbor (NN) algorithm, wherein each pixel is given the value of the sample which is closest to the pixel. NN is equivalent to convolving the sampled data by a rectangular function. Convolution with a rectangle function in the spatial domain is equivalent to multiplying the signal in frequency domain by a sinc(. ) function, which is a poor low pass filter since it has prominent side lobes. 
     Linear interpolation amounts to convolution of the sampled data by a triangle window. This function corresponds in frequency domain to a sinc 2  (. ) function which has a better low pass filtering property than NN. 
     The NN method interpolates on the basis of a single point. The linear interpolation algorithm interpolates on the basis of two nearest points. Using three points for interpolation would result in two points on one side and only one on the other side. The B-spline method enables interpolation over the two nearest points in each direction. The Cubic B-spline method comprises four convolutions of the rectangular function of the NN method. Since Cubic B-splines are symmetric, they only need to be defined in the interval (0, 2). Mathematically, the B-splines can be written as: ##EQU23## 
     The Cubic B-splines equations defined above may be adapted to fit a smooth third-order polynomial through the available set of shadow cone 30 data. 
     Another interpolation function involves the truncation of σ (φ). As mentioned previously, it is desirable to find the ideal interpolation function in the angular direction of the σ(φ) function. However, the σ(φ) function has considerable energy and, as such, does not decay fast over an extended distance, and therefore cannot be easily implemented as a space domain convolution. It is natural to truncate the function over a small distance, but truncation disregards much of the above said energy. Moreover, truncation in the space domain will produce ringing artifacts when the object is converted from the space domain to the signal domain. 
     Bilinear interpolation is a 2D interpolation method. In this interpolation method f(x,y) is evaluated by a linear combination of f(n 1 ,n 2 ) at the four closest points for n 1  T≦x≦(n 1  +1)T and n 2  T≦y≦(n 2  +1)T. The interpolated value f(x,y) in the bilinear method is: ##EQU24## 
     Inverse bilinear interpolation converts polar-grid data into rectangular-grid data via inverse bilinear weighting. That is, each polar-grid element is redistributed to its four nearest rectangular grids using the four sub-areas as normalized weights. The method is robust in the sense that the original data does not have to be regularly distributed, as long as the data has at least one element in each rectangular square. As such, undesirable data elements caused by defects or seams in detector array 32 (FIG. 5) may be ignored. Another benefit of this process is that all the good data are fully utilized, which, consequently, provides a better signal-to-noise ratio (SNR). 
     A linear orbit datum value &#34;x&#34; and associated grid points used in inverse bilinear interpolation are graphically illustrated in FIG. 8. The data value &#34;x&#34; is distributed to its four nearest grid points as follows: 
     
         g.sub.ij =g.sub.ij +a.sub.11 x 
    
     
         g.sub.i+1,j =g.sub.i+1,j +a.sub.01 x 
    
     
         g.sub.i,j+1 =g.sub.i,j+1 +a.sub.10 x 
    
     
         g.sub.i+1,j+1 =g.sub.i+1,j+1 +a.sub.00 x 
    
     Each grid point has an accumulated value, g ij , which identifies the accumulated weighted &#34;x&#34; values from the four adjacent squares. To normalize the accumulated value at each grid point, it is necessary to maintain another variable, w ij , which identified the accumulated weights (a ij ) associated with the bilinear distribution of pixel (I,j). In fact, this is a normalization step at the end of the interpolation procedure because each grid value is divided by accumulated weight, w ij . 
     Six sets of simulations were conducted using the described interpolation methods for the 2D FT domain and the image domain. The simulation results illustrate Inverse bilinear interpolation as compared to Nearest neighbor (NN), Linear, Cubic B-Spline, and Filtered back projection (FBP) interpolation methods. Results are presented in Tables I through VI. 
     For the first three simulations, Linear interpolation was used in the radial direction. Nearest neighbor, Linear and Cubic B-spline interpolation techniques were used in the azimuthal direction. The reconstruction of an angular segment in the 2D FT domain was simulated using the line orbit data. The slice of interest was the central slice through the object in FIG. 5. The object consisted of three horizontal disks so that it had sharp edges in z (vertical) direction. 
     The Truncated σ(φ) interpolation method was also used in the azimuthal direction (including 8 neighboring points). Linear interpolation was used in the radial direction. Nearest neighbor interpolation and Linear interpolation generated better performance results than Cubic B-spline interpolation. However, Cubic B-spline uses only 4 points as opposed to 8 points in Truncated σ(φ) interpolation. So, Cubic B-spline is computationally more attractive than the 8 points Truncated σ(φ) interpolation, as such, Truncated σ(φ) interpolation was not included in the comparison. 
     Polar points based bilinear interpolation was also evaluated. The 2D FT of the slice of interest was computed and used as the base reference for of comparing the above identified methods. The 2D FT of the FBP reconstruction was also included in the comparison. FBP reconstruction requires the reconstruction of the 2D FMP image and then computation of the 2D FT. However, Polar bilinear interpolation does not require conversion back to the image domain. This results in a computational advantage over the FBP method. 
     In order to measure the performance of each method, the interpolated rectangular grid values were computed using the above methods for different numbers of views and radial samples. The error was computed with the true 2D FT as follows: Norm1 (total absolute difference, Table I); Norm2 (square root of the total squared distance, Table II); and Norm∞ (maximum absolute difference, Table III). Note, that terms Norm1, Norm2, and Norm∞ are standard terms used in statistical analysis. 
     
                       TABLE I______________________________________     % NORM1 ERROR in 2D FT DOMAIN______________________________________# of views  256      256       64    16# of radial 1280     256       256   256samplesNear. Neigh.       58.4     58.0      60.9  75.2Linear      49.7     49.5      51.6  67.1Cubic B-Spline       45.7     45.6      47.9  64.9Inverse bilinear       41.2     40.7      43.3  60.9FBP         77.6     77.6      77.6  77.6______________________________________ 
    
     
                       TABLE II______________________________________     % NORM2 ERROR in 2D FT DOMAIN______________________________________# of views  256      256       64    16# of radial 1280     256       256   256samplesNear. Neigh.       31.6     31.6      33.0  38.9Linear      26.5     26.5      26.3  33.8Cubic B-Spline       24.4     24.5      24.8  32.9Inverse bilinear       21.8     21.3      22.4  31.9FBP         54.5     54.5      54.5  54.5______________________________________ 
    
     
                       TABLE III______________________________________     % NORM∞ ERROR in 2D FT DOMAIN______________________________________# of views  256      256       64    16# of radial 1280     256       256   256samplesNear. Neigh.       8.88     8.88      8.88  8.88Linear      8.87     8.87      7.82  6.78Cubic B-Spline       8.61     8.61      7.70  6.77Inverse bilinear       7.58     6.08      6.08  7.26FBP         80.25    80.25     80.25 80.25______________________________________ 
    
     The corresponding limited view images were also computed (Tables IV-VI) using inverse 2D FT from the interpolated rectangular grids. The errors were compared in the reconstructed images with the true image. The FBP image are also included in the comparison. Note that in the real implementation for the line orbit, it is not necessary to reconstruct the images before patching the 2D FT data into the Feldkamp 2D FT data. 
     
                       TABLE IV______________________________________    % NORM1 ERROR in IMAGE DOMAIN______________________________________# of views 256      256       64     16# of radial      1280     256       256    256samplesNear. Neigh.      24.1     24.0      24.2   27.4Linear     19.1     19.1      18.4   21.2Cubic B-Spline      16.1     16.1      15.7   18.9Inverse bilinear      12.5     11.8      12.5   22.3FBP        38.5     38.5      38.5   38.5______________________________________ 
    
     
                       TABLE V______________________________________    % NORM2 ERROR in IMAGE DOMAIN______________________________________# of views 256      256       64     16# of radial      1280     256       256    256samplesNear. Neigh.      93.3     93.1      87.5   108.4Linear     52.8     52.6      50.1   77.6Cubic B-Spline      50.8     50.7      49.4   75.7Inverse bilinear      40.0     40.3      45.8   89.9FBP        84.5     84.5      84.5   84.5______________________________________ 
    
     
                       TABLE VI______________________________________    % NORM∞ ERROR in IMAGE DOMAIN______________________________________# of views 256      256       64     16# of radial      1280     256       256    256samplesNear. Neigh.      82.0     81.7      93.8   133.5Linear     67.8     67.5      78.4   121.5Cubic B-Spline      66.5     66.2      77.7   117.0Inverse bilinear      61.8     61.8      68.0   89.3FBP        97.8     97.8      97.8   97.8______________________________________ 
    
     It may be observed that increasing the radial sampling does not reduce the error in the image domain. However, decreasing the radial sampling does introduce errors because the rectangular grid spacing are no longer on the same order as radial sampling. However, the value of the &#34;z step&#34; 36 is fixed because of bandwidth constraints. Thus, &#34;N&#34; samples are available for each projection such that N multiplied by &#34;z --  step&#34;=2A. 
     In each case the inverse bilinear interpolation has less error both in the 2D FT domain and in the image domain compared to the other listed interpolation methods. The number of views in the 2D FT domain and the image domain may also be reduced from 256 without significantly increasing the image error as, for example, can be observed by the data in Table VI. 
     Specific embodiments of various methods and apparatuses of reconstructing CT images according to the present invention has been described for the purpose of illustrating the manner in which the invention is made and used. It should be understood that the implementation of other variations and modifications of the invention and its various aspects will be apparent to one skilled in the art, and that the invention is not limited by the specific embodiments described. Therefore, it is contemplated to cover the present invention any and all modifications, variations, or equivalents that fall within the true spirit and scope of the basic underlying principles disclosed and claimed herein.