# Patent

## Title
Method for automatic construction of 2D statistical shape model for the lung regions

## Abstract

A method for automatic construction of 2D statistical shape models for the lung regions in chest radiographic images comprising: providing a radiographic image of the chest region of an individual; by performing a manual contour tracing, extracting the lung region shape instances from the chest radiographic image; by using a shape alignment algorithm, aligning all shape instances as closely as possible to a pre-defined template shape; and generating a statistical model shape of the lung regions by principle component analysis using the aligned shape instances.

## Background
FIELD OF THE INVENTION
This invention relates in general to lung shape modeling, and in particular to a method for automatically constructing two-dimension (2D) statistical shape model of the lung regions from sets of chest radiographic images.
BACKGROUND OF THE INVENTION
The use of shape as an anatomical object property is a rapidly increasing portion of research in the field of medical image analysis. Shape representations and shape models have been used in connection with segmentation of medical images, diagnosis, and motion analysis. Among different types of shape models, Active Shape Models (ASMs) have been frequently applied and proven a powerful tool for characterizing objects and segmenting medical images. In order to construct such models, sets of labeled training images are required. The labels in the training sets consist of landmark points defining the correspondences between similar structures in each image across the set. Manual definition of landmarks on 2D shapes has proven to be both time-consuming and error prone. To reduce the burden, semi-automatic systems have been developed. In these systems, a model is built from the current set of examples, and used to search the next image. The user can edit the result where necessary, then add the example to the training set. Though this can considerably reduce the time and effort required, labeling large sets of examples is still labor intensive.
Because of the importance of landmark labeling, a few attempts have been made to automate the shape alignment/average process. For example, Lorenz and Krahnstover automatically locate candidates for landmarks via a metric for points of high curvature, Lorenz C., Krahnstove N. Generation of point-based 3D statistical shape models for anatomical objects. CVIU, vol. 77 no. 2, February 2000, pp. 175-191. Davatzikos et al. used curvature registration on contours produced by an active contour approach, (C. Davatzikos, M. Vaillant, S. M. Resnich, J. L. Prince, S. Letovsky, and R. N. Bryan, A Computerized Approach for Morphological Analysis of the Corpus Callosum, J. Computer Assisted Tomography vol. 20, 1996, pp. 88-97). Duncan et al. (J. Duncan, R. L. Owen, L. H. Staib, and F. Anandan, Measurement of non-rigid motion using contour shape descriptors, in IEEE Conference on Computer Vision and Pattern Recognition, 1991, pp. 318-324). And Kambhamettu et al, (C. Kambhamettu and D. B. Goldgof, Point correspondence recovery in non-rigid motion, IEEE Conference on Computer Vision and Pattern Recognition, 1992, pp. 545-561), propose methods of correspondence based on the minimization of a cost function that involves the difference in the curvature of two boundaries. However, as pointed out by several studies, curvature is a rigid invariant of shape and its applicability is limited in case of nonlinear shape distortions. In addition, it is hard to find sufficient high curvature points on lung contours.
Hill et al. employed a sparse polygonal approximation to one of two boundaries which is transformed onto the other boundary via an optimization scheme, (A. Hill, C. J. Taylor, and A. D. Brett, A Framework for Automatic Landmark Identification Using a New Method of Nonrigid Correspondence, IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 22, no. 3, 2000, pp. 241-251). The polygonal matching is based on an assumption that arc path-lengths between consecutive points are equal. This assumption may be violated in case of severe shape difference and is especially difficult to satisfy in polygonal approximation of lung shape contours.
As a result, the prior art does not fit the lung shape modeling very well, therefore there exists a need for a method for automatically constructing 2D statistical shape model of lung regions in chest radio graphs.
SUMMARY OF THE INVENTION
According to the present invention, a method is provided for automatic construction of 2-D statistical shape models for the lung regions in chest radiographic images. The method makes use of a set of shape instances of lung regions from chest images, and automatically aligns them to a pre-defined template shape using the L2 distance and Procrustes distance analysis. Once the training shapes are appropriately aligned, a set of landmarks is automatically generated from each shape. Finally, a 2D statistical model is constructed by Principle Component Analysis. The statistical shape model consists of a mean shape vector to represent the general shape and variation modes in the form of the eigenvectors of the covariance matrix to model the differences between individuals.
ADVANTAGEOUS EFFECT OF THE INVENTION
The invention has the following advantages.
1. The entire alignment and labeling process is automatic.
2. The time and effort required to label sets of data is dramatically reduced.
3. User bias introduced by manual labeling is avoided.



