Abstract:
A method for digitally reconstructing a 3-dimensional tomosynthesis image by iterative reconstruction, a reconstructor, and a computer program product method are capable of plane-by-plane iterative reconstruction for digital breast tomosynthesis. The reconstruction process is based on a grouped coordinate ascent algorithm where the volume is split into a plurality of patches, wherein all patches are parallel to a surface of a detector. Splitting the volume allows implementing a modified model for image acquisition where the physical movement of the x-ray source is taken into account because each of the patches is updated separately and sequentially. In addition the splitting allows an efficient implementation on a graphical processing unit by reducing memory requirements.

Description:
BACKGROUND OF THE INVENTION 
     Field of the Invention 
       [0001]    The present invention relates to the digital reconstruction of a three-dimensional tomosynthesis image and a graphics processing unit (GPU) which is used to execute a reconstruction process based on a more accurate model of the acquisition process. 
         [0002]    Given the fact that breast cancer is one of the most common cancers among women today, early detection of the cancer or other anomalies indicative of cancer, like microcalcifications, so that these may be treated prior to metastatic spread, is an important objective. Accordingly, it is a major task to improve imaging techniques and related systems, as well as methods for reconstruction of tomographical images. 
         [0003]    Conventional mammography techniques are based on 2-dimensional imaging and generally suffer from the limitation that 3-dimensional anatomical information (for example masses or other anatomical structures to be detected) is projected onto a 2-dimensional image and therefore overlapping breast tissue often makes it difficult to perceive and characterize subtle lesions. In other cases the superposition of normal tissue structures can resemble suspicious lesions and lead to further, unnecessary medical procedures. 
         [0004]    In order to overcome these limitations a 3-dimensional imaging approach has been introduced. This approach analyses direct projections by computer software in order to construct or reconstruct a 3-dimensional volume of the breast, the reconstructed volume. In these systems x-rays are sent by an x-ray source to an x-ray detector. Between the source and the detector the medical volume (for example the breast) is arranged and preferably compressed. The x-ray beam, sent by the x-ray source is attenuated by the volume, so that attenuated signals may be received at the detector or by a set of detector elements, which produce signals, representing the attenuation of the incident x-rays and which are processed in order to reconstruct the 3-dimensional image. Normally the breast is exposed to radiation from a plurality of different angles. For example, a digital breast tomosynthesis system may acquire 25 direct projection images in which the source may move, such that the imaging angle may change within about 50 degrees. Alternate to the moving x-ray source there may be provided several x-ray sources in order to acquire signals from different angles. This 3-dimensional tomosynthesis technique provides spatial differentiation of overlapping tissues while losing some spatial differentiation between in plane adjacent structures, compared to the above-mentioned 2D imaging technique (in the direction perpendicular to the detector). 
         [0005]    However, digital breast tomosynthesis suffers from incomplete data (only a range of about 50 degrees is sampled out of the 180 degrees necessary for a complete data set are measured) which causes artifacts and creates the problem that there will be an infinite number of possible reconstruction volumes that can be described by the measured data. Another source of artifacts is introduced when the mathematical acquisition model used in the reconstruction deviates from the physical reality of the acquisition. In addition, a desire to minimize patient exposure to ionizing radiation leads to high noise in the measured data (poor quantum statistics) which is then propagated through the reconstructed volume. 
         [0006]    In order to overcome these problems and improve the reconstruction result, several reconstruction algorithms have been suggested in state of the art systems. 
         [0007]    Popular filtered backprojection (FBP) reconstruction methods provide high contrast and acceptable detail level in reconstructed images but those methods lose the information about relative tissue density (see for example: Mertelmeier T., Orman J., Haerer W., Kumar M. K., “Optimizing filtered backprojection reconstruction for a breast tomosynthesis proto-type device”, Proc. SPIE 6141, 2006). This happens due to removal of low frequency components with some filter kernels. Although these algorithms assume complete and noiseless data, some corrections can be applied to reduce the resuiting problems. 
         [0008]    So-called iterative reconstruction techniques do not make any assumptions on the measured data. Instead, a mathematical model of the acquisition process is used to define a cost function that needs to be maximized. For example, maximum likelihood methods use the Poisson distribution of the measured data to calculate the statistical likelihood of the projections and use it as a cost function. In the case of perfect data, the reconstructed volume with maximized cost function would be identical to the original image. 
         [0009]    Iterative reconstruction techniques repeatedly or iteratively apply an update to the reconstruction volume to generate an image that maximizes the defined cost function. This cost function depends on the model of the measurement (data acquisition), which includes the forward projection. Iterative reconstruction algorithms help to improve image quality, reduce artifacts in reconstructed images and allow reduction of x-ray dose. However, iterative reconstruction algorithms require significantly more computation time than conventional (for example FBP) reconstruction methods, because they have to execute a lot of iterations to generate each image, i.e. to “converge” to a solution. Further, these algorithms typically become computationally intensive and therefore are often impractical for clinical applications, due to the fact that images should be available to the radiologist within a reasonable amount of time. 
         [0010]    Iterative reconstruction offer possibilities for improving image quality and reducing artifacts as compared to analytical methods. Artifacts are mostly caused by a discrepancy between the real physical acquisition process and the model of the acquisition process used for reconstruction. Consequently, artifacts may be reduced and thus image quality enhanced by using a better (more accurate) model for image acquisition. Generally, more accurate models will be more complex and will require more processing time and memory. 
         [0011]    With respect to the problem of incomplete data and high image noise, application of an iterative reconstruction approach could be beneficial due to the possibility to include prior functions. Generally, these prior functions put additional constraints on the reconstructed volume (for example limiting variance between adjacent voxels in order to reduce noise), thus reducing the number of possible solutions in the case of incomplete data. However, one of the disadvantages of this approach is that it requires empirical determination of the optimal parameters of the prior function which usually involves a grid search over a range of values. The latter is not practical for high resolution breast imaging especially when multiple prior functions are evaluated. Another significant limitation is that iterative reconstruction methods with priors require to keep the multiple versions of the whole volume in memory. The precondition mentioned before (to keep a lot of data in memory) is required for the update step and prior function computation. The latter limits the maximum size of the reconstructed volume to the amount of GPU (graphics processing unit) memory. 
       OBJECT OF THE INVENTION 
       [0012]    Based on the above-mentioned approaches in state of the art it is therefore an object of present invention to provide an iterative reconstruction for digital breast tomosynthesis, which has a faster convergent speed and an efficient memory usage as known algorithms, while using a more accurate (and complex) acquisition model and while assuring efficient noise control and which may be implemented in the graphical processing unit. Moreover, it should be possible to overcome the drawbacks of the present reconstruction algorithms, mentioned above. 
       SUMMARY OF THE INVENTION 
       [0013]    In one aspect the method for digitally and iteratively reconstructing a 3-dimensional tomosynthesis image of a 3-dimensional volume, particularly of an organ and/or a body part/structure, comprises:
       Receiving signals of the tomosynthesis image system, wherein x-ray radiation is sent by an x-ray source to be received at a detector and is attenuated by anatomical structures of the 3-dimensional volume   Providing a model for image-acquisition, wherein this model can include parameters based on the physical movement of the x-ray source during x-ray emission/radiation and wherein the model could be different for each patch   Creating a cost function which includes the provided acquisition model. For complete, noiseless data, the cost function should be maximal for the true volume that has been measured on the system. An example is the Poisson likelihood of the acquired data.   Reconstructing the 3D volume by iteratively updating (changing) the volume so that the cost function is optimized. For example, the update step to maximize the likelihood can be calculated with the MLTR algorithm or the ML-convex algorithm or the ML-gradient algorithm or a grouped coordinate ascent algorithm (wherein the grouped coordinate ascent algorithm is not applied for each patch, it is applied to the entire volume and the patches (groups) are the result) or another algorithm.       
 
         [0018]    A short explanation of terms used within this application is given below. 
         [0019]    The x-ray source or tube is adapted to emit x-ray radiation, which is generally directed towards the detector. Typically the x-ray source is rotatable about an axis of rotation in order to image a compressed breast from a plurality of angles. Typically the source may be moved within an interval of 50° on an arc above breast in preconfigurable angular steps (typically: 2° steps between −25° to 25°). During x-ray exposure breast and detector remain stationary or static, respectively. Alternatively, it is also possible to provide not one single x-ray source, but a plurality of x-ray sources positioned at different locations, which may be arranged on an arc and/or which may be activated according to a preconfigurable (time) pattern: 
         [0020]    The detector usually is a flat panel detector. The detector may consist of a plurality of detector fields. The detector is a digital detector. The detector might also be combined with at least one plate of the compression system or with a compression paddle. 
         [0021]    The 3-dimensional volume mainly refers to a medical volume to be examined. According to a preferred embodiment the invention is applied for tomosynthesis mammography. However, the invention might also be applied for a variety of 3-dimensional imaging situations, such as heart imaging, bone imaging or generally examinations of soft tissues. Other embodiments do not refer to report generation or diagnosis, but refer to surgical applications like implantations, also comprising orthopedic implants, heart implants etc. 
         [0022]    The 3-dimensional volume, for example the breast, consists of a plurality of different tissue structures with a different density, for example fat tissue, glandular tissue, muscle, ligaments, blood vessels or other tissues, which also differ in their attenuation factors. Therefore, microcalcifications, lesions or other anatomical modifications or anatomical structures superimposing other structures are also detectable in the reconstructed image. 
         [0023]    “Reconstructing” refers to an iterative method where the 3D volume is modified in several steps in order to maximize a cost function. In one aspect of the invention parts of the volume (a patch, or a plane in the volume to be reconstructed) are updated sequentially within one update iteration of the entire volume. After a patch has been updated, its new values will be used when updating the other patches. Therefore, the&#39;order of updating matters and the logic of the algorithm is based on a sequential updating scheme. Thus, update steps are calculated for one patch and then applied to the reconstruction volume. After this update (and taking into account the changes that are introduced by this update) the update step for the next patch is calculated and applied to the image patch-by-patch. Reconstructing may comprise displaying the reconstructed volume on a monitor or output device. 
         [0024]    The term “iterative” refers to the fact that the algorithm starts from an initial image for which the cost function is calculated. In each following step, the update algorithm determines the necessary change to the volume (the update step) which will increase the cost function. Because of the complex mathematical form of the cost function, it is impossible to find an update step which maximizes the cost function in one step. The algorithm is thus repeated until a certain stopping condition is met (for example after a fixed number of iterations, or after a certain noise level has been reached in the volume). After each step the cost function calculated from the current volume will be higher than in the previous iteration, and thus closer to its maximum value. 
         [0025]    According to one aspect, the invention provides a method that enables to the use of a digital tomosynthesis to efficiently provide accurate 3-dimensional imaging of a target object, like a breast. Particularly, the method allows including a more accurate model of the acquisition process into the cost function of a maximum-likelihood for transmission algorithm (MLTR), in addition, the convergence speed of the algorithm is increased by applying a grouped coordinate ascent algorithm, where groups of voxels (as volume segments) are updated sequentially instead of simultaneously. This allows an efficient implementation on a graphical processing unit by reducing memory requirements. 
         [0026]    The “model” is a mathematical abstraction of the physical image acquisition process which is used during image calculation and reconstruction. Accordingly, the model is based on positional data relevant to the physical acquisition process and/or relates to real physical acquisition parameters, like image acquisition geometry, movement of x-ray source and/or x-ray detector during exposure, acquisition angles, radiation dose, detector properties, and image-related parameters, like spatial resolution and contrast resolution etc. A model may be formatted in a mathematical or abstract denomination or language. Based on the model there are deducible instructions relating to image reconstruction, which also might be implemented in hardware or software. The model is a representation of the physical acquisition process and serves as input data or basis for the reconstruction process, implemented on a system or on a reconstructor. 
         [0027]    The model processed and used within an embodiment of this invention is based on the main acquisition assumptions as in regular MLTR. It is assumed that the transmission data are Poisson-distributed. In contrast to a regular MLTR algorithm (see below) it is assumed that the x-ray tube moves during exposure: the acquisition model is changed from a “step and shoot model” to a model where the focus of the x-ray tube is moving during x-ray exposure. That is to say in original state of the art systems a model for the acquisition process has been based on the fact that the focus of the x-ray tube was stationary during each detector exposure and then moved to the next acquisition angle. In contrast to this in the model of the present invention the focus of the x-ray tube is also moving during x-ray exposure, and thus is better (more accurate) adapted to the real physical acquisition situation. This fact can be modeled as a smoothing of the transmission data provided that the volume has been split in patches parallel to the detector surface. 
         [0028]    In the most simple case the acquisition model can be written as ŷ i =b i  exp(−Σ i l ij μ j ) with ŷ i  the result of the modelled measurement,  μ  the attenuation distribution (the 3D volume to be reconstructed, b i  the blank value for projection line i (the theoretical measurement value in the case where there is no attenuation measured) and l ij  the intersection length between projection line i and voxel j. 
         [0029]    An example for including tube motion in the data acquisition model is shown here. The physical reality is closely described by the following formula: 
         [0000]    
       
         
           
             
               
                 y 
                 ^ 
               
               i 
             
             = 
             
               
                 
                   ∑ 
                   x 
                 
                  
                 
                   
                     b 
                     x 
                   
                    
                   
                     
                       ∏ 
                       p 
                     
                      
                     
                       exp 
                        
                       
                         ( 
                         
                           - 
                           
                             
                               ∑ 
                               
                                 j 
                                 ∈ 
                                 p 
                               
                             
                              
                             
                               
                                 l 
                                 
                                   
                                     i 
                                     x 
                                   
                                    
                                   j 
                                 
                               
                                
                               
                                 μ 
                                 j 
                               
                             
                           
                         
                         ) 
                       
                     
                   
                 
               
               + 
               
                 s 
                 i 
               
             
           
         
       
     
         [0030]    With Ŷi the measured data with pixel index i, with x defining the tube positions within a single x-ray exposure, with p enumerating the planes in the reconstruction volume, with \mu_j the attenuation value in voxel j of the reconstruction volume, with b_x the number of x-ray photons emitted by the x-ray tube at position x, with l_ixj the intersection length for the x-ray passing between the x-ray tube at position x, voxel j and pixel i and S_i the scatter in pixel i. 
         [0031]    Although this is a good description of reality, this model result in a cost function for which the derived update step is too complex for practical implementation. To this end, we simplify this model to the following model: 
         [0000]        ŷ   i   =b   i ψ i   ÷S   i  
 
         [0000]      ψ i =Π p   ψ   i   p  
 
         [0000]        ψ   i   p =Σ n   PSP   in   p ·ψ i   p  
 
         [0000]      ψ i   p =exp(−Σ jep   l   ij μ j ),
 
         [0032]    With PSF in the above mentioned formula referring to a point spread function which is the mathematical description of the image blurring caused by the tube motion. 
         [0033]    These two models are mathematically different, but result in similar results. The second model however results in a cost function for which the calculated update step is simple enough for easy implementation. 
         [0034]    Starting from the model for the data acquisition, on can define a cost function. This cost function should be defined in such way that the attenuation  μ  (which enters the cost function through the acquisition model) which maximizes the cost function (or in other embodiments minimizes it, but this is a trivial change of sign) is the “true” attenuation distribution of the volume in the case of complete (180° angular sampling) and noiseless data. 
         [0035]    In maximum likelihood algorithms, the log-likelihood L (usually named likelihood instead of log-likelihood) is chosen as cost function. It can be written as L=Σ i y i  ln(ŷ i )−ŷ i , where it both includes the measured data (y i ) and the data acquisition model (ŷ i ). 
         [0036]    From the previous section one can see that the image is reconstructed based on information from both the acquisition model and the acquired data. However, in some situations there might be additional information and/or constraints that should be included in the reconstruction. In this situation one can include this information/restraint in the form of a prior function which is added to the cost function discussed in the previous paragraphs. 
         [0037]    These prior functions can for example include information on the expected attenuation values in the reconstructed volume, or put a limitation on the maximum variance between neighboring voxels in the reconstruction volume. Starting from the likelihood cost function mentioned above, the new cost function F then becomes F=L−βP, with P the prior function and β the relative weight that is attributed to the prior function relative to the likelihood. In the case of a noise reducing prior, higher β will result in a smoother (less noisy image). When β=0, the additional information/constraints from the prior are not taken into account for the reconstruction. The prior function can contain numerous other parameters that describe its exact mathematical behavior in the reconstruction algorithm. 
         [0038]    An additional useful effect of the&#39;prior function in the specific case of tomosynthesis is the fact that usually the cost function for tomosynthesis is not convex, and the following maximization algorithms will only converge to the local maximum and not the maximum of the entire function. Adding a convex prior can limit the total number of local maxima so that the following algorithms are more likely to find the global maximum. 
         [0039]    The actual reconstruction of the 3D volume occurs when maximizing the cost function by iteratively updating the volume. 
         [0040]    Because of the mathematical complexity of the cost functions it is not possible to calculate the volume for which the cost function is maximized in one step. To this end several iterative algorithms exist that update the volume in several steps in order to maximize the cost function. The key is to step sufficiently fast (otherwise too many iterations are needed to reach the top), but not too fast (otherwise one may step over the top so that the next step has to undo part of the current step). The simplest example is the gradient ascent algorithm, where in each iteration a step is taken in the direction of the largest gradient. This algorithm is inefficient and thus not often used. 
         [0041]    Another approach is Newton&#39;s method, where a quadratic approximation of the cost function is calculated, and this quadratic function is maximized. The quadratic approximation is then repeated for the updated value of the cost function until a certain stop condition. 
         [0042]    For example in the MLTR algorithm, log-likelihood L is maximized by changing the attenuation distribution  μ . The likelihood can be written as L=Σ i y i  ln(ŷ i )−ŷ i , with y i  the measured transmission scan and ŷ i  the estimated transmission scan. In the most simple case the acquisition process can be written as ŷ i =b i  exp(−ρ i l ij μ j ) with b i  the blank value for projection line i and l ij  the intersection length between projection line i and voxel j. With this information, one can construct a gradient ascent algorithm. In a more general form, including an additional weighting factor α and prior P(  μ ) with weight β, the update step derived with Newton&#39;s method can be written as: 
         [0000]    
       
         
           
             
               μ 
               j 
               
                 n 
                 + 
                 1 
               
             
             = 
             
               
                 μ 
                 j 
                 n 
               
               + 
               
                 
                   
                     
                       
                         ∑ 
                         i 
                       
                        
                       
                         
                           l 
                           ij 
                         
                         ( 
                         
                             
                         
                          
                         
                           
                             y 
                             i 
                           
                           - 
                           
                             
                               y 
                               ^ 
                             
                             i 
                           
                         
                         ) 
                       
                     
                     - 
                     
                       β 
                        
                       
                           
                       
                        
                       
                         
                           ∑ 
                           k 
                         
                          
                         
                           
                             w 
                             jk 
                           
                            
                           
                             
                               ∂ 
                               
                                 P 
                                  
                                 
                                   ( 
                                   
                                     
                                       μ 
                                       j 
                                     
                                     , 
                                     
                                       μ 
                                       k 
                                     
                                   
                                   ) 
                                 
                               
                             
                             
                               ∂ 
                               
                                 μ 
                                 i 
                               
                             
                           
                         
                       
                     
                   
                   
                     
                       
                         1 
                         
                           α 
                           j 
                         
                       
                        
                       
                         
                           ∑ 
                           i 
                         
                          
                         
                           
                             l 
                             ij 
                           
                            
                           
                             
                               y 
                               ^ 
                             
                             i 
                           
                            
                           
                             
                               ∑ 
                               h 
                             
                              
                             
                               
                                 l 
                                 ih 
                               
                                
                               
                                 α 
                                 h 
                               
                             
                           
                         
                       
                     
                     - 
                     
                       2 
                        
                       
                           
                       
                        
                       β 
                        
                       
                           
                       
                        
                       
                         Σ 
                         k 
                       
                        
                       
                         w 
                         jk 
                       
                        
                       
                         
                           
                             ∂ 
                             2 
                           
                            
                           
                             p 
                              
                             
                               ( 
                               
                                 
                                   μ 
                                   j 
                                 
                                 , 
                                 
                                   μ 
                                   k 
                                 
                               
                               ) 
                             
                           
                         
                         
                           ∂ 
                           
                             μ 
                             j 
                             2 
                           
                         
                       
                     
                   
                 
                 . 
               
             
           
         
       
     
         [0043]    It is assumed that the prior P(  μ ) is convex and can be written as P(  μ )=Σ fk P(μ j , μ k ). Choosing α j =1 in the equation above gives the update step for the MLTR algorithm. 
         [0044]    The MLTR-algorithm is described in more detail in Nuyts J., Man B. De, Dupont P. et al.; “Iterative reconstruction for helical CT: A simulation study”, Physics in Medicine and Biology, 1998; 43(4): 729-737. A similar update step can be derived for different cost functions. 
         [0045]    Another approach is to construct a surrogate function of the cost function. In this situation the surrogate function is an approximation of the cost function that is mathematically easier to maximize. An example is Lange&#39;s ML convex algorithm (Lange K, Fessler J A., “Globally convergent algorithms for maximum a posteriori transmission tomography”, IEEE Transactions on Image Processing. 1995; 4(10):1430-1438.) 
         [0046]    By choosing α j =μ j ÷ε with ε&gt;0 in the update step above, an algorithm with characteristics from both the MLTR and Convex algorithm is obtained. 
         [0047]    The approaches mentioned above will update the entire volume in one step in one iteration. This general approach limits the convergence speed of the algorithm: generally the more voxels are updated in one iteration, the smaller the update steps can be. 
         [0048]    An alternative approach is to update only a subset of all voxels during one subiteration, with several subiterations for which all voxels are updates are considered one full iteration. This approach is a grouped coordinate ascent algorithm originally described by Fessler J. A. (see: Fessler, E. P. Ficaro, N. H. Clinthorne, and K. Lange, “Grouped-coordinate ascent algorithms for penalized-likelihood transmission image reconstruction.,”  IEEE Transactions on Medical Imaging , vol. 16, no. 2, pp. 166-175, April 1997). 
         [0049]    The grouped coordinate ascent algorithm essentially “splits” the volume in a plurality of subvolumes, the ‘groups’ in the algorithm, here referred to as patches. A patch, therefore, comprises a plurality of voxels and refers to a subvolume. The exact choice of these patches has a definite influence on the size of the update steps and is dependent on the geometry of the image acquisition. 
         [0050]    According to the invention the peculiar geometry of the tomosynthesis acquisition makes that one specific choice of groups/patches (the patches being parallel to the detector surface) are nearly optimal in a mathematical sense. Based on the specific segmentation or partialization of the volume it is possible to optimize the sequential updating strategy for tomosynthesis. 
         [0051]    For the tomosynthesis geometry one method of splitting the reconstruction volume is close to optimal with respect to the resulting update steps in the maximization of the cost function. This optimal choice is selecting each slice parallel to the detector as a single patch. The number of slices in a single patch is preconfigured and might be configurable before reconstruction. Thus, splitting refers to dividing the image into regions, called patches, the patches being updated separately and sequentially. According to an aspect of present invention a patch refers to one layer or plane within the volume. Generally, the following rule holds: the thinner the patches (less volume slices in one patch), the larger the step size can be, and the faster the convergence. Therefore, the slice-by-slice patches are close to optimal for this kind of approach. 
         [0052]    In iteration N of the volume, after the attenuation values of the voxels in a x th  patch P are updated to new values, these values are immediately applied to the full volume, so that this now consists of patches P that have been updates N−1 times, and patches P that have been updated N times. Iteration N+1 of the algorithm starts when each patch P has received its N th  update. 
         [0053]    Since each patch is now updated separately, it is much easier to apply different reconstruction models for each of the patches P. For example patch P k  may be reconstructed with other reconstruction model than patch P n . This is theoretically possible while updating the entire volume in one step, but this will results in a very complex and inefficient update step. Van Slambrouck (see: K. Van Slambrouck and J. Nuyts, “A patchwork (back)projector to accelerate artifact reduction in CT reconstruction,” in  IEEE Nuclear Science Symposium Conference Record,  2010, no. 60819) used the patches to introduce different (spectral) acquisition models in different parts of the reconstruction volume. 
         [0054]    In this case the specific choice of the patches as groups in the grouped coordinate ascent algorithm enables an efficient implementation of the acquisition model which takes into account the tube motion as a patch dependent model and will result in less blurring due to the motion of the x-ray tube in the final reconstructed image. 
         [0055]    In addition to allowing different acquisition models in different patches, the size of the update steps calculated for this specific choice of the patches as groups in the grouped coordinate ascent algorithm are mathematically close to maximal. Part of this increased convergence comes from the sequential updates but most of the increased convergence is due to an increased step size in the update. This can be seen by considering the update formula shown above (page 14). In this formula, a patch update can be considered as an update with α j =0 everywhere except in the current patch. 
         [0056]    Therefore the sum Σ h l th α h  in the denominator will be smaller and the step size for updates will be larger for smaller patches. Choosing patches as slices parallel to the detector will cause this sum to be as small as possible for as many of the detector positions i as possible. 
         [0057]    Given the fact that the proposed process or method does not require the entire reconstruction volume to be in memory, a significant advantage of present invention is therefore to be seen in that implementation of this method is possible on graphics processing unit (GPU), where memory is the main restraint. This also is a major advantage over present prior art systems. 
         [0058]    Given the fact that the basic concept of the present invention is based on providing patches parallel to the detector for the volume to be reconstructed the method may also be named patchwork reconstruction. Since using the patchwork reconstruction changes the denominator in the update formula substantially, using the same β value will result in a different amount of smoothing, when compared to a non-patched reconstruction. Therefore, β is adjusted so that resulting images look similar after a preselected or pre-configurable number of iterations. 
         [0059]    When using different acquisition models for the different patches, noise will be different for each patch, therefore β will need to be different for each patch so that the resulting noise will be the same in each patch. 
         [0060]    The number of iterations and prior function parameters could be computed or calculated, or adjusted respectively with an interactive adjustment, by an automatic adjustment or by calculating noise, which will be described below in more detail. In the following delta refers to a parameter in one embodiment of the prior where it defines the border between voxel variations which can be considered noise and voxel variations which describe real differences in attenuation. 
       Interactive Adjustment: 
       [0061]    The number of iterations could be preselected by a user (radiologist) on a training set of patient images such that all clinical significant features (micro-calcifications, lesions, Cooper&#39;s ligaments, etc.) are imaged with sufficient contrast. The parameters of the prior function, like beta, are then calculated such that at the faintest visible clinically significant edges and microcalcifications with gradient G are preserved. The gradient below the determined value G would be considered as noise and smoothed out. That gives the “upper limit” estimate for the delta which determines the gradient range on which the prior works. The prior function parameters delta and the strength of the prior β could be adjusted to the preferences of the user in a second, interactive step. Such a method allows a better prediction at early iterations without requiring the full convergence. 
       Automatic Adjustment: 
       [0062]    According to another aspect for adjusting the parameters the prior function parameters are adjusted by maximizing the contrast and edge sharpness in a set of reconstructed clinical features such as micro-calcifications masses and mass speculations. A reference reconstruction method (for example filtered backprojection or an iterative reconstruction method with a large number of iterations to ensure visualization of all clinically relevant feature) is used to reconstruct a set of patient images. A user could manually outline or segment clinically significant features in each reconstructed patient image. The number of iterations is then chosen such that the contrast of the faintest clinical features is sufficiently high for human observer (reference values could be obtained by experiments with phantoms in experiments) or such that the change of clinical feature contrast in each subsequent iteration is lower than a predefined threshold. Then the “upper limit” estimate for the delta and beta is computed such that the faintest edges in the training set of manually outlined clinical features are preserved. An interactive final step could be used for the fine adjustment of prior function parameters to the preferences of the user. 
       Noise Calculation: 
       [0063]    In a further alternative embodiment it is possible to calculate noise at each iteration in function of beta and delta, by using the method described by Qi (J. Qi, “A unified noise analysis for iterative image estimation.,”  Physics in Medicine and Biology , vol. 48, no. 21, pp. 3505-19, November 2003.). 
         [0064]    This formula can then be reversed to determine the required beta and delta to attain the desired noise level in the reconstruction. 
         [0065]    Generally, the patchwork algorithm tends to accumulate all low frequency information in the first patch P 1 . To ensure that low frequency information will be uniformly distributed over all patches P, the volume is initialized with an estimate of the mean attenuation and weighted updates are used during the first few iterations. 
         [0066]    For example: The updates are weighted by 1/N with N the remaining number of patches P including the current one. Thus, the first update in a case with 10 patches P will have a weight of 1/10, the second update has a weight of 1/9 down to the last update with a weight of 1. In addition, in iteration  2  the patches P are updated from plane (patch) N down to plane  1 , while in all other iterations, the updates go up from plane  1  to plane N. Using two iterations with weighted updates provides some robustness against suboptimal initializations and is probably necessary when initializing clinical images with a constant attenuation. 
         [0067]    According to another embodiment of present invention a backprojection or a filtered backprojection (FBP) is used as initialization. The weighted updates might or might not be used in this case. 
         [0068]    According to a preferred embodiment of present invention reconstructing comprises displaying the reconstructed 3-dimensional image. Obviously, the reconstructed image may be transferred to other computational processing units or workstations in order to be processed or displayed. Preferably the reconstructed image will be stored in a memory or buffer. 
         [0069]    Another solution of the above-mentioned object is to be seen in a system according to the claims. The system or reconstructor preferably is part of an embedded system, which could be implemented as a hardware unit, for example in an embedded processor or in a microprocessing unit. This processing unit may be part of the graphics processing unit and preferably consists of a receiver, a model generator, a reconstructor, a storage unit (and an assembler). Other embodiments of the for inputting and outputting image data. 
         [0070]    Another solution is to be seen in a computer program product. The product is loaded or may be loaded into a memory or into the graphics processing unit of a computer, with computer readable instructions for execution of a method mentioned above, if the instructions are executed on the computer or directly in the graphics processing unit. Another solution relates to the computer program. The computer program may be stored on a storage medium or may be transferred over a network, such as the internet or other wide or local area networks. 
         [0071]    The present invention generally leads to a number of major advantages over prior art systems. Results show, that the convergence speed is faster. Further, memory requirements are lower compared to prior art systems. Moreover, efficient noise control is possible, while boundaries and edges are preserved. 
         [0072]    In the following the invention is described with respect to the Figures, showing exemplary embodiments of present invention. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0073]    The invention will be more fully understood from the following detailed description taken in conjunction with the accompanying drawings: 
           [0074]      FIG. 1  a schematic overview of our tomosynthesis reconstruction of a medical volume to be displayed on a monitor. 
           [0075]      FIG. 2  a schematic overview of components of a reconstruction system according to the invention. 
           [0076]      FIG. 3  a workflow for a reconstruction process of present invention according to a preferred embodiment of the same and 
           [0077]      FIG. 4  a schematic overview of a graphics processing unit with an embedded system according to an embodiment of present invention. 
       
    
    
     DETAILED DESCRIPTION OF THE INVENTION 
       [0078]      FIG. 1  illustrates a radiographic imaging system in accordance with some embodiments of present invention. The system comprises an x-ray source arrangement. This x-ray source arrangement may itself comprise a plurality of x-ray tubes  100  which are adapted to emit x-ray radiation. Further, the system comprises an x-ray detector  101 , which may be implemented as a digital flat panel detector. The medical volume to be reconstructed is depicted in  FIG. 1  as a schematic representation, shown as an oval. During computed tomography the x-ray source or tube generates and directs an x-ray beam towards the patient, while the detector measures the x-ray absorbtion at a plurality of transmission paths defined by the x-ray beam during the acquisition process. The detector  101  produces a voltage proportional to the intensity of incident x-rays. The voltage is read and digitized for subsequent processing in a computer  200 . During image acquisition huge amounts of data are thus accumulated. For the purpose of image reconstruction the accumulated data are later on analyzed and processed for image reconstruction. 
         [0079]    According to one aspect of present invention the volume to be reconstructed is divided or split into a plurality of patches or slices, which in  FIG. 1  are referenced by the reference numeral P. The patches P are parallel to a surface of the detector  101 . 
         [0080]    In the algorithm to maximize the cost function (the reconstruction algorithm), within one iteration of this algorithm, the calculated update step for each patch P of the plurality of patches is applied to the patch before calculating the update step for the next patch. All the patches P of the plurality of patches are thus updated separately and sequentially within each iteration of the reconstruction algorithm. The reconstruction process is executed by performing a plurality of different algorithms, which may be implemented in software and/or in hardware by means of a system S. The system S may be implemented on a microprocessor unit, for example in the graphics processing unit GPU of the computer  200 . After having reconstructed all patches P of the volume a 3-dimensional image of the volume to be reconstructed may be calculated and displayed on a monitor  900 . 
         [0081]    According to the invention a more accurate model of the acquisition process is included in the cost function, for example the likelihood for a maximum-likelihood for transmission (MLTR) algorithm. A possible embodiment of this more accurate model takes into account that the x-ray tube  100  is moving during the x-ray exposure. The convergence speed of the algorithm used for reconstruction is accelerated by applying a grouped coordinate ascent (GCA) algorithm. The groups in the grouped coordinate ascent algorithm are defined by the patches P in which the volume to be reconstructed has been split. These patches (or groups of Voxels) are updated sequentially (instead of simultaneously as known from state of the art algorithms). 
         [0082]      FIG. 2  shows a microprocessor implementation of the reconstruction algorithm by means of a system S in a schematic overview. The image acquisition system is depicted in inner rectangle shown the upper right-hand side of  FIG. 2 , comprising x-ray tube  100  and x-ray-detector  101 . The acquisition system is in data exchange with the computer  200 , used for image reconstruction. The computek  200  communicates with the monitor  900 , in order to display the reconstructed 3-dimensional image. The computer  200  may also communicate with a printer  910 , a further workstation  920  and a separate memory unit  220 . The image acquisition system is in data exchange with a controller  800  or a controlling unit  800 . The controller  800  itself comprises a source/tube controller  801 , a detector controller  802  and an acquisition controller  803 . 
         [0083]    For a person skilled in the art the image acquisition system may comprise further models or elements, like a collimator, which may configure or define the size and shape of the x-ray beam that emerges from the x-ray tube  100 . 
         [0084]    The models or instances of the reconstruction system S, mentioned above with respect to the description of the embodiment, depicted in  FIG. 2  may communicate over a protocol or a bus system of a signal processing circuitry, which typically is based on a general purpose or an application specific digital computer. The computer may execute routines and instructions, mentioned with respect of the reconstruction process of present invention. The source controller  801  may be adapted to position the x-ray source  100  relative to a patient or a patient&#39;s body part and/or relative to the detector  101 . The detector controller  802  is adapted to control the detection process of the signals received by the detector unit  101 . The detector controller  802  may execute various signal processing and filtration functions, for example initial adjustments of dynamic ranges of detection parameters or for interleaving of digital image data etc. 
         [0085]    Typically, the controller  800  is coupled to the computer  200  (not shown in  FIG. 2 ). The acquisition controller  803  usually comprises a converter, in order to receive and sample analogue signals, detected from the detector and converse the data to digital signals for subsequent processing by the computer  200  (particularly for the reconstruction process). The data, being collected during x-ray exposure may be transmitted to the computer  200  and forwarded to memory  220 . Alternatively, memory  220  may also be directly implemented on the computer  200 . 
         [0086]    The monitor  900  or display unit  900  is also coupled to the computer  200  and is adapted to display the reconstructed 3-dimensional image and to control the displaying process. In this respect it should be noted that the computer  200  may also be coupled to other devices or processing circuitries. 
         [0087]    With respect to  FIG. 4  a more detailed explanation of the reconstruction system S is given, which is implemented on the graphics processing unit GPU. 
         [0088]    The system S comprises:
       a receiver  20 ,   a model generator  21 ,   a reconstuctor  22 ,   a storage unit  23 .       
 
         [0093]    According to a preferred embodiment the graphics processing unit GPU may also consist of a compressor  30 , of a rendering unit  32  and/or of a control unit  33 . 
         [0094]    The receiver  20  of the system S is adapted for receiving digital signals of the tomosynthesis image system, wherein x-ray radiation is sent by an x-ray source  100  to be received at a detector  101  and which is attenuated by structures of the 3-dimensional volume (patient body part). As already mentioned above, the receiver  200  may also comprise a converter and additional components (e.g. filter components). 
         [0095]    The model generator  21  is adapted to provide the modified model for image acquisition, wherein the modified model is based on a physical movement of the x-ray source  100  during x-ray exposure. In contrast to this, state of the art systems are based on the fact that the x-ray tube is stationary during each detector exposure and then moves to the next acquisition angle. 
         [0096]    The reconstructor  22  is adapted to perform the algorithm workflow shown in  FIG. 3  and explained below and in the description (summary) of the invention. Particularly, it is adapted for iteratively performing an update step for predetermined number of iterations or until convergence is reached. 
         [0097]    The storage unit  23  is adapted for storing a data set. The data set may represent a patch P to be reconstructed and may additionally be adapted to also store the reconstructed patch after application of the reconstruction algorithms. The reconstructed patch is generated by reconstructor  22 . 
         [0098]      FIG. 3  shows a typical workflow for image reconstruction according to a preferred embodiment of the present invention is shown and explained in more detail below. 
         [0099]    Step A: Input of acquired data and all acquisition parameters (compressed breast thickness, tube current, exposure time, or other parameters) 
         [0100]    Step B: Initialization of the reconstruction volume. For example: volume with homogeneous attenuation, backprojection of the acquired data, a scaled filtered backprojection of the acquired date or another initialization. 
         [0101]    Step C: Start the algorithm with iteration  1 . 
         [0102]    Step D: Loop of the iterations, stop when a stop condition has been met, for example after a fixed number of iterations is reached or when a certain noise level is reached in the reconstructed volume. 
         [0103]    Step E: Determine the order in which the patches will be updated in this iteration. For example: from top to bottom in the 2 nd  iteration, from bottom to top in other iterations. 
         [0104]    Step F: Execute the following steps once for each patch. 
         [0105]    Step G: Calculate the update step for the current patch. The calculation of this update step can depend on, among other factors:
       The data acquisition model that is used to create the cost function. The parameters of this model are read in step A. The model and/or parameters can be different for each patch.   The algorithm that is used to maximize the cost function. For example: gradient ascent algorithm   The selected prior function, prior function parameters and prior function weight β       
 
         [0109]    Step H: Determine the fraction of the update step that is applied to the patch in this instance refers to the fact that additional weights are applied in the first few iterations to properly distribute low frequency information in the direction perpendicular to the detector surface. For example weight 1/(P+1−p) in iterations 1 and 2. 
         [0110]    Step I: Update the current patch in the reconstruction volume 
         [0111]    Step J: Go to the next patch in the order that was determined in step E. 
         [0112]    Step K: Calculate the stopping criterion of the algorithm, for example the current iteration number, or the current noise level in the reconstruction so that it can be tested in step D 
         [0113]    Step L: End of the algorithm. The current volume is considered the result of the reconstruction algorithm. 
         [0114]    Generally, the system S is adapted to execute the patchwork reconstruction algorithm as described above. The patchwork reconstruction is based on patches/groups/planes, wherein each patch is parallel to the detector surface. The patchwork reconstruction algorithm is iterative. Generally, the scope of the invention is not limited by a specific ordering (including an ordering of the method steps). 
         [0115]    Generally, the reconstruction suggested in this application is characterized by an adapted optimization strategy (in sequential updating) and by a more precise acquisition model that is included in the cost function. The optimization algorithm might be a gradient ascent algorithm, ML convex algorithm or MLTR algorithm. 
         [0116]    While the techniques for reconstruction have been discussed in the context of mammography, other fields of medical imaging may also be relevant, like bone or heart examinations. Indeed, the described reconstruction process may be applicable in any situation where the goal is to reconstruct 3-dimensional image information from projection data. 
         [0117]    The invention may be susceptible to various modifications and alternative embodiments. Specific embodiments have been shown by way of example in the above detailed description of the drawings. However, it should be understood that the invention is not intended to be limited to these particular forms disclosed herein. Rather, the invention is to cover all modifications, equivalents and alternatives falling within the spirit and scope of the invention as defined by the following appended claims. 
         [0118]    The following is a list of reference numerals and symbols used in the specification above:
         100  x-ray source     101  detector     200  computer     220  memory     800  controller     801  source controller     802  detector controller     803  acquisition controller     900  monitor     910  printer     920  workstation   S reconstructor     20  receiver     21  model generator     22  reconstructor     23  storage unit     30  co-processor     32  rendering unit     33  control unit   GPU graphics processing unit   P patch   A data acquisition   B initial guess for reconstruction volume   C set iteration nr=1   D last iteration finished?   E Determine the order in which the patches will be updated in this iteration (set patch nr=1 if it=/=2, if it=2, set patch nr to last patch   F all patches finished?   G calculate update for current patch   H weight for update step if iteration nr&lt;x.   I update current guess for reconstruction volume   J Go to the next patch in the order that was determined in step E (patch nr+=1 for it=/=2, patch nr−=1 for it=2)   K create stop criterion iteration nr+=1   L current reconstruction volume is the result