Abstract:
Several methods for retrospective correction of intensity inhomogeneities in digital diagnostic radiation images are presented. The methods are based on the correction of a digital image representation by means of a bias field. The bias field is deduced from the digital image representation of the diagnostic radiation image.

Description:
FIELD OF THE INVENTION  
       [0001]     The present invention relates to a method for correcting inhomogeneities in a digital radiation image which are inherent to the use of a radiation source, a radiation detector or a radiation image read-out apparatus or the like.  
       BACKGROUND OF THE INVENTION  
       [0002]     Digital radiography offers the possibility for computer aided diagnosis and quantitative analysis using image processing techniques such as segmentation, classification and contrast enhancement. However, computer-based image interpretation may be hindered by the presence of the non-uniformities in radiation exposure that are inherent to the image formation.  
         [0003]     In the field of X-ray exposure these non-uniformities can be largely attributed to the Heel effect, nevertheless other sources of inhomogeneities exist such as recording member non-uniformities or read-out inhomogeneities.  
         [0004]     Although the intensity inhomogeneities induced by all these factors are smoothly varying as a function of location and are easily corrected by the human visual perception system, they complicate the use of automatic processing techniques because the relative brightness of an object within the image becomes position dependent. The overall intensity range is unnecessarily enlarged by the presence of these slowly varying shading components and hence the dynamic range available to represent diagnostic signal details is reduced.  
         [0005]     A typical hand radiograph is shown in  FIG. 1 . The background at the left side of the image is clearly brighter than at the right side. This phenomenon can be attributed to the so-called Heel effect. Because beam collimator blades substantially attenuate the X-ray beam so as to shield irrelevant body parts, the phenomenon is only visible in the direct exposure and diagnostic areas and not in the collimation area. The Heel effect can be understood from the construction of the X-ray tube as schematically depicted in  FIG. 2 . Electrons originating from the cathode are attracted by the positively charged anode. For better heat dissipation, the anode rotates and is inclined by a small anode angle θ, which enlarges the area A actual  that is bombarded by electrons while keeping the size of the focal A eff , from, which rays are projected downward to the object, fairly small. As shown in the diagram of  FIG. 3 , this design makes the length of the path travelled by the X-rays through the anode larger on the anode side of the field T a  than on the cathode side T c . Hence the incident X-ray intensity is smaller at the anode side than at the cathode side of the recording device, which explains the inhomogeneity of the background in  FIG. 1 .  
         [0006]     The Heel effect is one possible cause of Intensity inhomogeneities that can be introduced in radiographs. As has already been mentioned higher, other causes of non-uniformities might be envisioned such as non-uniform sensitivity of the recording member, e.g. a photographic film, a photostimulable phosphor screen, a needle phosphor screen a direct radiography detector or the like. Still another cause might be non-uniformities of the read-out system which is used for reading an image that has been stored in a recording member of the kind described above.  
         [0007]     Because the image acquisition parameters that affect intensity inhomogeneity vary from image to image (e.g. variable positioning of the recording device relative to the X-ray source) and can not be recovered from the acquired image at read-out, correction methods based on calibration images or flat field exposure such as the one described in EP-A-823 691 are not feasible.  
         [0008]     The method disclosed in EP-A-823 691 comprises the steps of (1) exposing an object to radiation emitted by a source of radiation, (2) recording a radiation image of said object, on a radiation-sensitive recording member, (3) reading the image that has been stored in said recording member and converting the read image into a digital image representation, (4) generating a set of correction data and (5) correcting said digital image representation by means of said set of correction data. The set of correction data is deduced from data corresponding with a uniform, flat field exposure of the recording member. The set of correction values represent the deviation of the value that is effectively obtained in a pixel of the recording member and a value that would be expected in the case of flat field exposure. These correction values associated with each recording member are normally determined once and kept fixed during further acquisition cycles.  
         [0009]     This type of methods is not applicable for solving problems such as the introduction of inhomogeneities due to the Heel effect.  
       OBJECTS OF THE INVENTION  
       [0010]     It is an object of the present invention to provide a method to correct a digital image for artifacts such as artifacts which are inherent no the use of an X-ray tube, artifacts originating from defects in a radiation detector or the like.  
         [0011]     Further objects will become apparent from the description hereafter.  
       SUMMARY OF THE INVENTION  
       [0012]     The above mentioned objects are realised by a method having the specific features set out in claim  1 .  
         [0013]     Unlike the state of the art methods, in the present invention a set or correction data is deduced from the actual image data obtained by exposing an object to radiation and not from an additional image such as an image representing a flat field exposure.  
         [0014]     A radiation image most generally comprises a Collimation area which is an area that has been shielded from exposure to radiation by shielding elements, a direct exposure area (also called background area) being the area on the recording member that has been exposed to direct, unmodulated irradiation and a diagnostic area which is the area where the radiation image is found of the body that was exposed to radiation.  
         [0015]     Because of substantial attenuation of the X-ray beam when passing through the collimator blades, the dynamic range of the irradiation has been reduced to an extent so as to make these collimation areas unsuitable for estimation of the correction values.  
         [0016]     Because the causes that introduce inhomogeneities are not present in the collimation area the collimation area can be neglected in the method of the present invention. A segmentation algorithm can be used to find the boundaries of the collimation area to exclude these areas from further consideration. An example of such an algorithm has been described in European patent applications EP-A-610 605 and EP-A-742 536 (for the case of a partitioned image), these documents are incorporated by reference.  
       First Embodiment  
       [0017]     In one embodiment (1) a mathematical model representing the phenomenon that induces the inhomogeneities is generated. Next (2) the digital image representation is subjected to image segmentation in order to extract data representing an estimation of the direct exposure area. Then, (3) parameters of this model are deduced from image data representing the direct exposure area in the image. Next (4) bias field is generated on the basis of the deduced parameters. Next, (5) a correction by means of said bias field is applied to the image data. Corrected image data are then subjected to a stopping criterion. Unless this stopping criterion is met, steps (2) to (6) are repeated.  
         [0018]     Because the inhomogeneities are only directly measurable in the directs exposure areas or the image, this area is preferably first extracted and the parameters of the model are estimated from the data regarding this region only. A seed fill algorithm can be used to determine the background area. The seed fill algorithm can be started front the boundary of the collimation area.  
         [0019]     Inhomogeneity correction by applying a bias field is performed on the entire image. In the context of the present invention the term ‘a bias field’ is used to denote a low frequency pattern that is superimposed on the average image data values in a multiplicative or additive manner.  
         [0020]     Next a new background region is extracted from the corrected image data and the model parameters are re-estimated. This sequence is repeated. The method iterates between background segmentation and correction until convergence, i.e. until no significant changes in background or parameter estimation occur.  
       Second Embodiment  
       [0021]     In a second embodiment according to the present invention a statistical model of the image is first generated on the basis or intensity and spatial statistics of image regions in the image.  
         [0022]     The digital image representation is then subjected to image segmentation in order to extract data, constituting, an estimation of these image regions. The image regions referred to are e.g. direct exposure area, bone image, soft tissue image etc.  
         [0023]     Parameters of the statistical mode are estimated by means of data pertaining to these image regions. Next, a bias field comprising correction data is generated and the entire image, is corrected by means of the bias field. The result of the previous step is evaluated relative to a stopping criterion. The method steps of segmenting, bias field correction and evaluation are repeated until the stopping criterion is met. The stopping criterion is e.g. reached when no significant changes occur in the estimation of the image regions and/or no significant changes occur in the parameters defining the statistical model.  
         [0024]     In one embodiment the image regions are confined to direct exposure areas. In another embodiment (see fourth embodiment) the method steps are applied separately to each of a number of image region classes jointly constituting the intensity histogram of the radiation image.  
         [0025]     In one embodiment the statistical model is a Gaussian distribution and the parameters of the statistical model are the statistical parameters defining the statistical model such as average value μ of the Gaussian distribution and the standard deviation σ.  
         [0026]     The stopping criterion is e.g. reached when no significant changes occur in the estimation of image regions and/or no significant changes occur in the parameters defining the statistical model.  
       Third Embodiment  
       [0027]     A third embodiment is based on the observation that the entropy of an image increases if inhomogeneities are induced in the image.  
         [0028]     In a third embodiment of the method of the present invention an information theoretic model of the image comprising a least direct exposure areas and diagnostic areas is generated. The model is based on Shannon-Wiener entropy increasing when additional intensity value entries are added to the image intensity distribution. The digital image representation is subjected to image segmentation in order to extract data representing an estimation of the direct exposure areas and the entropy in said models extracted based on of data pertaining to these areas. Next, a bias field is generated and the entire image is corrected by means of the bias field. The result of the previous step is evaluated relative to a stopping criterion and the method is repeated until said stopping criterion is met. A stopping criterion is e.g. met when the entropy is minimal and no significant changes occur in it.  
       Fourth Embodiment  
       [0029]     The fourth embodiment is a more general case of the second embodiment in this fourth embodiment the method steps of the second embodiment are applied separately to each of a number of image region classes jointly constituting the intensity histogram of the radiation image.  
         [0030]     In all of the aforementioned embodiments, the number of iterations may be restricted to one when less precision is needed and hence the stopping criterion need not be evaluated.  
         [0031]     Further advantages and embodiments of the present invention will be one apparent from the following description [and drawings]. 
     
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0032]      FIG. 1  shows a typical radiographic image of a hand in which the Heel effect is clearly visible on the direct exposure area,  
         [0033]      FIGS. 2 and 3  are schematic side views of an X-ray tube,  
         [0034]      FIG. 4  is a coordinate system, wherein an X-ray originates at position (0,0) and travels along R to the recording medium at position (p, D is ). 
     
    
     DETAILED DESCRIPTION OF THE INVENTION  
     First Embodiment  
       [0035]     A mathematical model for the Heel effect can be derived from the simplified one-dimensional model of the anode and bean geometry depicted in  FIG. 4 . In the coordinate system (p,z), with p along the anode-cathode axis and z along the vertical direction, the X-rays can be taught off to originate within the anode at point ω(0,0), at a distance D ave  from the anode surface S. Consider the ray R at an angle φ from the vertical within the plane (ω,S) that hits the recording device at point (p,D is ) with D is  the distance between the X-ray source and the recording device and  
         tan   ⁢           ⁢   ϕ     =       p     D   is       .         
 
 The distance r traveled by R through the anode is given by 
 
 r =|ξ−ω|=√{square root over ( p   R   2   +z   R   2 )}  (1) 
 
         [0036]     with ξ(p R ,z R ) the intersection of R with S which can be found by solving the system of equations: 
 
 S:p   R   =D   ave −tan δ, z   R   (2) 
 
 R:p   R =tan φ, z   R  
 
         [0037]     Hence,  
               r   ⁡     (   p   )       =         D   ave     ⁢       cos   ⁢           ⁢   θ       sin   ⁡     (     ϕ   +   θ     )           =       D   ave     ⁢         1   +       (     p     D   is       )     2             tan   ⁢           ⁢   θ     +     p     D   is                       (   3   )             
 
         [0038]     The radiation received on the recording device is 
 
 M ( p )= I   o   ,e   −μ,r(p)   (4) 
 
         [0039]     with μ the attenuation coefficient of the anode material and I o  the radiation originating at ω.  
         [0040]     Model (4) predicts that the Heel effect behaves exponentially along the anode-cathode axis and assumes that it is constant perpendicular to this axis. This is justified by flat filed exposure experiments which show that the difference in intensity perpendicular to the anode-cathode axis is relatively small compared to the intensity differences along the anode-cathode axis.  
         [0000]     Image Segmentation:  
         [0041]     A typical hand radiograph, as shown in  FIG. 1 , consists of three regions: collimation area (numeral 1), direct exposure area (numeral 2) and diagnostic regions (numeral 3). Because the Heel effect is largely reduced in the collimation area and directly measurable in the direct exposure area only, the image needs to be segmented to fit model (4) to the image intensity data. This is obtained by first extracting the collimation area and then searching the direct exposure area, the remaining areas being diagnostic regions.  
         [0042]     The boundaries of the collimation area have been round using the Hough transform assuming that these are rectilinear edges as is the case for the majority of X-ray source-mounted collimation devices. To make this approach more robust, the contributions of each image point to the Hough space accumulator are weighted by said point&#39;s gradient magnitude and, for each point, only lines the direction of which is within 10 degrees from the normal the local gradient direction are considered. The 4 most salient points in Hough space that represent a quadracon with inner angles between 80 and 100 degrees are selected as candidate boundaries of the collimation area. Because not all 4 collimation shutter blades leave an imprint in the image and hence make the associated boundaries disappear in the image, candidate boundaries along which the image intensity differs from the intensity expected for the collimation region are rejected.  
         [0043]     To extract the background region B, a seed fill algorithm has been used that starts from the boundary of the collimation region as determined in the previous step. Appropriate seed points for B are found by considering a small band along each of the collimator edges and retaining all pixels whose intensity is smaller than the mean of the band. This approach avoids choosing pixels that belong to the diagnostic region as candidate seed pixels. B is then grown by considering all neighboring pixels n i , i=1, . . . , 8 of each pixel p∈B and adding q i  to B if the intensity difference between p and q i  is smaller than some specified threshold.  
         [0000]     Heel Effect Estimation:  
         [0044]     To fit the model (4) to the image data N (x,y) the direction γ has to be found of the anode-cathode axis and the parameters α=[I 0 ,μ,6,D is ,D ave ,p ω ] such that the model best fits the image data within the direct exposure area extracted thus far. p ω  is a parameter introduced to map point ω where the X-ray originates to the correct image coordinates (see  FIG. 4 ). For the case whereby the Heel effect is modulated as a one-dimensional phenomenon, the distance p ω  and the angle γ are the required parameters to map the coordinate system attached to the X-ray origin, ω to the image plane coordinate system, However, because the anode has the three-dimensional shape of a cone, the Heel effect is a three dimensional phenomenon, in that at the intensity also slightly is reduced in a direction perpendicular to the (p,z) plane. To model the two-dimensional Heel effect in the image plane, a third geometry parameter p ω1  is needed. Parameters (p ω ,p ω1 ,γ) jointly define a coordinate system translation and rotation from the X-ray origin ω to an image plane origin, which is the center of the image e.g. in practice the Heel effect inhomogeneity in, said perpendicular direction is only small with respect to the Heel effect along the anode-cathode axis.  
         [0045]     Assuming that γ is known, the average image profile P γ (p) along this direction in the direct exposure region B is given by 
 
 P   γ ( p )=[ N ( x,y )] (x,y)∈B|x,cos γ+y.sin γ=p  
 
         [0046]     with x and y the image coordinates as defined in  FIG. 3  and [.] the averaging operator. We can then find the optimal model parameters α* by fitting the expected profile M (p,α) to the measured profile.  
                 α   *     ⁡     (   γ   )       =     arg   ⁢           ⁢       min   α     ⁢              P   γ     ⁡     (   p   )       -     M   ⁡     (     p   ,   α     )                          (   5   )             
 
         [0047]     The fitted one-dimensional model M(p,α*(γ)) is then back projected perpendicular to the projection axis γ to obtain a reconstruction R(x,y,γ,α*(γ)) for the whole image: 
 
 R ( x,y,γ,α* (γ))= M ( x. cos γ+ y .sin γ,α*(γ)) 
 
         [0048]     The direction of the anode-cathode axis γ is then determined such that this reconstruction best fits the actual image data within the direct exposure region using  
                 γ   *     =         arg   ⁢           ⁢   min     γ     ⁢              N   ⁡     (     x   ,   y     )       -     R   ⁡     (     x   ,   y   ,   γ   ,       α   *     ⁡     (   γ   )         )                  (     x   ,   y     )     ∈   B           ⁢     
     ⁢   or           (   6   )                 γ   *     =         arg   ⁢           ⁢   min     γ     ⁢                N   ⁡     (     x   ,   y     )         R   ⁡     (     x   ,   y   ,   γ   ,       α   *     ⁡     (   γ   )         )         -   1              (     x   ,   y     )     ∈   B                 (   7   )             
 
         [0049]     depending on whether we wish to use additive or multiplicative correction. The estimated Heel effect is R(x,y,γ*,α*(γ*)) and the corrected image is respectively  
                   N   ^     ⁡     (     x   ,   y     )       =       N   ⁡     (     x   ,   y     )       -     R   ⁡     (     x   ,   y   ,     γ   *     ,       α   *     ⁡     (     γ   *     )         )           ⁢     
     ⁢   or           (   8   )                   N   ^     ⁡     (     x   ,   y     )       =         N   ⁡     (     x   ,   y     )         R   ⁡     (     x   ,   y   ,     γ   *     ,       α   *     ⁡     (     γ   *     )         )         .             (   9   )             
 
         [0050]     The optimal parameters α* and γ* are found by multidimensional downhill simplex search. It has been noticed that the anode-cathode axis in, our setup is almost always parallel to the image or collimation edges, This reduces the number of orientations which have to be evaluated in (6-7) and reduces computation time.  
         [0051]     After inhomogeneity correction of the image using (8-9), the direct exposure area B is up-dated by thresholding, using a threshold derived from the histogram of the corrected image intensities {circumflex over (N)}. Keeping the previously determined anode-cathode orientation γ, new values for the optimal model parameters α* are determined using (5) taking the newly selected direct exposure region into account. A number of iterations, typically three or four, have been performed between background segmentation and Heel effect correction until convergence.  
       Second and Third Embodiment  
       [0000]     Image Formation:  
         [0052]     In ideal circumstances, the image formation process or diagnostic digital X-ray images is usually well described by a multiplicative model yielding an intensity-uniform image U(x,y): 
 
 U ( x,y )= I.O ( x,y ) 
 
         [0053]     where O(x,y) represents the object in the image. In diagnostic X-ray images, the most important contributing process of the object is the linear attenuation of the X-rays by the bone and soft tissue 
 
 O ( x,y )= e    −∫     o     ζμ(r)dr  
 
         [0054]     μ is the linear attenuation coefficient along the path between the origination X-ray at position ω and the recording device ζ. However, nonuniform illumination I=I(x,y), uneven sensitivity of the recording device and inhomogeneous sensitivity of the phosphors for readout, introduce unwanted intensity modulations in the acquired image N(x,y) described by function ƒ
 
 N ( x,y )=ƒ x,y,U ( U ( x,y ))  (10) 
 
         [0055]     In the second and third embodiment the Heel effect is again, examined as a very important source of nonuniform illumination. Reference is made to  FIGS. 2-4  which aid in explaining this effect.  
         [0056]     Electrons originating from the cathode are attracted by the positively charged anode. For better heat dissipation, the anode rotates and is inclined by a small anode angle δ, which enlarges their area A actual  that is bombarded by electrons while keeping the size of the focal spot A eff , from which rays are projected downward to the object, fairly small. As shown in the  FIG. 3 , the design makes the length of the path travelled by the X-rays through the anode larger on the anode side of the field (T a ) than on the cathode side (T c ). Hence the incident X-ray intensity is smaller at the anode side of the recording device. A simple theoretical model is given by  
                 I   ⁡     (     x   ,   y     )       -     I   o       ⁣     ⅇ       -   μ     ⁢           ⁢     D   ave     ⁢         1   +       (     p     D   is       )     2             tan   ⁢           ⁢   θ     +     p     D   is                       (   11   )             
 
         [0057]     with I o  the radiation originating at ω,μ the linear attenuation coefficient of the anode, D ave  the average distance traveled through the anode by the electrons, D is  the distance between the X-ray source and the recording device and p the distance from the recording device to X-ray source projected onto the anode-cathode axis.  
         [0058]     Although the second and third embodiment are explained with reference to the Heel effect, other source of inhomogeneities may be envisaged such as the molding process of imaging plates and/or the characteristics of the read-out system. In some fabrication processes, the concentration of phosphors at the edge of the plate is lower than the concentration in the middle of the plate which may result in a non-uniform image. In read-out apparatuses comprising mirror deflection, the displacements of the mirror has to be very accurately implemented to achieve uniform activation of the phosphors for read-out. Due to all these factors it is almost impossible to model the induced inhomogeneities correctly and more general image formation models are needed.  
         [0000]     Problem Formulation:  
         [0059]     The image formulation process is generally modeled with a function ƒ applied to an ideal intensity-uniform image U(x,y), resulting in the acquired image N(x,y). In digital X-ray images, the image degradation process dependency on the intensity values U(x,y) is relatively small compared to position dependent factors. Hence, we can rewrite equation (10) as follows 
 
 N ( x,y )=ƒ x,y ( U ( x,y )) 
 
         [0060]     This equation can be simplified as 
 
 N ( x,y )= U ( x,y ) S   M ( x,y )+ S   A ( x,y ) 
 
         [0061]     where S M (x,y) and S A (x,y) represent the multiplicative and additive components of the image degradation process. To remove the image inhomogeneities, a corrected image Û is searched which optimally estimates the true image U. If the estimates Ŝ A  and Ŝ M  of the actual formation components S A  and S M  are available, the corrected image Û is given by the inverse of the image formation model.  
                 U   ^     ⁡     (     x   ,   y     )       =         N   ⁡     (     x   ,   y     )       -         S   ^     A     ⁡     (     x   ,   y     )               S   ^     M     ⁡     (     x   ,   y     )                     =         N   ⁡     (     x   ,   y     )       ⁢         S   ~     M     ⁡     (     x   ,   y     )         -         S   ~     A     ⁡     (     x   ,   y     )                   
 
         [0062]     with  
             S   ~     M     ⁡     (     x   ,   y     )       =         1         S   ^     M     ⁡     (     x   ,   y     )         ⁢           ⁢   and   ⁢           ⁢         S   ~     A     ⁡     (     x   ,   y     )         =             S   ^     A     ⁡     (     x   ,   y     )             S   ^     M     ⁡     (     x   ,   y     )         .           
 
 The problem of correcting the inhomogeneities is thus reformulated as the problem of estimating the additive and multiplicative components {tilde over (S)} A  and {tilde over (S)} M . 
 
 Correction Strategy: 
 
         [0063]     Finding the optimal parameters of the components {tilde over (S)} A  and {tilde over (S)} M  involves defining a criterion which has to be optimized. In this section, two criterions are defined.  
         [0064]     One correction strategy (second embodiment of the method according to the present invention) is based on the assumption that the intensity values of the direct exposure area (also referred to as background) from the acquired image is Gaussian distributed. In ideal circumstances, this assumption is true for the acquired image N(x,y). The likelihood that a pixel μ i  of the corrected image belongs to the background is  
               p   ⁡     (         u   i     |   μ     ,   σ     )       =       1       2   ⁢     πσ   2           ⁢     exp   ⁡     (       -     1   2       ⁢         (       u   i     -   μ     )     2       σ   2         )                 (   12   )             
 
         [0065]     where μ and σ 2  are the true mean and variance of the Gaussian distribution of the background pixels. Given an estimate {circumflex over (B)} of the direct exposure area, we seek to maximize the likelihood π i∈{circumflex over (B)} p(u i |μ,σ), which is equivalent to minimizing the log-likelihood  
                 U   ^     *     =     arg   ⁢           ⁢       min       B   ^     ,     U   ^         ⁢       -     Σ     i   ∈     B   ^           ⁢     log   e     ⁢       p   ⁡     (         u   i     |   μ     ,   σ     )       .                   (   13   )             
 
         [0066]     Another embodiment (third embodiment of the method of the present invention) is based on the assumption that the information content of the acquired image is higher than the information content of the uniform image, due to the added complexity of the imposed inhomogeneities: 
 
 I   c ( N ( x,y ))= I   c (ƒ x,y   U ( x,y )))&gt; I   c ( U ( x,y )) 
 
         [0067]     The information content I c  can be directly expressed by the Shannon-Wiener entropy  
                 I   c     ⁡     (     N   ⁡     (     x   ,   y     )       )       =       H   ⁡     (     N   ⁡     (     x   ,   y     )       )       =     -       ∑   n     ⁢       p   ⁡     (   n   )       ⁢     log   e     ⁢     p   ⁡     (   n   )                       (   14   )             
 
         [0068]     where p(n) is the probability than a, point in image N(x,y) has intensity value n. The optimal corrected image Û* is thus given by  
                 U   ^     *     =     arg   ⁢           ⁢       min     U   ^       ⁢     H   ⁡     (       U   ^     ⁡     (     x   ,   y     )       )                   (   15   )             
 
 Method 
 
         [0069]     Because the Heel effect is totally reduced in the collimation area and an estimate of the background {circumflex over (B)} is needed to optimize equation (13), a segmentation algorithm is presented.  
         [0070]     In the next, implementation details of the correction models of the second and third embodiment of the method according to the present invention are given.  
         [0000]     Image Segmentation  
         [0071]     The boundaries of the collimation area have been found using the Hough transform, assuming that these are rectilinear edges as is the case for all hand radiographs in our database. To make this approach more robust, the contributions of each image point to the Hough accumulator are weighted by its gradient magnitude and, for each point, only the lines whose direction is within 10 degrees of the normal to the local gradient direction are considered. The 4 most salient points in Hough space that represent a quadragon with inner angles between 80 and 100 degrees are selected as candidate boundary of the collimation area. Because not all 4 collimation boundaries are always present in the image, candidate boundaries along which the image intensity differ from the expected intensity values for the collimation region, are rejected.  
         [0072]     To extract the background region B, a seed fill algorithm is used that starts from the boundary of the collimation region as determined in the previous step. Appropriate seed points for B are found by considering a small band along each of the collimator edges and retaining all pixels whose intensity is smaller than the mean of the band. This approach avoids choosing pixels that belong to the diagnostic region as candidate seed pixels. The background region is then grown by considering all neighboring pixels n i ,i=1, . . . 8 of each pixel p∈{circumflex over (B)} and adding q i  to {circumflex over (B)} if the intensity difference between p and q is smaller than some specified threshold.  
         [0000]     Maximum Likelihood Estimation  
         [0073]     We simplify (13), by leaving out the multiplicative component {tilde over (S)} M  of the image degradation process  
                       U   ^     *     =     arg   ⁢           ⁢       min       B   ^     ,     U   ^         ⁢     -       ∑     i   ∈     B   ^         ⁢       log   e     ⁢     p   ⁡     (         u   i     |   μ     ,   σ     )                             =     arg   ⁢           ⁢       min       B   ^     ,     U   ^         ⁢     -       ∑     x   ,     y   ∈     B   ^           ⁢       log   e     ⁢     p   ⁡     (         U   ⁡     (     x   ,   y     )       |   μ     ,   σ     )                             =     arg   ⁢           ⁢       min       B   ^     ,     U   ^         ⁢     -       ∑     x   ,     y   ∈     B   ^           ⁢       log   e     ⁢     p   ⁡     (           N   ⁡     (     x   ,   y     )       -         S   ~     A     ⁡     (     x   ,   y     )         |   μ     ,   σ     )                               (   16   )             
 
         [0074]     This equation is optimized by iteratively estimating the background {circumflex over (B)} and finding parameters μ, σ and the components {tilde over (S)} A  after differentiation and substitution of p(u i |μ,σ) by the Gaussian distribution (12). To find the solution for the multiplicative component, the same approach can be followed after logarithmic transforming the intensity values.  
         [0075]     The initial estimate for the background B is taken from the segmentation algorithm described higher. All other estimates for B are computed using a histogram, based threshold algorithm. The threshold is defined as the smallest value of ε satisfying  
               ɛ   *     =       min   ɛ     ⁢       ⋂       i   =   1     ,   2   ,   3       ⁢     {       ɛ   &gt;     μ   +   σ       |         p   β     ⁡     (     ɛ   β     )       &lt;       p   β     ⁡     (       ɛ   β     +   i     )           }                                   ɛ   β     =       [       ɛ   -     min   ⁢           ⁢     U   ^             max   ⁢           ⁢     U   ^       -     min   ⁢           ⁢     U   ^           ]     ·   255             (   17   )             
 
         [0076]     where p B (n) is the probability that a point in image Û B  has value n and μ, σ are the mean and variance of the corrected pixels belonging to the previous background estimate.  
         [0077]     The maximum likelihood estimates for the parameters μ and σ of 7, can be found by minimization of −Σ i  log  e  p(u i |μ,σ). The egressions fir μ is given by the condition that  
           ∂     ∂   μ       ⁢     (     -       ∑   i     ⁢       log   e     ⁢     p   ⁡     (         u   i     |   μ     ,   σ     )             )       =   0.       
 
         [0078]     Differentiating and substituting p(u,|μ,σ) by the Gaussian distribution (12) yields:  
       μ   =         ∑     i   ∈     B   ^         ⁢       u   i     n       =       ∑     i   ∈     B   ^         ⁢         N   ⁡     (       x   i     ,     y   i       )       -         S   ~     A     ⁡     (       x   i     ,     y   i       )         n             
 
         [0079]     where x i ,y i  is the spatial position of pixel i and n is the number of background pixels. The same approach can be followed to derive the expression for σ:  
               σ   2     =       ∑     i   ∈     B   ^         ⁢         (       u   i     -   μ     )     2     n                   =       ∑     i   ∈     B   ^         ⁢         (       N   ⁡     (       x   i     ,     y   i       )       -     μ   ⁢           ⁢         S   ~     A     ⁡     (       x   i     ,     y   i       )           )     2     n                 
 
         [0080]     Suppose that the spatially smoothly varying component {tilde over (S)} A  can be modeled by a linear combination of K polynomial basis functions φ i (x i ,y i )  
         u   i     =       N   ⁡     (       x   i     ,     y   i       )       -       ∑       j   =   1     ,   …   ⁢           ,   K       ⁢       c   j     ⁢       ϕ   j     ⁡     (       x   i     ,     y   i       )                 
 
         [0081]     the partial derivative for c j  of (16) set to zero yields  
           ∑     i   ∈     B   ^         ⁢     [       N   ⁡     (       x   i     ,     y   i       )       -   μ   -       ∑   j     ⁢       c   j     ⁢       ϕ   j     ⁡     (       x   i     ,     y   i       )             ]       =     0   ⁢           ⁢     ∀     k   .             
 
         [0082]     Solving this equation for {c j } does not seem very tractable, but combining all equations for all k and introducing matrix notation simplifies the problem considerably  
             C   =       [           c   1               c   2             ⋮           ⋮           ⋮         ]     =   AR             (   18   )             
 
         [0083]     where A represents the geometry of the image formation model, each of its rows evaluating one basis function φ k  at all coordinates and R represents the residue image, i.e. the difference between the acquired image and the estimated background mean. In full matrix notation, the equation is  
       C   =       [             ϕ   1     ⁡     (     x   1     )               ϕ   1     ⁡     (     x   1     )               ϕ   1     ⁡     (     x   1     )           ⋯               ϕ   1     ⁡     (     x   1     )               ϕ   1     ⁡     (     x   1     )               ϕ   1     ⁡     (     x   1     )           ⋯           ⋯       ⋯       ⋯       ⋯           ⋯       ⋯       ⋯       ⋯           ⋯       ⋯       ⋯       ⋯         ]     ⁡     [             n   1     -   μ                 n   2     -   μ             ⋯           ⋯           ⋯         ]           
 
         [0084]     where n i  is the intensity value of the acquired image at pixel (x i ,y i ). Equation (18) is a least squares fit to the residue image. As least squares fit are sensitive to outliers, only entries in R which satisfy |n i −μ|&lt;2.5 σ are included to solve (18).  
         [0000]     Entropy Minimization  
         [0085]     Suppose than the image degradation components {tilde over (S)} A  and {tilde over (S)} M  can be modeled by a linear combination of K polynomial bass functions φ j   m,a (x,y)  
             S   ~     M     ⁡     (       x   i     ,     y   i       )       =       ∑       j   =   1     ,   …   ⁢           ,     K   m         ⁢       m   j     ⁢       ϕ   j   m     ⁡     (       x   i     ,     y   i       )               
 
             S   ~     A     ⁡     (       x   i     ,     y   i       )       =       ∑       j   =   1     ,   …   ⁢           ,     K   m         ⁢       a   j     ⁢       ϕ   j   a     ⁡     (       x   i     ,     y   i       )               
 
         [0086]     Equation (15) is reformulated as  
               {       a   *     ,     m   *       }     =     arg   ⁢           ⁢       min     a   ,   m       ⁢     {     H   ⁡     (         N   ⁡     (     x   ,   y     )       ⁢         S   ~     M     ⁡     (     x   ,   y     )         -         S   ~     A     ⁡     (     x   ,   y     )         )       }                 (   19   )             
 
         [0087]     The optimal additive parameters α* and multiplicative parameters m* are found by Powell&#39;s multidimensional directional set method and Brent&#39;s one-dimensional optimization algorithm (W.H. Press, S. A. Teukosky, W. T. Vetterling, and B. P. Flannery. Numerical Recipes in C. Cambridge University Press, 1992.)  
         [0088]     The set of probabilities p(n) in (14) can be obtained by normalization of its histogram. In order to reduce the influence or random, effects induced by discretizing the histogram, we use partial intensity interpolation at histogram formation. When transforming the image, an integer intensity value g is transformed to a real value g′, which in general lies between two integer values k and k+1. The histogram sentries h(k) and h(k+1) are updated by k+1−g′ and g′−k respectively, To obtain a smoother decline to the absolute minimum and to minimize the effects of local minima, the obtained histogram is blurred to:  
           h   ^     ⁡     (   n   )       =       ∑     i   =     -   t       t     ⁢       h   ⁡     (     n   +   i     )       ⁢     (     t   +   1   -        i          )             
 
         [0089]     where the parameter t was set to 3.  
         [0000]     Image Formation Models  
         [0090]     We have tested different image formation models which are summarized in, Table 1. The polynomial models are defined as  
         ϕ   v     =       c   0     +       c   1     ⁢   x     +       c   2     ⁢   y     +       c   3     ⁢     x   2       +       c   4     ⁢   xy     +       c   5     ⁢     y   2       +   …   +       c         (     v   +   2     )     !         2   !     ⁢     v   !           ⁢     y   v             
 
         [0091]     Model Σ i ,i=1,2 are included for the maximal likelihood estimation, model Σ 3  is the general image formation model while model Σ 4  is derived from (2). Model Σ 5  is approximation of model Σ 4  where the different model parameters are substituted with real values and higher orders are discarded where appropriate. Model Σ 6  is included for resemblance with model Σ 2 .  
                             TABLE 1                           Image formation models used for correction of       inhomogeneities. φ v  is a polynomial model of order v.                Model   Correction                                                 ∑   1   v     ⁢                   Û = N · φ v                                 ∑   2   v           Û = N + φ v                                 ∑   3   v           Û = N · φ 2   v  + φ 2   v                                 ∑   4   v                     U   ^     =     N   ·     exp   (         ϕ   1   v         ϕ   2     v   -   1         )                                           ∑   5   v                     U   ^     =     N   ·       ϕ   1   v       ϕ   2     v   -   1                                               ∑   6   v                     U   ^     =     N   +       ϕ   1   v       ϕ   2     v   -   1                                      
 
       Fourth Embodiment  
       [0092]     In a fourth embodiment according to the present invention, a statistical mixture model of the image is generated based on a plurality of K image regions.  
         [0093]     Each of these regions or classes may physically correspond to e.g. bone, soft tissue and direct exposure area.  
         [0094]     In the assumption or a normal mixture model, each class is represented by three unknown parameters: the proportion n k  of image pixels, the mean value μ k  and the variance σ k   2 .  
         [0095]     The set ψ collectively comprising all unknown parameters becomes: 
 