BRIEF DESCRIPTION OF THE DRAWINGS
Preferred embodiments of the present invention will be described below in more detail, with reference to the accompanying drawings:
FIG. 1 is a flowchart illustrating the overall scheme for the automated method for constructing 2D statistical shape models of lung regions.
FIG. 2 is a block diagram illustration of the shape alignment algorithm.
FIG. 3(a) is a diagrammatic view illustrating the polygonal shape approximations Tp computed from the template shape.
FIG. 3(b) is a diagrammatic view illustrating the polygonal shape approximations Sp computed from a shape instances.
FIG. 4(a) is a diagrammatic view of turning angle vs. arc-length showing the turning function θTp(s) of the template shape.
FIG. 4(b) is a diagrammatic view of turning angle vs. arc-length showing the turning function θSp(s) of the shape instance.
FIG. 5(a) is a diagrammatic view showing the result of the coarse shape alignment.
FIG. 5(b) is a graphical view of turning angle vs. arc-length illustrating the relationships of the turning functions in the coarse shape alignment.
FIG. 6 illustrates the determination of landmarks on the left and right lung shape contours.
FIGS. 7(a) and 7(b) are diagrammatic views respectively showing the corresponding landmark points on the template shape and the shape instance.
FIG. 8 is a diagrammatic view displaying the final alignment result.
FIG. 9 is a diagrammatic view which the Procrustes average shape. The clouds are landmarks from the aligned set of shape instances.
FIGS. 10(a) and 10(l) show some training shapes of the lung region selected from a database.
FIG. 11(a) is a diagrammatic view which shows the effects of varying the first parameter of the left lung shape model by two standard deviations.
FIG. 11(b) is a diagrammatic view which shows the effects of varying the second parameter of the left lung shape model by two standard deviations.
FIG. 11(c) is a diagrammatic view which shows the effects of varying the first parameter of the right lung shape model by two standard deviations.
FIG. 11(d) is a diagrammatic view which shows the effects of varying the second parameter of the right lung shape model by two standard deviations.
FIG. 12 is a block diagram of a radiographic imaging system incorporating the present invention.



