Abstract:
A method of computed-tomography and a computed-tomography apparatus in which x-ray projection data is acquired at a number of views for a scan of an object. Partial images are created from data for a desired number of said views. Full scan images are created from plural ones of the partial images. Non-overlapping time images are created from the full-scan images. Gradient images are also created. An improved image is created by weighting respective ones of the full scan and non-overlapping time images using the gradient image. The improved image has increased sharpness with reduced noise.

Description:
CROSS REFERENCE TO RELATED APPLICATION 
       [0001]    This application is a Continuation of and claims the benefit of priority under 35 U.S.C. §120 from U.S. Ser. No. 12/539,674, filed Aug. 12, 2009, the contents of which are incorporated herein by reference. 
     
    
     BACKGROUND OF THE INVENTION 
       [0002]    1. Field of the Invention 
         [0003]    The present invention relates to reducing noise in computed tomography (CT) images during CT-fluoroscopy. 
         [0004]    2. Discussion of the Background 
         [0005]    CT-fluoroscopy involves continuous scanning of a slice or volume of a subject for monitoring in real time, such as monitoring interventions. If a regular dose of x-rays is used, the subject will be exposed to a large x-ray dose. If a lower dose is used, then image noise is increased. In CT, image noise is inversely proportional to the square root of the x-ray tube current. As the tube current is decreased to reduce dose, the image noise increases, resulting in poor image quality. One method used to reduce image noise is to average the image slices at the same location, but this produces blurring of the edges since there is bound to be movement of the subject, voluntary or involuntary, during the scan. For example, involuntary motion can be due to breathing or beating of the heart. 
       SUMMARY OF THE INVENTION 
       [0006]    One aspect of the present invention is a computed-tomography method including exposing an object with x-rays at a plurality of scans at a position of the object to obtain projection data at a plurality of views, defining a group of views, where each scan includes a first number of the groups, generating first images respectively using projection data from each group of views, generating second images from plural ones of the first images, generating third images by averaging respective pluralities of the second images, generating a gradient image using at least one of the second and third images, and generating a display image by weighting one the of second images and one of the third images using the gradient image. 
         [0007]    In another aspect of the invention, a computed-tomography apparatus includes an x-ray source to expose an object with x-rays at a plurality of scans at a position of the object to obtain projection data at a plurality of views, an x-ray detector, a data collection unit, a data processing unit connected to the data collection unit, and a display. The data processing unit includes a memory storing x-ray projection data for a plurality of scans at a position of an object to obtain projection data at a plurality of views, and the data processing unit generates first images respectively using projection data from each group of views, generates second images from plural ones of the first images, generates third images by averaging respective pluralities of the second images, generates a gradient image using at least one of the second and third images, and generates a display image on the display by weighting one the of second images and one of the third images using the gradient image. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0008]    A more complete appreciation of the invention and many of the attendant advantages thereof will be readily obtained as the same becomes better understood by reference to the following detailed description when considered in connection with the accompanying drawings, wherein: 
           [0009]      FIG. 1  is a diagram of a system according to the invention; 
           [0010]      FIG. 1A  is a diagram of the processing unit of  FIG. 1 ; 
           [0011]      FIG. 2  is a matrix of views collected over one rotation of the x-ray source; 
           [0012]      FIG. 3  is a diagram of view blocks and image reconstruction over the view blocks; 
           [0013]      FIG. 4  is a diagram illustrating partial images; 
           [0014]      FIG. 5  is a diagram illustrating full-scan images; 
           [0015]      FIG. 6  is a diagram illustrating non-overlapping time images; 
           [0016]      FIG. 7  is a diagram illustrating combining images; 
           [0017]      FIG. 8  is a graph illustrating a blending curve; 
           [0018]      FIG. 9  is a graph illustrating gradient values in an image; 
           [0019]      FIG. 10  is a graph of blending factor as a function of gradient value; and 
           [0020]      FIG. 11  shows full-scan, non-overlapping and blended images. 
       
    
    
     DETAILED DESCRIPTION 
       [0021]      FIG. 1  shows an x-ray computed tomographic imaging device according to the present invention. The device may be operated as different x-ray doses to carry out different types of scanning, such as CT fluoroscopy. The projection data measurement system constituted by gantry  1  accommodates an x-ray source  3  that generates a cone-beam of x-ray flux approximately cone-shaped, and a two-dimensional array type x-ray detector  5  consisting of a plurality of detector elements arranged in two-dimensional fashion, i.e., a plurality of elements arranged in one dimension stacked in a plurality of rows. X-ray source  3  and two-dimensional array type x-ray detector  5  are installed on a rotating ring  2  in facing opposite sides of a subject, who is laid on a sliding sheet of a bed  6 . Two-dimensional array type x-ray detector  5  is mounted on rotating ring  2 . Each detector element will correspond with one channel. X-rays from x-ray source  3  are directed on to subject through an x-ray filter  4 . X-rays that have passed through the subject are detected as an electrical signal by two-dimensional array type x-ray detector  5 . 
         [0022]    X-ray controller  8  supplies a trigger signal to high voltage generator  7 . High voltage generator  7  applies high voltage to x-ray source  3  with the timing with which the trigger signal is received. This causes x-rays to be emitted from x-ray source  3 . Gantry/bed controller  9  synchronously controls the revolution of rotating ring  2  of gantry  1  and the sliding of the sliding sheet of bed  6 . System controller  10  constitutes the control center of the entire system and controls x-ray controller  8  and gantry/bed controller  9  such that, as seen from the subject, x-ray source  3  executes so-called helical scanning, in which it moves along a helical path. Specifically, rotating ring  2  is continuously rotated with fixed angular speed while the sliding plate is displaced with fixed speed, and x-rays are emitted continuously or intermittently at fixed angular intervals from x-ray source  3 . The source may also be scanned circularly. 
         [0023]    The output signal of two-dimensional array type x-ray detector  5  is amplified by a data collection unit  11  for each channel and converted to a digital signal, to produce projection data. The projection data output from data collection unit  11  is fed to processing unit  12 . Processing unit  12  performs various processing using the projection data. Unit  12  performs interpolation, backprojection and reconstruction. Unit  12  determines backprojection data reflecting the x-ray absorption in each voxel. In the helical scanning system using a cone-beam of x-rays, the imaging region (effective field of view) is of cylindrical shape with radius o) (is there a word missing here?) centered on the axis of evolution. Unit  12  defines a plurality of voxels (three-dimensional pixels) in this imaging region, and finds the backprojection data for each voxel. The three-dimensional image data or tomographic image data compiled by using this backprojection data is sent to display device  14 , where it is displayed visually as a three-dimensional image or tomographic image. 
         [0024]    In typical CT operation, projection data is collected over one rotation of the x-ray source (full scan). The number of views collected per rotation in time (T Rot ) is N VPR , and during each view, data is collected from a set of detectors N d . There may be one or more rows of detectors. For ease of explanation, a detector with one row is considered. The views collected over one rotation can be represented as a matrix shown in  FIG. 2 . Each cell in the matrix represents a sample of the data collected at any given view (y-axis) and any given channel (x-axis). 
         [0025]    A more detailed view of collection unit  11  and processing unit  12  is shown in  FIG. 1A . The projection data is collected and the data for each of a desired number of views is stored in a register or portion of memory unit  11 - 1  to  11 - n .  FIG. 1A  will be described in more detail below. 
         [0026]    For CT fluoroscopy, the same slice position is scanned repeatedly for more than one rotation (N Rot ). The total number of views collected is given by N Rot |N VPR  compared with just N VPR  in the case of typical CT operation. Since there is a continuous feed of the views, it is not necessary to wait until the end of an integral number of T Rot  to reconstruct an image. A real time image may be reconstructed using data views equal to N VPR  at any given time (the views are counted backwards from any point in time). Preferably, real-time images are reconstructed at a desired fraction of the rotation, such as every ¼ or ⅙ rotation. 
         [0027]      FIG. 3  illustrates an example with the number of sections per rotation N SPR =4. An image may be reconstructed every T Rot /N SPR . As an example, for a rotation time T Rot =1 sec, an image may be produced every 0.25 sec. This provides an effect similar to real-time image production or CT fluoroscopy. In  FIG. 3 , while N SPR =4, it can take on other values such as 6 or 8. The higher the number the more the image appears to be real-time. 
         [0028]    The upper limit is determined by hardware speed and memory needed to reconstruct images. For example, having four partial images per second implies four displayed images per second. In an extreme limit, in a mathematical sense, a partial image after every view may be created, that is 900 partial images per second or 900 displayed images per second (in this example). However, for the human eye, anything beyond 25-30 images per second is not significant. Hence, in practice no more than about 20 or 25 partial images per second (900 views) may be computed to provide good quality partial images. Note that for example purposes, 900 views per second are used but this number can take on other values as needed. 
         [0029]    As an example, assume that a total of 1800 views are collected and 900 views are required to reconstruct  1  image (Full-Scan). Then, in theory an image can be reconstructed using the view ranges (1 . . . 900), (2 . . . 901), (3 . . . 902) &amp; so on. However, in practice, the ability of the hardware to keep up with the pace of reconstruction may be limited. 
         [0030]    In another example, if N VPR =900, each view block contains 225 (900/4) views. There will be a significant overlap in terms of views when reconstructing consecutive images. It is therefore not necessary to backproject N VPR  views to reconstruction every single image. Partial images, shown in  FIG. 4 , may be used. Each partial image PI is formed by backprojecting only those views within the block. For example, PI(0) is a partial image formed from view block n=0, etc. Full scan images (FS) are formed by: 
         [0000]    
       
         
           
             
               
                 F 
                  
                 
                     
                 
                  
                 
                   S 
                    
                   
                     ( 
                     k 
                     ) 
                   
                 
               
               = 
               
                 
                   ∑ 
                   
                     i 
                     = 
                     0 
                   
                   
                     
                       N 
                       SPR 
                     
                     - 
                     1 
                   
                 
                  
                 
                   P 
                    
                   
                       
                   
                    
                   
                     I 
                      
                     
                       ( 
                       
                         k 
                         - 
                         i 
                       
                       ) 
                     
                   
                 
               
             
             , 
             
               
                 where 
                  
                 
                     
                 
                  
                 
                   N 
                   SPR 
                 
               
               &gt; 
               1 
             
             , 
             
               k 
               ≥ 
               
                 
                   N 
                   SPR 
                 
                 - 
                 1 
               
             
           
         
       
     
         [0000]    In the example of  FIG. 4 , 
         [0031]    First image=PI(0)+PI(1)+PI(2)+PI(3)=FS(3) 
         [0032]    Second image=first image−PI(0)+PI(4)=FS(4) 
         [0033]    Third image=second image−PI(1)+PI(5)=FS(5) 
         [0000]    Using one adding and one subtracting operation to create the images reduces the number of operations as opposed to three additions. Here, a partial image (PI) can be computed from as small as one view. In the example, 900 consecutive (in time) partial images may be added added to give one full scan image. Computationally, using larger number of views (such as 225 in the example) to create partial images is more practical. Further, partial images may be computed using a partial scan, such as a half-scan image. 
         [0034]    According to the invention, the images may be averaged before being displayed. This is illustrated in  FIG. 5 . In  FIG. 5 , OTA denotes Overlapping Time Average. The displayed images OTA are computed in unit  12  by: 
         [0000]    
       
         
           
             
               
                 O 
                  
                 
                     
                 
                  
                 T 
                  
                 
                     
                 
                  
                 
                   A 
                    
                   
                     ( 
                     k 
                     ) 
                   
                 
               
               = 
               
                 
                   1 
                   
                     N 
                     OTA 
                   
                 
                  
                 
                   
                     ∑ 
                     
                       i 
                       = 
                       0 
                     
                     
                       
                         N 
                         OTA 
                       
                       - 
                       1 
                     
                   
                    
                   
                     F 
                      
                     
                         
                     
                      
                     
                       S 
                        
                       
                         ( 
                         
                           k 
                           - 
                           i 
                         
                         ) 
                       
                     
                   
                 
               
             
             , 
             
               
 
             
              
             
               
                 where 
                  
                 
                     
                 
                  
                 
                   { 
                   
                     
                       N 
                       OTA 
                     
                     , 
                     
                       N 
                       SPR 
                     
                   
                   } 
                 
               
               &gt; 
               
                 1 
                  
                 
                     
                 
                  
                 and 
                  
                 
                     
                 
                  
                 k 
               
               ≥ 
               
                 
                   N 
                   SPR 
                 
                 - 
                 1 
                 + 
                 
                   N 
                   OTA 
                 
               
             
           
         
       
     
         [0000]    In this example: 
         [0035]    First Display Image OTA(5)=average (FS(3)+FS(4)+FS(5)) 
         [0036]    Second Display Image OTA(6)=average (FS(4)+FS(5)+FS(6)) 
         [0037]    The above OTA approach works ideally when the object being scanned is stationary. However, when there is voluntary or involuntary motion, edges in the displayed image may be blurred. In a second approach to noise reduction, non-overlapping time images (NTA) are averaged. These images are smooth (less noise). This is illustrated in  FIG. 6 . The NTA images are computed by: 
         [0000]    
       
         
           
             
               
                 N 
                  
                 
                     
                 
                  
                 T 
                  
                 
                     
                 
                  
                 
                   A 
                    
                   
                     ( 
                     k 
                     ) 
                   
                 
               
               = 
               
                 
                   1 
                   
                     N 
                     NTA 
                   
                 
                  
                 
                   
                     ∑ 
                     
                       i 
                       = 
                       1 
                     
                     
                       N 
                       NTA 
                     
                   
                    
                   
                     F 
                      
                     
                         
                     
                      
                     
                       S 
                        
                       
                         ( 
                         
                           
                             i 
                             · 
                             
                               N 
                               SPR 
                             
                           
                           - 
                           1 
                         
                         ) 
                       
                     
                   
                 
               
             
             , 
             
               
 
             
              
             
               
                 where 
                  
                 
                     
                 
                  
                 
                   N 
                   NTA 
                 
               
               &gt; 
               
                 1 
                  
                 
                     
                 
                  
                 and 
                  
                 
                     
                 
                  
                 k 
               
               ≥ 
               
                 
                   
                     N 
                     NTA 
                   
                   · 
                   
                     N 
                     SPR 
                   
                 
                 - 
                 1 
               
             
           
         
       
     
         [0038]    N NTA  is defined as the number of non-overlapping time average images. For example, NTA(11)=FS(3)+FS(7)+FS(11). 
         [0039]      FIG. 7  illustrates a further approach to producing an improved imaged. At the end of any view block, there are two different images that may be displayed, the NTA and FS images. The NTA image (smooth image) is combined with the FS image (sharp image) to produce an image with sharp edges without degrading the image smoothness. Here, smoothed image(11)=FS(11)++NTA(11). The symbol “++” is used to denote a blend of the images, and not an addition of corresponding voxels in the 2 images. The FS or NTA image may be defined by the newest collected view block which is  11  in the schematic of  FIG. 6 . Since this is ‘real-time’ the views in view block  12  are not being used for computation as yet, although they might be getting collected as the hardware computes FS(11), NTA(11) and FS(11)++NTA(11). 
         [0040]    A gradient image, described in more detail below, is used to determine the contribution to each pixel in the display image from the NTA image and from the FS image. For pixels in the gradient image that have a high value (indicating an edge), the pixels in the display image will have a significantly larger contribution from the FS image (sharp image) and pixels in the display image that have a low value (indicating smooth regions) will have a larger contribution from the NTA image (smooth image). 
         [0041]    The gradient image may be obtained as follows: 
         [0042]    In a first approach, a difference of consecutive FS images is found, and there is (N SPR −1)/N SPR  rotation overlap. 
         [0000]      Grad1 k   =abs ( FS ( k )− FS ( k− 1)), where  k≧N   SPR .
 
         [0043]    In a second approach, a difference of FS images is found, with no overlap between the images. 
         [0000]      Grad2 m   =abs ( FS ( m )− FS ( m−N   SPR )), where  m≧ 2 ·N   SPR −1
 
         [0044]    In a third approach, a difference between FS and NTA images is found 
         [0000]      Grad3 p   =abs ( FS−NTA   p ), where  p≧N   NTA   ·N   SPR −1
 
         [0045]    If there is object motion (as is usually the case), scheme 1 is a better approach than scheme 2. 
         [0046]    Once the gradient image is obtained, the gradient, FS and NTA images are blended.  FIG. 8  represents one blending curve, which is represented by the following equation: 
         [0000]    
       
         
           
             1 
             
               1 
               + 
               
                  
                 
                   
                     - 
                     
                       ( 
                       
                         x 
                         - 
                         
                           x 
                           0 
                         
                       
                       ) 
                     
                   
                   / 
                   w 
                 
               
             
           
         
       
     
         [0000]    Here, x 0  and w are parameters, where x 0  represents the “center” of the curve and w controls the “width” of the curve. 
         [0047]    The parameters may be chosen by an operator or can be set automatically depending on the scan conditions and the slice position in the object being imaged.  FIG. 8  shows typical values of x 0 =40 and w=15. In  FIG. 8 , x 0  and w were selected and plugged into the above equation to obtain the curve. These values are just an example. In general, x o  may be automatically selected by computing the average value of voxels in the gradient image, and w is set based on image quality. As shown in  FIGS. 8 and 10 , w can take on a range of values, such as between 15 and 30. 
         [0048]    The gradient curve remains fixed for each pixel. In other words, the ‘shape’ of the curve does NOT depend on ‘x’ value, which would the gradient value at any voxel. Therefore, going from one voxel to another is tantamount to moving along the x-axis which would in turn yield a corresponding value (alpha) on the y-axis. However, the value of α for each pixel is different and this value is determined by the value of the gradient at that pixel, and is given by: 
         [0000]    
       
         
           
             1 
             
               1 
               + 
               
                  
                 
                   
                     - 
                     
                       ( 
                       
                         x 
                         - 
                         
                           x 
                           0 
                         
                       
                       ) 
                     
                   
                   / 
                   w 
                 
               
             
           
         
       
     
         [0000]    For each pixel in the gradient image, a new value of α is determined based on the gradient value. 
         [0049]    At any given pixel, if the gradient value is high, a higher value of α is used such that a higher contribution to the displayed image comes from the FS (sharp) image and, on the other hand, if the gradient value is low, this means that the pixel belongs to a low frequency region and a higher contribution to the displayed image comes from the NTA (smooth) image. The following equation describes the blending to obtain the blended image BI. 
         [0000]        Bl   p ( n )=(1− a ) NTA   p ( n )+α· FS   p ( n ),
 
         [0000]    where 0&lt;p&lt;Number of pixels. 
         [0050]    The gradient curve may be automatically selected. When the gradient image is computed, the statistics (mean, median and standard deviation) of the noise values in a soft-tissue region may be computed. On the x-axis, which represents the gradient value, the soft-tissue region and the high gradient regions will be segregated as shown in  FIG. 9 . A point on the gradient axis (x-axis) which results in weight=0.75 is termed as the pivot point. This pivot point is the value of ‘w’ (gradient value) that gives a fixed value of blending weight=0.75. Thus, using the location of pivot point with respect to the soft tissue region statistics, the blending curve can be automatically chosen.  FIG. 10  illustrates different curves, for w=1, 5, 10 and 20. Curves for other values of w may be generated and used, as needed. 
         [0051]    An example of an image obtained according to the invention is illustrated in  FIG. 11 . The top image is the FS image, the middle image is the NTA image and the bottom image is the blended image obtained from the above equation. Three regions are indicated in the image. Region  91  shows the sharp tip of a needle. The same needle in the NTA image is blurred. Region  92  shows that the edges in the blended image are much sharper than the NTA image. Region  93  shows how noise is reduced in the blended image compared to the FS image. Thus, according to the invention, noise can be reduced while maintaining sharpness. 
         [0052]    A more detailed view of processing unit  12  is shown in  FIG. 1A . The projection data is collected and the data for each of desired number of views is processed in processing unit  12  by processor  16  to create the partial images PI(n) and stored them in registers or memory portions  15 - 1  to  15 - n  of memory  15 . Processing unit  12  also generates the FS(n) images, OTA images, NTA image, and gradient images and stores them in other registers or portions  15 - o ,  15 - p , . . . of memory  15 . Processing unit performs the blending using blending curves stored in register or memory portion  15 - m , and selects the blending curve, as described above, to create the weighted images. The weighted images are also stored in  15 - 0 ,  15 - p , . . . as needed. The images generated in processing unit  12  are sent to display  14  for display to the user. The images created and stored may also be transferred to other users or systems using a network such as a LAN, wireless LAN or the internet connected to the CT apparatus. 
         [0053]    The invention may also be embodied in the form a computer-readable medium containing a stored program to cause a computer to carry out the various operations and functions described above. 
         [0054]    Numerous other modifications and variations of the present invention are possible in light of the above teachings. It is therefore to be understood that within the scope of the appended claims, the invention may be practiced otherwise than as specifically described herein.