ψ={π 1 , . . . ,π K ,μ 1 , . . . ,μ K ,σ 1   2 , . . . ,σ K   2 }
 
         [0096]     The subset of parameters pertaining to class k is denoted as 
 
ψ k ={π k ,μ k ,σ k   2 }
 
         [0097]     The image intensity histogram, de-noting the probability distribution that a pixel i has intensity y i  is therefore a Gaussian mixture model  
               f   ⁡     (       y   i     |   ψ     )       =       ∑     k   =   1     K     ⁢       π   k     ⁢       f   k     ⁡     (       y   i     |     ψ   k       )                                   =       ∑     k   =   1     K     ⁢       π   k     ⁢     1       2   ⁢     πσ   k   2           ⁢     exp   ⁡     (     -         (       y   i     -     μ   k       )     2       2   ⁢     σ   k   2           )                     i   =   1     ,   …   ⁢           ,   N             
 
 The Basic EM Algorithm 
 
         [0098]     The classical analytical method to estimate the parameter ψ is to maximise the log-likelihood function for each of then parameters to estimate.  
         [0099]     The maximum likelihood estimates of each parameter can be solved from a system of equations which is non-linear in general and hence requires methods such as Newton-Raphson algorithm.  
         [0100]     The Expectation-Maximisation (EM) algorithm estimates the parameters ψ by adding segmentation labels z i  (i represents pixel i and z 1  has a value k, k=1 . . . K), (so called non-observable data) to each of the grey values y i  of the pixels (so called observable data).  
         [0101]     In each iteration of the EM algorithm the expectation step (E-step) estimates a segmentation label k to each pixel i on the basis of parameter values ψ from the previous iteration and in the maximisation step (M-step) new parameter values ψ are computed on the basis of maximum likelihood, given the new segmentation labels associated with each of the newly assigned segmentation labels.  
         [0000]     The Extended EM Algorithm  
         [0102]     In the context of the present invention two modifications have been added to the EM algorithm to make it correcting for a bias field caused by global inhomogeneities in the imaging chain and to discard outliers due to local inhomogeneities.  
         [0103]     The global inhomogeneities in the image distort the assumed normal distribution of the pixel classes.  
         [0104]     Every pixel segmentation class is modelled as a normal distribution of which a sum of spatially correlated continuous basis functions is subtracted.  
         [0105]     Examples of such basis functions are orthogonal polynomials. Other orthogonal continuous functions may be used as well.  
         [0106]     The coefficients of the basis polynomials are added to the parameter set ψ which must be estimated  
             ψ   =     {       π   1     ,   …   ⁢           ,     π   K     ,     μ   1     ,   …   ⁢           ,     μ   K     ,     σ   1   2     ,   …   ⁢           ,     σ   K   2     ,   C     }                 =     {       π   1     ,   …   ⁢           ,     π   K     ,     μ   1     ,   …   ⁢           ,     μ   K     ,     σ   1   2     ,   …   ⁢           ,     σ   K   2     ,     c   1     ,   …   ⁢           ,     c   R       }               
 
         [0107]     with the probability distribution for the pixels belonging to segmentation class k  
                 f   k     ⁡     (     y   |       Ψ   k     ⁢   C       )       =       1       2   ⁢     πσ   k   2           ⁢     exp   ⁡     [       -     1     2   ⁢     σ   k   2           ⁢       (     y   -     μ   k     -       ∑     r   =   t     R     ⁢       c   r     ⁢     Φ   r           )     2       ]                   k   =   1     ,   …   ⁢           ,   K             
 
         [0108]     with φ r  a N×1 vector holding the polynomial function evaluation for the r-th basis polynomial at pixel location i (i=1, . . . N).  
         [0109]     A further correction to the basic EM algorithm is to make it robust against outliers in the observed distribution of a segmentation class, caused by the presence of local defects (dust, scratch, pixel drop out . . . ) in the recording member, said defects not being attributable to the global inhomogeneities.  
         [0110]     To this purpose each pixel class k is divided in a Gaussian class (which is distributed by the inhomogeneity and which is corrected by the bias function) and a rejection class. This rejection class is assumed to have a uniform distribution with probability density δ k  and contains a proportion ε∈[0,1] of the pixels. The probability distribution of pixel class k is therefore 
 