DETAILED DESCRIPTION OF THE INVENTION
The present invention relates in general to the processing of chest radiographic images. FIG. 12 is a block diagram of a radiographic system incorporating the present invention. As shown a radiographic image, such as a chest radiographic image is acquired by an image acquisition system 1600. Image acquisition system 1600 can include one of the following: (1) a conventional radiographic film/screen system in which a body part (chest) of a patient is exposed to x-radiation from an x-ray source and a radiographic image is formed in the radiographic image is formed in the radiographic film. The film is developed and digitized to produce a digital radiographic image. (2) A computed radiography system in which the radiographic image of the patient's body part is formed in a storage phosphor plate. The storage phosphor plate is scanned to produce a digital radiographic image. The storage phosphor plate is erased and reused. (3) A direct digital radiography system in which the radiographic image of the patient's body part is formed directly in a direct digital device which directly produces a digital radiographic image.
The digital radiographic image is processed according to the present invention by image processing system 1602. System 1602 is preferably a digital computer or digital microprocessor by can include hardware and firmware to carry out the various image processing operations.
The processed digital radiographic image is provided to image output 1604, such as a high resolution electronic display or a printer which produces a hard copy (film) of the processed radiographic image. The original as well as the processed image can be transmitted to a remote location, can be stored in a radiographic image storage system (PACS), etc.
The present invention discloses a method for automatically constructing 2D statistical shape models for lung regions, which is based on the combination of three processing steps as shown in FIG. 1. First, a digital radiographic image of chest regions of a patient is provided (box 9) for digital image processing. Then a manual contour tracing is first performed to extract the lung region contours from the chest radiographs (box 10). Later a shape alignment algorithm is used to align all shape instances as closely as possible to a pre-defined template shape (box 11). Finally, a statistical shape model is generated by principle component analysis using the aligned shape instances (box 12).
The most difficult issue in the alignment is the one-to-one correspondence between different shape instances. The present invention provides an efficient method to achieve this goal by first searching a set of landmarks related to the shape features along the shape contour, and then filling the segments between them with a fixed number of equidistant landmarks. The method includes two stages, as shown in FIG. 2. In the first stage (the coarse shape alignment), a template shape is selected (box 21), and for each shape instance, a scale, rotation and translation are computed based on the L2 distance between the turning functions of the two polygons, which are used to approximate the template shape and the shape instance. In the second stage of the process (detailed shape alignment), sets of corresponding points are defined and a least-squares type (Procrustes) distance is computed for a more detailed shape alignment.
In the present invention, a polygonal shape approximation is computed to simplify the representation of a shape (box 22) and a turning function θ(s) is defined to measure the angle of the counter clockwise tangent from a reference point ◯ on the shape approximation (box 23). The reference point orientation θ(◯) is associated with the image coordinates (such as the x-axis). θ(s), as a function of the arc-length s, keeps track of the turning that takes place, increasing with left-hand turns and decreasing with right-hand turns, as shown in FIGS. 4(a) and 4(b). To ensure generality, the perimeter length of each polygon is normalized. Thus for a simple closed contour, θ(s) starts at θ(◯) (assuming that the reference point ◯ is placed at differential point along the contour) and increases to θ(1)=θ(◯)+2π. The function θ(s) has several properties that make it especially suitable for shape alignment. It is piecewise constant for polygons, making computations particularly easy and fast. According to the definition, the function θ(s) is invariant under translation and scaling to the polygon. Rotation of the polygon corresponds to a simple shift of θ(s) in the θ direction (the vertical direction), while changing the location of the reference point ◯ by an amount tε[0, 1] along the perimeter of polygon corresponds to a horizontal shift of the function θ(s).
In the implementation of coarse shape alignment, the method chooses one shape instance as the template shape T, whose size is close to the mean size of all shape instances. Then two polygonal shape approximations Tp and Sp are computed from the template shape 31 and a shape instances 32, respectively, as shown in FIGS. 3(a) and 3(b). The degree to which Tp and Sp are similar can be measured by taking the minimal L2 distance between the turning functions θTp(s) and θSp(s), as defined by




  
    
      
        
          
            D
            2
            
              
                T
                p
              
              ,
              
                S
                p
              
            
          
          ⁡
          
            (
            
              t
              ,
              θ
            
            )
          
        
        =
        
          
            (
            
              
                min
                
                  
                    θ
                    ∈
                    R
                  
                  ,
                  
                    t
                    ∈
                    
                      [
                      
                        0
                        ,
                        1
                      
                      ]
                    
                  
                
              
              ⁢
              
                
                  ∫
                  0
                  1
                
                ⁢
                
                  
                    
                      
                      
                        
                          
                            θ
                            
                              T
                              p
                            
                          
                          ⁡
                          
                            (
                            
                              s
                              +
                              t
                            
                            )
                          
                        
                        -
                        
                          
                            θ
                            
                              S
                              p
                            
                          
                          ⁡
                          
                            (
                            s
                            )
                          
                        
                        +
                        θ
                      
                      
                    
                    2
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    d
                    s
                  
                
              
            
            )
          
          
            1
            2
          
        
      
    
    
      
        (
        1
        )
      
    
  




where t represents the position of the reference point along the polygon, and θ corresponds to the rotation of polygon. Based on the proofs given by Arkin et al. (E. M. Arkin, L. P. Chew, D. P. Huttenlocher, K. Kedem, and J. S. Mitcheel, An efficiently computable Metric for Comparing Polygonal shapes. IEEE Trans. On Pattern Analysis and Machine Intelligence. vol. 13, no. 3, 1991, pp. 209-215), this problem can be solved by




  
    
      
        
          
            D
            2
            
              
                T
                p
              
              ,
              
                S
                p
              
            
          
          ⁡
          
            (
            
              t
              ,
              θ
            
            )
          
        
        =
        
          
            {
            
              
                min
                
                  t
                  ⁢
                  
                    
                  
                  ∈
                  
                    [
                    
                      0
                      ,
                      1
                    
                    ]
                  
                
              
              ⁢
              
                [
                
                  
                    
                      ∫
                      0
                      1
                    
                    ⁢
                    
                      
                        
                          (
                          
                            
                              
                                θ
                                
                                  T
                                  p
                                
                              
                              ⁡
                              
                                (
                                
                                  s
                                  +
                                  t
                                
                                )
                              
                            
                            -
                            
                              
                                θ
                                
                                  S
                                  P
                                
                              
                              ⁡
                              
                                (
                                s
                                )
                              
                            
                          
                          )
                        
                        2
                      
                      ⁢
                      
                        
                      
                      ⁢
                      
                        d
                        s
                      
                    
                  
                  -
                  
                    
                      (
                      
                        θ
                        *
                        
                          (
                          t
                          )
                        
                      
                      )
                    
                    2
                  
                
                ]
              
            
            }
          
          
            1
            2
          
        
      
    
    
      
        (
        2
        )
      
    
  




Where θ* is the optimal orientation for any fixed t which is given by

θ*=∫01θSp(s)ds−∫01θTp(s)ds−2πt  (3)

By solving the above equations, two matrices are obtained (box 24). One is D2 matrix from Eq. (2) and the other is θc matrix from Eq. (3). The correct orientation of the shape instance can be found by searching the minimal L2 distance in D2 matrix and the corresponding element in θc matrix (box 25). As for the other two parameters, the scale is simply determined from the perimeters of two shapes.

sc=PSp/PTp  (4)

The translation can be calculated from the gravity centers of two shapes

tc=tTp−tSp  (5)

Once the coarse shape alignment is done (box 26), the shape instance 52 is well aligned with the template shape 51, as shown in FIG. 5. However, this result still leaves a space for a more accurate alignment. Thus, in the second stage, the aim is to improve the alignment by minimizing the Procrustes distance between the template shape contour and the shape instance contour.
To compute the Procrustes distance, a crucial requirement is to correctly define point correspondence between the template shape and shape instance, which can be easily achieved after the coarse shape alignment. The idea is that, first of all, some landmarks related to the shape features are located along the shape contour. For example, in FIG. 6, the landmark ◯ on the left lung contour 61 and the landmarks ◯1 and ◯2 on the right lung contour 62. Then, a fixed number of equidistance points are filled in each segment between the located landmarks (box 27). Finally a list of vertices is constructed where each vertex represents a landmark point and the index order is correspond to the counter-clockwise direction along the contour. This last step is very important since it ensures that all elements with the same index represent corresponding shape information.
Given the template shape vector XT (63) and the shape instance vector XS, (64) as shown respectively in FIGS. 7(a) and 7(b), an appropriate rotation θd, a scale sd and a translation td=(tdx,tdy) are chosen (box 28) and mapped onto M(XS)+td to minimize the weighted sum (box 29).

E=(XT−M(sd,θd)Xs−td)TW(XT−M(sd, θd)Xs−td)  (6)

Where




  
    
      
        
          M
          ⁡
          
            (
            
              
                s
                d
              
              ,
              
                θ
                d
              
            
            )
          
        
        =
        
          
            [
            
              
                
                  
                    s
                    
                      d
                      ⁢
                      
                        
                      
                      ⁢
                      x
                    
                  
                
                
                  0
                
              
              
                
                  0
                
                
                  
                    s
                    
                      d
                      ⁢
                      
                        
                      
                      ⁢
                      y
                    
                  
                
              
            
            ]
          
          ⁢
          
            
          
          [
          
            
              
                
                  cos
                  ⁢
                  
                    
                  
                  ⁢
                  θ
                
              
              
                
                  
                    -
                    sin
                  
                  ⁢
                  
                    
                  
                  ⁢
                  θ
                
              
            
            
              
                
                  sin
                  ⁢
                  
                    
                  
                  ⁢
                  θ
                
              
              
                
                  cos
                  ⁢
                  
                    
                  
                  ⁢
                  θ
                
              
            
          
          ]
        
      
    
    
      
        (
        7
        )
      
    
  




W is a diagonal matrix of weights for each landmark. In the present invention, the weights are chosen to give more significance to those landmarks related to anatomical structures. FIG. 8 shows the final alignment result of the template shape 81 and the shape instance 82 after the detailed alignment.
After the shape alignment, there is a one-to-one correspondence between the vector elements of a given index, which ensures the vector element represents corresponding shape information. By taking the average of the coordinates of the corresponding vertices, a mean shape can be generated for left lung 91 and right lung 92, as shown in FIG. 9, and the shape model variation can be also analyzed by applying a principal component analysis on the training data. Each computed principal component gives a ‘model of variation’, a way in which the landmark points tend to move together as the shape varies.
For the 2D lung shape models in the present invention, there are N landmarks on the shape contour. So a 2N*2N covariance matrix S is calculated by using




  
    
      
        S
        =
        
          
            1
            M
          
          ⁢
          
            
              ∑
              
                i
                =
                1
              
              M
            
            ⁢
            
              
            
            ⁢
            
              
                (
                
                  
                    x
                    i
                  
                  -
                  
                    x
                    _
                  
                
                )
              
              ⁢
              
                
                  (
                  
                    
                      x
                      i
                    
                    -
                    
                      x
                      _
                    
                  
                  )
                
                T
              
            
          
        
      
    
    
      
        (
        8
        )
      
    
  