ƒ kε ( y   i |ψ k )=(1−ε)ƒ k ( y   i |ψ k )+εδ k  
 
 Summary of the Extended EM Algorithm 
 
         [0111]     The extended EM algorithm is summarised by the following formulas valid for iteration m:  
         [0000]     E-Step:  
         [0112]     For each pixel class k, k=1, . . . K and each pixel i, i=1, . . . N, compute  
         p   ik     (     m   +   1     )       =           f   k     ⁡     (     y   |     ψ   k     (   m   )         )       ⁢     π   k     (   m   )             ∑     i   =   1     K     ⁢         f   i     ⁡     (       y   i     |     ψ   k     (   m   )         )       ⁢     π   i     (   m   )                 
         λ   k     (     m   +   1     )       =       1       2   ⁢     πσ   k   2           ⁢     exp   ⁡     (       -     1   2       ⁢     κ   2       )             
         t   ik     (     m   +   1     )       =         f   k     ⁡     (       y   i     |     ψ   k     (   m   )         )             f   i     ⁡     (       y   i     |     ψ   k     (   m   )         )       +     λ   k     (     m   +   1     )               
 
         [0113]     with  
         [0114]     y i  denoting the intensity values of pixel i  
         [0115]     ψ k   (m)  the set of statistical parameter describing class k at iteration m  
         [0116]     π k   (m)  the proportion of pixels in the image belonging to class k at iteration m  
         [0117]     ƒ k  the probability density function of intensity of pixels of class k denoting the conditional probability that pixel i has gray value y i  given parameters ψ k  of class k  
         [0118]     p ik   (m+1)  the probability that pixel i belongs to class k at iteration m+1, these probabilities sum to 1, i.e.  
           ∑     k   =   1     K     ⁢     p   ik     (     m   +   1     )         =   1.       
 
         [0119]     σ k   2(m)  the variance of intensity of pixels belonging to class k at iteration m,  
         [0120]     k, a threshold on the Mahalanobis distance defined as  
         d   k     =            (       y   i     -     μ   k       )       σ   k                
 
         [0121]     λ k   (m+1)  the probability of pixels of class k being outliers,  
       t   ik     (     m   +   1     )         
 
 the probability of pixels inside class k to belong to the non-rejected group (i.e. not being an outlier). Because λ k ≠0, this probability may be less than one, and hence  
           ∑     k   =   1     K     ⁢       p   ik     (     m   +   1     )       ⁢     t   ik     (     m   +   1     )           ≤   1.       
 
         [0122]     At this stage, a segmentation of the image could be obtained by a hard classification, i.e. each pixel i is assigned class k for which p ik   (m+1)  is maximal, i.e. class pixel  
       i   =       argmax   k     ⁢       {     p   ik     (     m   +   1     )       }     .           
 
 In the sequel of the EM algorithm, soft classification labels p ik   (m+1) E[0 . . . 1] are used. 
 
 M-Step 
 
         [0123]     For each class k=1 . . . K and for each coefficient c r , r=1 . . . R applied to the corresponding polynomial basis function, compute  
         π   k     (     m   +   1     )       =       ∑     i   =   1     N     ⁢       p   ik     (     m   +   1     )       N           
         μ   k     (     m   +   1     )       =         ∑     i   =   1     N     ⁢       p   ik     (     m   +   1     )       ⁢       t   ik     (     m   +   1     )       ⁡     (       y   i     -       ∑     r   =   1     R     ⁢       c   r     (   m   )       ⁢     φ   ir           )               ∑     i   =   1     N     ⁢       p   ik     (     m   +   1     )       ⁢     t   ik     (     m   +   1     )                 
         σ   k     2     (     m   +   1     )         =         ∑     i   =   1     N     ⁢       p   ik     (     m   +   1     )       ⁢       t   ik     (     m   +   1     )       ⁡     (       y   i     -     μ   k     (     m   +   1     )       -       ∑     r   =   1     R     ⁢       c   r     (   m   )       ⁢     φ   ir           )               ∑     i   =   1     N     ⁢       p   ik     (     m   +   1     )       ⁢     t   ik     (     m   +   1     )                 
         C     (     m   +   1     )       =       [           c   1     (     m   +   1     )                 c   2     (     m   +   1     )               …             c   R     (     m   +   1     )             ]     =         (       A   T     ⁢     W     (     m   +   1     )       ⁢   A     )       -   1       ⁢     A   T     ⁢     W     (     m   +   1     )       ⁢     R     (     m   +   1     )               
     with     
       A   =     [           φ   11           φ   12         …         φ     1   ⁢   R                 φ   21         …                   …           …                   …       …             φ   N1         …       …         φ   NR           ]         
           W     (     m   +   1     )       =     [           w   1     (     m   +   1     )           0       …       0           0         w   2     (     m   +   1     )                       …           …                   …       0           0       …       0         w   N     (     m   +   1     )             ]       ,     
     ⁢       w   i     (     m   +   1     )       =       ∑     k   =   1     K     ⁢         p   ik     (     m   +   1     )       ⁢     t   ik     (     m   +   1     )           σ   k     2     (     m   +   1     )                   
           R     (     m   +   1     )       =     [             y   1     -       y   ~     1     (     m   +   1     )                     y   2     -       y   ~     2     (     m   +   1     )                 …               y   N     -       y   ~     N     (     m   +   1     )               ]       ,     
     ⁢         y   ~     i     (     m   +   1     )       =         ∑     k   =   1     K     ⁢           p   ik     (     m   +   1     )       ⁢     t   ik     (     m   +   1     )           σ   k     2     (     m   +   1     )           ⁢     μ   k     2     (     m   +   1     )                 ∑     k   =   1     K     ⁢         p   ik     (     m   +   1     )       ⁢     t   ik     (     m   +   1     )           σ   k     2     (     m   +   1     )                     
 
         [0124]     wherein  
         [0125]     μ k   (m+1)  denotes the mean intensity value of pixels belonging to class k at iteration (m+1),  
         [0126]     σ k   2(m+1)  denotes the variance of intensity value of pixels belonging to class k at iteration (m+1), after having corrected for the estimate of the bias field,  
         [0127]     C (m+1)  is a vector containing coefficients c r , r=1 . . . R applied to the corresponding polynomial basis function,  
         [0128]     A(i,r)=φ ir  is the evaluation of the M-th polynomial basis function at pixel location i (matrix A thus represents the geometry of the bias field model),  
         [0129]     W (m+1)  is a diagonal matrix of weights w i   (m+1) , i=1 . . . N, with  
         [0130]     w i   (m+1)  the weight applied at pixel i in iteration (m+1). Said weight is the sum of the inverse of variance overall classes k, k=1 . . . K, each weighted with the probability of that class which is p ik   (m+1) t ik   (m+1) .  
         [0131]     R (m+1)  is a residue image, the residue being the difference between the original image matrix y i , i=1 . . . N and the corrected image matrix {tilde over (y)} i   (m+1)  at iteration (m+1).  
         [0132]     The equations of the extended EM algorithm reduce to the basic EM algorithm when no bias correction is performed (all c r =0) or no outliers are taken into account (all λ k =0 and hence all t ik =1).  
         [0000]     Initialization  
         [0133]     In order to start the iterations of the EM algorithm, an initial estimate ψ(0) for the parameter set ψ is needed.  
         [0134]     This is achieved by assigning each pixel i, i=1 . . . N, to one of the classes k=1 . . . K on the basis of intensity histogram slicing.  
         [0135]     This assignment involves the computation of p ik   (0) , which is a hard assignment of probability 1 to one of the k possible class probabilities at pixel i and putting all other probabilities no zero.  
         [0136]     Furthermore, no outliers are assumed during initialization, i.e. t tk   (0) =1 for all i.  
         [0137]     Therefore the M-step in which the values ψ are computed can be executed immediately after initialization.  
         [0138]     Therefore the initialization on step for which the iteration value m=0 does not present a true iteration step in the EM algorithm.  
         [0139]     To slice the histogram into K distinct initial pixel classes k=1 . . . K, prior art techniques are used. In the context of the present invention, the histogram is smoothed and approximated with a higher order polynomial, after which the two or three most important maxima are determined. The intensity thresholds separating intensities of different classes are then determined as the intensities corresponding to the minima between these different maxima.