Where xi is a shape instance, x is the mean shape. M is the total number of the shape instances.
One particularly useful property of this matrix is that it can demonstrate variation in some directions more than in others. These variations' directions and importance may be derived from an eigen-decomposition of S by solving the equation

Spi=λipi  (9)

Solutions to Eq. (9) provide the eigenvector pi and their eigenvalues λi of S. Conventionally, these eigenvalues are sorted in the decreasing order. It can be shown that the eigenvectors associated with larger eigenvalues correspond to the directions of larger variation in the underlying training data.
Note that any shape in the training set can be approximated using the mean shape and a weighted sum of these deviations obtained from the first t modes.

x≈ x+Ptbt  (10)

Where b=(b1, b2, b3, . . . bt) is the vector of weights, which indicates how much variation is exhibited with respect to each of the eigenvectors.
The present invention has been used to generate 2D statistical shape models of lung regions from 65 training contours. FIGS. 10(a)-10(l) show some training shapes of the lung region selected from a database. Each shape contour is created by a user delineating the lung region boarders.
FIGS. 11(a) and 10(b) show the shape variation by varying the first two model parameters. In particular, FIG. 11(a) shows the effects of varying the first parameter of the left lung shape model. FIG. 11(b) shows the effects of varying the second parameter of the left lung shape model. FIG. 11(c) shows the effects of varying the first parameter of the right lung shape model. FIG. 11(d) shows the effects of varying the second parameter of the right lung shape model.
In summary, a method for automatically constructing a 2D statistical shape model for lung region in chest radiograph is provided. Given a set of lung region shape instances, the method generated the mean shape of lung region by automatically aligning the training shape instances, selecting landmarks, and finally deriving a statistical model by principle component analysis. This method has been successfully applied to a set of 65 lung region shape data sets. As expected, a large portion of total shape variability is captured with the first few eigenvectors. The present method can also be used to construct the shape models of other anatomical structures, such as bones and organs.
The invention has been described in detail with particular reference to certain preferred embodiments thereof, but it will be understood that variations and modifications can be effected within the spirit and scope of the invention.
PARTS LIST


    9 radiographic image
    10 contour extraction
    11 contour shape alignment
    12 principle component analysis
    21 template shape
    22 polygon approximation
    23 shape approximation
    24 multiple matrices
    25 corresponding element
    26 coarse shape alignment
    27 located landmarks
    28 translation chosen
    29 minimize the weighted sum
    31 template shape
    32 shape instances
    51 template shape
    52 shape instance
    61 left lung contour
    62 right lung contour
    63 shape vector
    64 shape instance vector
    81 template shape
    82 shape instance
    91 left lung
    92 right lung
    1600 image acquisition system
    1602 image processing system
    1604 image output

## Claims

1. A method for automatic construction of 2D statistical shape models for the lung regions in chest radiographs, comprising:
extracting the anatomical structure contours from a chest radiograph image;
rigidly aligning shape instances to a template shape using a coarse shape alignment algorithm;
optimizing the alignment of shape instances to said template shape by a detailed shape alignment process; and
generating a statistical shape model using said aligned shape instances;
wherein said coarse shape alignment process includes:
creating a template shape;
computing the minimal distance and associated transformation parameters between said template shape and a shape instance; and
transforming the shape instance based on the transformation parameters.

2. The method of claim 1, wherein said computing the minimal distance includes;
computing the polygon approximations from said template shape and a shape instance;
computing the minimal distance between said polygon approximations; and
determining the associated scale, rotation, and translation parameters using the minimal distance.

3. The method of claim 2, wherein said computing the minimal distance includes:
computing the turning functions of said polygon approximations; and
searching the minimal distance between said turning functions.

4. A method for automatic construction of 2D statistical shape models for the lung regions in chest radiographs, comprising:
extracting the anatomical structure contours from a chest radiograph image;
rigidly aligning shape instances to a template shape using a coarse shape alignment algorithm;
optimizing the alignment of shape instances to said template shape by a detailed shape alignment process; and
generating a statistical shape model using said aligned shape instances;
wherein said detailed shape alignment process includes:
locating landmarks related to the shape features along the shape contours;
calculating the transformation parameters using the distance between the template shape landmarks and the instance shape landmarks; and
transforming the shape instance based on the transformation parameters.

5. The method of claim 4, wherein locating landmarks includes:
choosing a certain polygon vertices with salient shape features as landmarks; and
locating a fixed number of equidistant points between said landmarks as the rest of the landmarks.

6. The method of claim 4 wherein calculating the transformation parameters is carried out using the Procrustes distance.