# Patent

## Title
System and method for multi-label image segmentation

## Abstract

A system and method for multi-label image segmentation is provided. The method comprises the steps of: receiving image data including a set of labeled image elements; mapping a change in intensities of the image data to edge weights; determining potentials for each image element in the image data; and assigning a label, based upon the determined potentials, to each image element in the image data.

## Background
CROSS-REFERENCE TO RELATED APPLICATION
This application claims the benefit of U.S. Provisional Application No. 60/538,670, filed Jan. 23, 2004, the disclosure of which is herein incorporated by reference.


BACKGROUND OF THE INVENTION
1. Technical Field
The present invention relates to image segmentation, and more particularly, to multi-label image segmentation.
2. Discussion of the Related Art
Image segmentation is commonly used, for example, in automatic or semi-automatic image analysis techniques. In such techniques, image segmentation is used to partition a digital image into disjoint connected sets of pixels, each of which corresponds to an object or region before image content can be analyzed, identified, or classified into different groups.
A variety of methods for image segmentation exist such as: classification-based methods (e.g., thresholding, or multi-dimensional clustering/classification), which use information about a pixel and/or its neighborhood to classify the pixel into one of many segments; edge-based methods (e.g., edge finding and linking), which segment an image based on spatial discontinuity or edge detection; region-based methods (e.g., region growing), which segment an image based on spatial similarity amongst pixels; shape-based methods (e.g., mathematical morphology or template matching), which segment an image based on knowledge of the shape of the object to be segmented; and hybrid methods, which are a combination of one or more of the above methods.
Currently, there exist automatic and semi-automatic techniques for image analysis using various image segmentation techniques. In particular, automatic techniques such as Bayesian methods, normalized cuts, or watersheds typically operate by defining K-way clustering heuristics over image values or values derived from other processes (e.g., spectral coefficients). In an effort to address multi-label segmentation (i.e., an image segmentation technique that simultaneously finds multiple segmentation targets) without resorting to recursively applied binary segmentation, some of these methods attempt to cluster an image into K clusters with either a pre-defined K or a K chosen to satisfy a given criteria. As these are fully automatic methods, there is no user interaction. In addition, the spectral methods are not guaranteed to produce a unique solution and, in some cases, lead to a fully degenerate problem.
Some semi-automatic methods such as graph cuts, marker-based watershed, or region competition have attempted to address multi-label segmentation without resorting to recursively applying binary segmentation. For example, graph cuts does this by finding cuts with a smallest value (as defined by image gradients) that separate each labeled region from all others using 2-way graph cuts. However, extension of this method to K-way partitioning is difficult (for K>2). In addition, this method suffers from the production of segments that minimally encircle user-specified seeds if enough seeds are not placed. Similarly, a machine learning algorithm using Gaussian fields and harmonic functions finds clusters based on harmonic functions using boundary conditions set by a few known points. This algorithm, however, employs methods for similarity measures between points in feature space that are not entirely appropriate for computer vision.
Accordingly, there is a need for a multi-label image segmentation technique that is independent of modality, prior knowledge, and segmentation task, and that allows rapid and easy editing of results without having to resort to recursively applied binary segmentation.
SUMMARY OF THE INVENTION
The present invention overcomes the foregoing and other problems encountered in the known teachings by providing a system and method for multi-label image segmentation.
In one embodiment of the present invention, a method for multi-label image segmentation, comprises: receiving image data including a set of labeled image elements; mapping a change in intensities of the image data to edge weights; determining potentials for each image element in the image data; and assigning a label, based upon the determined potentials, to each image element in the image data. The image data is marked by one of a user and a computer. The image elements are one of a pixel and a voxel. The image data includes unlabeled image elements.
The change in intensities of the image data to edge weights is mapped by a Gaussian weighting function, and is mapped to represent the image data with random walker biases. The Gaussian weighting function is given by

wij=exp(−β(gi−gj)2),

where gi indicates image intensity at image element i, gj indicates image intensity at image element j, and β is a free parameter. The potentials for each image element in the image data are determined by

LUX=−BM, 

where LU is a reduced Laplacian matrix, X is a set of probabilities for each image element in the image data, B is a joining block between labeled and unlabeled image elements in a Laplacian matrix and M is a set of indicator values for indicating values of the labeled image elements.

The determined potentials represent the probability that a random walker starting at an image element in the image data first reaches a seed point in the image data when set to unity. The label assigned to each image element corresponds to

maxs(xis),

where xis is the potential at an image element i corresponding to a label s. The labels assigned to each image element are represented by a color.

The method further comprises: outputting the assigned label and acquiring the image data. The image data is acquired by one of a computed tomographic (CT), helical CT, x-ray, positron emission tomographic (PET), fluoroscopic, ultrasound, and magnetic resonance (MR) imaging technique. The image data may also be acquired by one of a digital camera and a flatbed scanner.
In another embodiment of the present invention, a system for multi-label image segmentation, comprises: a memory device for storing a program; a processor in communication with the memory device, the processor operative with the program to: receive image data including a set of labeled image elements; map a change in intensities of the image data to edge weights; determine potentials for each image element in the image data; and assign a label, based upon the determined potentials, to each image element in the image data. The image data is marked by one of a user and a computer. The image elements are one of a pixel and a voxel. The image data includes unlabeled image elements.
The change in intensities of the image data to edge weights is mapped by a Gaussian weighting function to represent the image data with random walker biases. The random walker is biased to avoid crossing object boundaries. The Gaussian weighting function is given by

wij=exp(−β(gi−gj)2),

where gi indicates image intensity at image element i, gj indicates image intensity at image element j, and β is a free parameter. The change in intensities to edge weights of the image data is mapped to represent the image data with random walker biases. The potentials for each image element in the image data are determined by

LUX=−BM, 

where LU is a reduced Laplacian matrix, X is a set of probabilities for each image element in the image data, B is a joining block between labeled and unlabeled image elements in a Laplacian matrix and M is a set of indicator values for indicating values of the labeled image elements.

The determined potentials represent the probability that a random walker starting at an image element in the image data first reaches a seed point in the image data when set to unity. The label assigned to each image element corresponds to

maxs(xis),

where xis is the potential at an image element i corresponding to a label s. The labels assigned to each image element are represented by a color.

The processor is further operative with the program code to: output the assigned label and acquire the image data. The image data is acquired by one of a CT, helical CT, x-ray, PET, fluoroscopic, ultrasound, and MR imaging technique. The image data may also be acquired by one of a digital camera and a flatbed scanner.
In yet another embodiment of the present invention, a computer program product comprising a computer useable medium having computer program logic recorded thereon for multi-label image segmentation, the computer program logic comprises: program code for receiving image data including a set of labeled image elements; program code for mapping a change in intensities of the image data to edge weights; program code for determining potentials for each image element in the image data; and program code for assigning a label, based upon the determined potentials, to each image element in the image data.
In another embodiment of the present invention, a system for multi-label image segmentation, comprises: means for receiving image data including a set of labeled image elements; means for mapping a change in intensities of the image data to edge weights; means for determining potentials for each image element in the image data; and means for assigning a label, based upon the determined potentials, to each image element in the image data.
In yet another embodiment of the present invention, a method for semi-automatic multi-label image segmentation, comprises: acquiring image data; marking the image data to include a set of labeled image elements; mapping a change in intensities of the image data to edge weights to represent the image data with random walker biases; determining potentials for each image element in the image data, wherein the determined potentials represent the probability that a random walker starting at an image element in the image data first reaches a seed point in the image data set to unity; assigning a label, based upon the determined potentials, to each image element in the image data; and outputting a segmentation of the image data including the assigned labels.
The foregoing features are of representative embodiments and are presented to assist in understanding the invention. It should be understood that they are not intended to be considered limitations on the invention as defined by the claims, or limitations on equivalents to the claims. Therefore, this summary of features should not be considered dispositive in determining equivalents. Additional features of the invention will become apparent in the following description, from the drawings and from the claims.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a block diagram of a system for multi-label image segmentation according to an exemplary embodiment of the present invention;
FIG. 2 illustrates segmenting a graph with unit weights in the presence of seeds with different labels using harmonic functions;
FIG. 3 illustrates segmenting an image with weak boundaries using multi-label image segmentation according to an exemplary embodiment of the present invention;
FIG. 4 is a flowchart showing an operation of a method for multi-label image segmentation according to an exemplary embodiment of the present invention;
FIG. 5 illustrates segmentation results on cardiac image data using multi-label image segmentation according to an exemplary embodiment of the present invention; and
FIG. 6 illustrates segmentation results on brain image data using multi-label image segmentation according to an exemplary embodiment of the present invention.



DETAILED DESCRIPTION OF EXEMPLARY EMBODIMENTS
FIG. 1 is a block diagram of a system 100 for multi-label image segmentation according to an exemplary embodiment of the present invention. As shown in FIG. 1, the system 100 includes, inter alia, a scanning device 105, a personal computer (PC) 110 and an operator's console 115 connected over, for example, an Ethernet network 120. The scanning device 105 may be a magnetic resonance (MR) imaging device, a computed tomography (CT) imaging device, a helical CT device, a positron emission tomography (PET) device, a two-dimensional (2D) or three-dimensional (3D) fluoroscopic imaging device, a 2D, 3D, or four-dimensional (4D) ultrasound imaging device, etc. The scanning device 105 may also be a conventional flatbed scanner that takes in an optical image and digitizes it into an electronic image represented as binary data to create a computerized version of a photo or illustration.
The PC 110, which may be a portable or laptop computer, a personal digital assistant (PDA), etc., includes a central processing unit (CPU) 125 and a memory 130, which are connected to an input 150 and an output 155. The CPU 125 includes a multi-label image segmentation module 145 that includes one or more methods for multi-label image segmentation according to an exemplary embodiment of the present invention.
The memory 130 includes a random access memory (RAM) 135 and a read only memory (ROM) 140. The memory 130 can also include a database, disk drive, tape drive, etc., or a combination thereof. The RAM 135 functions as a data memory that stores data used during execution of a program in the CPU 125 and is used as a work area. The ROM 140 functions as a program memory for storing a program executed in the CPU 125. The input 150 is constituted by a keyboard, mouse, etc., and the output 155 is constituted by a liquid crystal display (LCD), cathode ray tube (CRT) display, printer, etc.
The operation of the system 100 is controlled from the operator's console 115, which includes a controller 165, for example, a keyboard, and a display 160, for example, a CRT display. The operator's console 115 communicates with the PC 110 and the scanning device 105 so that 2D image data collected by the scanning device 105 can be rendered into 3D data by the PC 110 and viewed on the display 160. It is to be understood that the PC 110 can be configured to operate and display information provided by the scanning device 105 absent the operator's console 115, using, for example, the input 150 and output 155 devices to execute certain tasks performed by the controller 165 and display 160.
The operator's console 115 further includes any suitable image rendering system/tool/application that can process digital image data of an acquired image dataset (or portion thereof) to generate and display 2D and/or 3D images on the display 160 using, for example, a 3D graphics card. More specifically, the image rendering system may be an application that provides 2D/3D rendering and visualization of image data, and which executes on a general purpose or specific computer workstation. The PC 110 may also include an image rendering system/tool/application for processing digital image data of an acquired image dataset to generate and display 2D and/or 3D images.
As shown in FIG. 1, the multi-label image segmentation module 145 is also used by the PC 110 to receive and process digital image data, which as noted above, may be in the form of raw image data, 2D reconstructed data (e.g., axial slices), or 3D reconstructed data such as volumetric image data or multiplanar reformats, or any combination of such formats. The data processing results can be output from the PC 110 via the network 120 to an image rendering system in the operator's console 115 for generating 2D and/or 3D renderings of image data in accordance with the data processing results, such as segmentation of organs or anatomical structures, color or intensity variations, and so forth.
Before discussing the method for multi-label image segmentation according to an exemplary embodiment of the present invention, the theory and processes by which it was derived will first be discussed.
Multi-Label Image Segmentation Algorithm
It is to be understood that the term “pixel” as used herein refers to a 2D image element and the term “voxel” as used herein refers to a 3D image element. In addition, the algorithm to be presented herein can be applied to image data having 2D, 3D or an arbitrary number of dimensions. For ease of exposition, the term “pixel” will be used throughout.
The multi-label image segmentation algorithm presented herein is an algorithm that can be used to perform semi-automatic image segmentation given labeled pixels specified by a medical practitioner or computer. The algorithm was formulated by assuming, for example, that a medical practitioner has labeled P pixels (termed “seeds”) with one of K labels. Then, for each unlabeled pixel in the set of image data, determining the probability that a random walker starting at this location (i.e., an arbitrary unlabeled pixel) first reaches a seed point with each of the K labels.
Using the algorithm, the probability that a random walker starting at the location first reaches each of the K seed points may be determined without simulating a random walk. Instead, by analogy with circuit theory, these probabilities may be computed by solving a system of linear equations for each label. Thus, a K-tuple vector is computed for each pixel that specifies the probability that a random walker starting from the unlabeled pixel will first reach a seed pixel bearing each of K labels. A final segmentation is then derived from the K-tuples by selecting for each pixel the most probable seed destination for a random walker starting from that location.
In a uniform image (e.g., an all black image), it is known that this segmentation approach will produce a segmentation that roughly corresponds to Voronoi cells for each of the seed points. This segmentation is termed a neutral segmentation because it does not take into account any information from the image. By biasing the random walker to avoid crossing sharp intensity gradients, a quality segmentation is obtained that respects object boundaries including, for example, weak boundaries.
It has been established that the probability a random walker reaches a seed point with a label s equals the solution to the Dirichlet problem obtained by fixing unity Dirichlet boundary conditions at seeds labeled s and fixing a zero boundary condition at seeds with labels not equal to s. The solution to the discrete Dirichlet problem on an arbitrary graph is given by the distribution of electric potentials on the nodes of an electrical circuit with resistors representing the inverse of weights (i.e., the weights represent conductance) and boundary conditions given by voltage sources fixing the electric potential at boundary nodes (i.e., seeds). For the remainder of this discussion, the terminology of circuit theory will be used to describe the algorithm, with, for example a potential xis indicating the probability that a walker starting at node vi first reaches a seed point with the label s.
A function that solves the Dirichlet problem for a given set of boundary conditions (i.e., the random walker probabilities) is known as a harmonic function. FIG. 2 illustrates harmonic functions and a subsequent segmentation obtained for a 4×4 graph with unit weights in the presence of three seeds with different labels. As shown in FIG. 2, the three seed points with three different labels (i.e., L1, L2, L3), alternately fix the potential of each label to unity (i.e., with a voltage source tied to ground) and set the remaining nodes to zero (i.e., ground). The calculated electric potentials represent the probability that a random walker starting at each node first reaches the seed point currently set to unity. Image (a) of FIG. 2 shows the initial seed points and the segmentation resulting from assigning each node the label that corresponds to its greatest probability. Images (b), (c) and (d) of FIG. 2 show the probability that a random walker starting from each node first reaches seeds L1, L2 and L3, respectively.
In light of the equivalence between random walks on graphs and discrete potential theory, the probability that a random walker starting at pixel vi first reaches a seed with the label s, is calculated by solving the circuit theory problem that corresponds to a discrete analog of the Dirichlet problem. All seed points belonging to labels other than s are grounded (i.e., their potential is set to zero). A unit voltage source with ground that fixes the s-labeled seeds to have a unit potential is then established.
The electric potentials established at each unlabeled node provide the probabilities that a walker originating from that node will first reach the seed with the label s. The electric potentials may be calculated through the solution of a system of sparse linear equations (described below under the heading “Discrete Dirichlet Problem”). The full K-tuple may be calculated by finding the potentials established through switching “on” (e.g., by providing a unit voltage source thereto) each labeled collection of nodes and “off” (e.g., by grounding) the remaining labeled nodes. As a result, K−1 systems of linear equations must be solved. By linearity (i.e., the principle of superposition in circuit theory), the calculated potentials must sum to unity. This enables one of the systems to be solved by subtracting the sum of the calculated potentials from unity to find the last entry in the full K-tuple.
Before discussing specific aspects of the multi-label segmentation algorithm, a graph must be defined for explanatory purposes. In particular, a graph consists of a pair G=(V, E) with vertices (nodes) v∈V and edges e∈E⊂V×V. An edge, e, spanning two vertices, vi and vj, is denoted by eij. A weighted graph assigns a value to each edge called a weight. The weight of an edge, eij, is denoted by w(eij) or wij. The degree of a vertex di=Σw(eij) for all edges eij incident on vi. In order to interpret wij as the bias affecting a random walker's choice, wij>0 is required. The following discussion will assume the graph is connected.
Edge Weights
In order to represent an image structure (composed of pixels) by random walker biases (i.e., edge weights), a function that maps a change in image intensities of the image to weights of the underlying graph must be determined. Several known weighting functions may be employed such as the Gaussian weighting function or pre-smoothed variants with various kernels. For purposes of this description, however, the Gaussian weighting function given by

wij=exp(−β(gi−gj)2),  [1]

will be used. Where gi indicates the image intensity a pixel i and gj indicates image intensity at image element j. The value of β is a free parameter.

Discrete Dirichlet Problem

As the discrete Dirichlet problem has been thoroughly discussed in previous works such as Norman Biggs' “Algebraic Potential Theory on Graphs” (Bulletin of London Mathematics Society, 1997, 29, pp. 641-682), its application to the multi-label image segmentation algorithm will only be discussed here.
When solving the discrete Dirichlet problem the discrete Laplacian matrix is defined as,




  
    
      
        
          L
          
            
              v
              i
            
            ⁢
            
              v
              j
            
          
        
        =
        
          {
          
            
              
                
                  d
                  
                    v
                    i
                  
                
              
              
                
                  
                    
                      if
                      ⁢
                      
                        
                      
                      ⁢
                      i
                    
                    =
                    j
                  
                  ,
                
              
            
            
              
                
                  -
                  
                    w
                    ij
                  
                
              
              
                
                  
                    if
                    ⁢
                    
                      
                    
                    ⁢
                    
                      v
                      i
                    
                    ⁢
                    
                      
                    
                    ⁢
                    and
                    ⁢
                    
                      
                    
                    ⁢
                    
                      v
                      j
                    
                    ⁢
                    
                      
                    
                    ⁢
                    are
                    ⁢
                    
                      
                    
                    ⁢
                    adjacent
                    ⁢
                    
                      
                    
                    ⁢
                    nodes
                  
                  ,
                
              
            
            
              
                0
              
              
                
                  otherwise
                  ,
                
              
            
          
        
      
    
    
      
        [
        2
        ]
      
    
  




where Lvivj is used to indicate that the matrix L is indexed by vertices vi and vj.

The vertices vi and vj are partitioned into two sets, VM (i.e., marked/seed nodes) and VU (i.e., unmarked nodes) such that VM∪VU=V and VM∩VU=0. VM contains all seed points irrespective of their labels. The matrix L is reordered as such to reflect its subsets




  
    
      
        L
        =
        
          [
          
            
              
                
                  L
                  M
                
              
              
                B
              
            
            
              
                
                  B
                  T
                
              
              
                
                  L
                  U
                
              
            
          
          ]
        
      
    
    
      
        [
        3
        ]
      
    
  




Next, the probability (i.e., the potential) assumed at each node, vi, for each label s, by xis is denoted. The set of labels for the seed points are defined as a function Q(vj)=s, ∀vj∈VM, where s∈Z,0<s≦K. The marked vector |VM|×1 is defined (where |.| denotes cardinality) for each label, s, at node vj∈VM as




  
    
      
        
          m
          j
          s
        
        =
        
          {
          
            
              
                1
              
              
                
                  
                    
                      if
                      ⁢
                      
                        
                      
                      ⁢
                      
                        Q
                        ⁡
                        
                          (
                          
                            v
                            j
                          
                          )
                        
                      
                    
                    =
                    s
                  
                  ,
                
              
            
            
              
                0
              
              
                
                  
                    if
                    ⁢
                    
                      
                    
                    ⁢
                    
                      Q
                      ⁡
                      
                        (
                        
                          v
                          j
                        
                        )
                      
                    
                  
                  ≠
                  
                    s
                    .
                  
                
              
            
          
        
      
    
    
      
        [
        4
        ]
      
    
  




The combinatorial Dirichlet problem may then be found by solving

LUxs=−Bms,  [5]

which is a sparse, symmetric, positive-definite, system of linear equations with |VU| number of equations and a number of nonzero entries equal to 2|E|. Because LU is guaranteed to be nonsingular for a connected graph, the solution xs is guaranteed to exist and be unique. Therefore, the potentials for all the labels may be found by solving

LUX=−BM,  [6]

where X has columns taken by each xs and M has columns given by each ms. Therefore, there are K−1 sparse linear systems to solve, where K is the total number of labels.

Theoretical Properties of the Multi-Label Image Segmentation Algorithm

Several theoretical properties and/or propositions of the multi-label image segmentation algorithm will now be discussed. First, if an interpolation is desired between the solution for a particular image and the neutral segmentation, this may be achieved through the addition of a constant to the weights. Second, an ideal weighting function will produce weights such that the presence of independent random noise at the pixel level produces uncorrelated multiplicative noise at the level of the weights. Finally, it will be shown that a segmentation using the multi-label image segmentation algorithm in the case of pure or almost pure noise is expected to be the neutral segmentation.
The following two properties: (1) a potential 0≦xis≦1, ∀i, s (maximum/minimum principle) and (2) the potential of each unlabeled node assumes the weighted average of its neighboring nodes, are discrete analogues of properties of continuous harmonic functions and may be seen directly by viewing the solution to the combinatorial Dirichlet problem as a solution to the discrete Laplace equation (with Dirichlet boundary conditions), where the potential of each unlabeled node must satisfy




  
    
      
        
          
            x
            i
            s
          
          =
          
            
              1
              
                d
                i
              
            
            ⁢
            
              
                ∑
                
                  
                    e
                    ij
                  
                  ∈
                  E
                
              
              ⁢
              
                
                  w
                  ⁡
                  
                    (
                    
                      e
                      ij
                    
                    )
                  
                
                ⁢
                
                  x
                  j
                  s
                
              
            
          
        
        ,
      
    
    
      
        [
        7
        ]
      
    
  




where xjs∈V (may include seed points).

Addressing the first proposition, if the final segmentation is determined from the potentials using the above rule (i.e., the node vi is assigned to a segment s, only if xis>xif∀ƒ≠s), then each node assigned to the segment s is connected through a path of nodes also assigned to the segments and to at least one of the seed points with a label s. In other words, the connected components generated by the final segmentation must contain at least one seed point bearing that label.
The result follows if it can be shown that any connected subset P⊂VU assigned to the segment s must be connected to at least one node that is also labeled s. A block matrix form of equation [7] may be written as

LPxPs=−RPx Ps,  [8]

where xs=[xPs, x Ps]T, L has been decomposed into the block form





  
    
      
        
          L
          =
          
            [
            
              
                
                  
                    L
                    P
                  
                
                
                  
                    R
                    P
                  
                
              
              
                
                  
                    R
                    P
                    T
                  
                
                
                  
                    L
                    
                      P
                      _
                    
                  
                
              
            
            ]
          
        
        ,
      
    
    
      
        [
        9
        ]
      
    
  




and P denotes the set complement of P in V. For example, in the case of P {vi} in equation [7], LP=di and





  
    
      -
      
        R
        P
      
    
    ⁢
    
      x
      
        P
        _
      
      s
    
  
  =
  
    
      ∑
      
        
          e
          ij
        
        ∈
        E
      
    
    ⁢
    
      
        w
        ⁡
        
          (
          
            e
            ij
          
          )
        
      
      ⁢
      
        
          x
          j
          s
        
        .
      
    
  




If xPs>xPf∀f≠s, then xPs−xPf>0 and




  
    
      -
      
        L
        P
        
          -
          1
        
      
    
    ⁢
    
      
        R
        P
      
      ⁡
      
        (
        
          
            x
            
              P
              _
            
            s
          
          -
          
            x
            
              P
              _
            
            J
          
        
        )
      
    
  
  >
  0.




The entries of RP are nonpositive by definition of L. Because L is an M-matrix, any block diagonal submatrix of the M-matrix is also an M-matrix, and the inverse of the M-martix has nonnegative entries, then −LP−1R has nonnegative entries and therefore, some xis∈ P must be greater than xif∈ P. Further, because the entries of RP are zero for modes not connected to P, the nodes in P satisfying the inequality must be connected to a node in P.

Proof of the remaining theoretical propositions rest on the following lemma. That is, for random variables, X, A and B,




  X
  =
  
    
      A
      B
    
    .
  




E[X]=0 if E[A]=0 and B>0.

Addressing the second proposition, by the Hölder inequality E[A]=E[X B]≦E[X]E[B]. By the same inequality,




  
    E
    ⁡
    
      [
      X
      ]
    
  
  =
  
    
      E
      ⁡
      
        [
        
          A
          B
        
        ]
      
    
    ≤
    
      
        E
        ⁡
        
          [
          A
          ]
        
      
      ⁢
      
        
          E
          ⁡
          
            [
            
              1
              B
            
            ]
          
        
        .
      
    
  




Therefore,





  
    
      
        E
        ⁡
        
          [
          A
          ]
        
      
      
        E
        ⁡
        
          [
          B
          ]
        
      
    
    ≤
    
      E
      ⁡
      
        [
        X
        ]
      
    
    ≤
    
      
        E
        ⁡
        
          [
          A
          ]
        
      
      ⁢
      
        E
        ⁡
        
          [
          
            1
            B
          
          ]
        
      
    
  
  ,




and the result is provided. Because it is known that there is a relationship between the potentials solved for in equation [5] and the weighted tree structure of the graph. The following relationship for the potential at node vi in the presence of unit voltage sources (tied to ground) is given by





  
    
      
        
          
            x
            i
            s
          
          =
          
            
              
                ∑
                
                  TT
                  ∈
                  
                    TT
                    i
                  
                
              
              ⁢
              
                
                  ∏
                  
                    
                      e
                      ij
                    
                    ∈
                    TT
                  
                
                ⁢
                
                  w
                  ⁡
                  
                    (
                    
                      e
                      ij
                    
                    )
                  
                
              
            
            
              
                ∑
                
                  TT
                  ∈
                  
                    TT
                    C
                  
                
              
              ⁢
              
                
                  ∏
                  
                    
                      e
                      ij
                    
                    ∈
                    TT
                  
                
                ⁢
                
                  w
                  ⁡
                  
                    (
                    
                      e
                      ij
                    
                    )
                  
                
              
            
          
        
        ,
      
    
    
      
        [
        10
        ]
      
    
  




where TTi is the set of 2-trees present in the graph, such that node vi is connected to a seed with a label s, and TTG is the set of all possible 2-trees in the graph. A 2-tree is defined as a tree with one edge removed. Note that TTi⊂TTG∀vi with equality holding if vi is the seed point labeled s. In other words, in equation [10], if you sum over the product of the weights in every 2-tree that has vi connected to a seed with the label s and divide that sum by the sum of the product of the weights of the edges in every 2-tree that exists in the graph, that ratio is equal to the potential found by solving equation [5].

If the weights are uniform as shown in the neutral case, equation [10] yields potentials satisfying




  
    
      
        
          
            x
            i
            s
          
          =
          
            
              
              
                TT
                i
              
              
            
            
              
              
                TT
                G
              
              
            
          
        
        ,
      
    
    
      
        [
        11
        ]
      
    
  




Thus, a series of propositions about xs under different conditions can be proved. For example, if the set of weights wij are identically distributed (not necessarily independent) random variables, with wij>0, then E[xis] equals the potential obtained in the neutral segmentation. This proposition is proved using the lemma. Next, the potential for the label s at vi for the neutral segmentation by nis is denoted. The complement of TTi in TTG as TTC is denoted as TTi∪TTC=and TTi∩TTC=0. For brevity, the following is also denoted STTi=ΣTT∈TTiΠeij∈TTw(eij). E[xis−nis] is given by the following equation,




  
    
      
        
          E
          ⁡
          
            [
            
              
                x
                i
                s
              
              -
              
                n
                i
                s
              
            
            ]
          
        
        =
        
          
            E
            ⁡
            
              [
              
                
                  
                    S
                    
                      TT
                      i
                    
                  
                  
                    
                      S
                      
                        TT
                        i
                      
                    
                    +
                    
                      S
                      
                        TT
                        C
                      
                    
                  
                
                -
                
                  
                    
                    
                      TT
                      i
                    
                    
                  
                  
                    
                      
                      
                        TT
                        i
                      
                      
                    
                    +
                    
                      
                      
                        TT
                        C
                      
                      
                    
                  
                
              
              ]
            
          
          .
        
      
    
    
      
        [
        12
        ]
      
    
  




Because each of the 2-trees will contain an equal number of edges (n−2), and all the weights are identically distributed, STTi will contain the sum of |TTi| identically distributed random variables. For the following discussion μ will denote the mean of the distribution of these new variables.
After combining terms, the numerator of equation [12] is given by

E[STTi(|TTi|+|TTC|)−|TTi|(STTi+STTC)]=μ|TTi|(|TTi|+|TTC|)−|TTi|(μ|TTi|+μ|TTC|)=0  [13]

and the denominator of equation [12] must be positive because all the wij are guaranteed to be positive. Therefore, the conditions of the lemma are satisfied for the left hand side of equation [12] to be equal to zero and E[xis]=nis.

Because the following two propositions may be proved using the technique just described they will not be proved herein in an effort to avoid repetition. First, if the set of weights wij are uncorrelated (not necessarily independent) random variables with corresponding means μij, then E[xis] equals the potential obtained by setting wij=kij. Second, if wij=kijyij, where the kij are (not necessarily equal) constants and yij are identically distributed random variables such that yij>0, then E[xis] equals the potential obtained by setting wij=kij.
As another proposition, if wij=kij+r, where kij are (not necessarily equal) constants and r is a constant added to all weights, limr→∞xis=nis, where nis is the potential obtained in the neutral segmentation. In order to prove this, the potential for node vi is expressed as




  
    
      
        
          
            x
            i
            s
          
          =
          
            
              
                
                  ∑
                  
                    TT
                    ∈
                    
                      TT
                      i
                    
                  
                
                ⁢
                
                  
                    ∏
                    
                      eij
                      ∈
                      TT
                    
                  
                  ⁢
                  
                    (
                    
                      
                        k
                        ij
                      
                      +
                      r
                    
                    )
                  
                
              
              
                
                  ∑
                  
                    TT
                    ∈
                    
                      TT
                      G
                    
                  
                
                ⁢
                
                  
                    ∏
                    
                      eij
                      ∈
                      TT
                    
                  
                  ⁢
                  
                    (
                    
                      
                        k
                        ij
                      
                      +
                      r
                    
                    )
                  
                
              
            
            =
            
              
                
                  
                    
                    
                      TT
                      i
                    
                    
                  
                  ⁢
                  
                    r
                    
                      N
                      -
                      2
                    
                  
                
                +
                
                  O
                  ⁡
                  
                    (
                    
                      r
                      
                        N
                        -
                        3
                      
                    
                    )
                  
                
              
              
                
                  
                    
                    
                      TT
                      G
                    
                    
                  
                  ⁢
                  
                    r
                    
                      N
                      -
                      2
                    
                  
                
                +
                
                  O
                  ⁡
                  
                    (
                    
                      r
                      
                        N
                        -
                        3
                      
                    
                    )
                  
                
              
            
          
        
        ,
      
    
    
      
        [
        14
        ]
      
    
  




where O(•) indicates a term order of no greater than the argument. Thus, by l'Hôpital's Rule,





  
    
      
        
          
            lim
            
              r
              ->
              ∞
            
          
          ⁢
          
            x
            i
            s
          
        
        =
        
          
            
              
              
                TT
                i
              
              
            
            
              
              
                TT
                G
              
              
            
          
          =
          
            
              n
              i
              s
            
            .
          
        
      
    
    
      
        [
        15
        ]
      
    
  




Numerical Practicalities

In order to perform the multi-label segmentation algorithm quickly and effectively any number of techniques used to solve large, sparse or symmetric linear systems of equations may be used. These techniques generally fall into two categories employing direct and iterative methods. A direct method, for example LU decomposition with partial pivoting, has an advantage that the computation necessary to solve equation [6] is only negligibly increased over the amount of work required to solve equation [5]. As current medical data volumes frequently exceed 256×256×256≈16e6 voxels and thus require an equal number of equations, most conventional computers do not have enough memory to allow an LU decomposition with that number of equations.
The standard alternative to the class of direct solvers for large, sparse systems is the class of iterative solvers such as the Gauss-Siedel relaxation or conjugate gradients. These solvers have the advantage of a small memory requirement and the ability to represent the matrix-vector multiplication as a function. For example, because the matrix LU for a lattice has a circulant nonzero structure (although the coefficients are changing), one may avoid storing the matrix entirely. Instead, a vector of weights may be stored (or quickly computed, if memory is at a premium) and the operation LUxUs may be performed in a relatively inexpensive fashion. Further, sparse matrix operations (such as those required for conjugate gradients) may be efficiently parallelized for use on, for example, the CPU 125. Due to the relationship between equation [5] and a finite differences approach to solving the Dirichlet problem on a hypercube domain, techniques for numerical solutions to PDEs (partial differential equations) may also be applied. Most notably, the multi-grid method discussed in Briggs, William and Hansen, Van Emden and McCormick, Steve, “A Multigrid Tutorial”, (SIAM Press 2000) achieves near optimal performance when solving, for example, equation [5].
For illustrative purposes, a standard conjugate gradients algorithm with Jacobi preconditioning, representing the matrix-vector multiplication, was implemented on an Intel® XeonTM 2.4 GHz dual-processor with 1 GB of RAM. Equation [5] was solved using conjugate gradients (having a tolerance=1e−4, sufficient for the algorithm) for a 256×256 image with two randomly placed seed points and took 4.831 seconds.
Weak Boundaries
Unlike region growing approaches, one aspect of the random walker motivation for the multi-label image segmentation algorithm is that weak object boundaries will be found when they are part of a consistent boundary. As shown, for example, in image (a) of FIG. 3, a random walker starting on one side of a weak boundary (i.e., a hole in the thick black line) wanders until first striking one of the two labeled nodes or seeds (i.e., the left and right filled circles). On a four-connected lattice, the walker has three initial steps that keep it on one side of the boundary. Because other nodes on that side of the boundary are all very likely to first reach seed 1 (i.e., the right filled circle), this walker is also very likely to first reach seed 1. For the same reasons, a walker on the other side of the weak boundary is also very likely to first reach seed 2 (i.e., the left filled circle). Consequently, there will be a sharp potential drop over the entire boundary, resulting in the correct segmentation. Image (b) of FIG. 3, shows the segmentation obtained for a synthetic image with four areas of varying sizes and convexity with weak boundaries and a few labeled nodes. Thin black lines represent the “object” boundaries in the image, thick black patches represent the labeled seeds of four different object markers and the shaded regions correspond to the resulting segmentation.
FIG. 4 is a flowchart showing an operation of a method for multi-label image segmentation according to an exemplary embodiment of the present invention. As shown in FIG. 4, image data is acquired from, for example, an anatomical body part (step 410). This is accomplished by using the scanning device 105, in this example a CT scanner, which is operated at the operator's console 115, to scan the anatomical body part thereby generating a series of 2D images associated with the body part. The 2D images of the anatomical body part may then be converted or transformed into a 3D rendered image. Although the image data is described here as being acquired via the scanning device 105, it is to be understood that the image data may be acquired, for example, by taking a picture with a camera and scanning it using a conventional flatbed scanner or by taking a picture with a digital camera and uploading the image data to the PC 110.
After acquiring the image data, the image data is marked to obtain a set of labeled pixels (step 420). The image data may be marked by a medical practitioner using, for example, a mouse to select a portion of the image on the display 160 of the operator's console 115. In addition, the marked data could be provided from the PC 110 by using previously marked data stored in its memory 130. Subsequent to marking the image data or receiving the marked image data, a change in intensities of the image data to edge weights is mapped (step 430). The change in intensities of the image data to edge weights may be mapped using equation [1].
Once the change in intensities of the image data to edge weights is mapped, potentials for each pixel in the image data are determined (step 440). The potentials are determined using equation [6]. After determining the potentials, labels are assigned (using the potentials) to each pixel in the image data (step 450). The assigned labels correspond to maxs (xis). After the labels are assigned they may then be output to a user for review or to another software program used, for example, by the Siemens Medical Solutions Lung Combined Applications to Reduce Exposure (CARETM) package, for analysis (step 460).
FIG. 5 shows multi-label image segmentation results on two CT cardiac images and FIG. 6 shows multi-label image segmentation results on two MR brain images. The images and seeds demonstrate the general applicability of the semi-automatic multi-label image segmentation approach on objects of varying uniformity, size, shape, contrast, and topology. In FIGS. 5 and 6 the value of the free parameter, β, in equation [1] was kept constant despite the different characteristics of CT and MR images.
Image (a) in FIG. 5 uses four groups of seeds corresponding to the left ventricle, right ventricle, myocardial wall and the background, while image (b) in FIG. 5 segments the entire heart from the background. Images (a) and (b) of FIG. 6 have three segments each. Image (a) of FIG. 6 shows the corpus callosum and cerebellum segmented from the background and image (b) shows the thalamus and cerebellum segmented from the background.
The multi-label image segmentation algorithm according to an exemplary embodiment of the present invention is based on using a small set of pre-labeled pixels. The pre-labeled pixels may be either generated automatically for a particular purpose, or they may be given directly by a medical practitioner. The algorithm functions by assigning each unlabeled pixel to the label of the seed point that a random walker starting from that pixel would be most likely to reach first, given that it is biased to avoid crossing object boundaries (i.e., intensity gradients). Because the algorithm is formulated on a general graph, and produces segmentations based on the separation of quantities defined at the nodes (i.e., the potentials), the graph or lattice may represent any dimension or topology.
The algorithm has been demonstrated on real images, for example, in FIGS. 5 and 6, and has shown that it provides a unique solution that is robust to weak object boundaries and that uses a medical practitioner's labeling choices. Further, there is only one single free parameter, β, in equation [1], and all the segmentations shown in FIGS. 5 and 6 were computed using the same parameter. It is to be understood, however, that the algorithm according to the present invention could be used with pre-filters (e.g., median) or post-filters (e.g., clustering) to produce enhanced results. In addition, because the PDE (basically a Laplace equation with Dirichlet boundary conditions) is formulated on a graph there are limited, if any, concerns about discretization errors or variations in a hardware implementation.
It is to be understood that because some of the constituent system components and method steps depicted in the accompanying figures may be implemented in software, the actual connections between the system components (or the process steps) may differ depending on the manner in which the present invention is programmed. Given the teachings of the present invention provided herein, one of ordinary skill in the art will be able to contemplate these and similar implementations or configurations of the present invention.
It is to be further understood that the present invention may be implemented in various forms of hardware, software, firmware, special purpose processors, or a combination thereof. In one embodiment, the present invention may be implemented in software as an application program tangibly embodied on a program storage device (e.g., magnetic floppy disk, RAM, CD ROM, DVD, ROM, and flash memory). The application program may be uploaded to, and executed by, a machine comprising any suitable architecture.
It should also be understood that the above description is only representative of illustrative embodiments. For the convenience of the reader, the above description has focused on a representative sample of possible embodiments, a sample that is illustrative of the principles of the invention. The description has not attempted to exhaustively enumerate all possible variations. That alternative embodiments may not have been presented for a specific portion of the invention, or that further undescribed alternatives may be available for a portion, is not to be considered a disclaimer of those alternate embodiments. Other applications and embodiments can be straightforwardly implemented without departing from the spirit and scope of the present invention.
It is therefore intended that the invention not be limited to the specifically described embodiments, because numerous permutations and combinations of the above and implementations involving non-inventive substitutions for the above can be created, but the invention is to be defined in accordance with the claims that follow. It can be appreciated that many of those undescribed embodiments are within the literal scope of the following claims, and that others are equivalent.

## Claims

1. A method for multi-label image segmentation, comprising:
receiving image data including a set of labeled image elements;
mapping a change in intensities of the image data to edge weights;
determining potentials for each image element in the image data based on the edge weights; and
assigning a label from a set of labels, based upon the determined potentials, to each image element in the image data;
wherein the label assigned to each image element corresponds to maxs(xxi)
where maxs is to maximize over variable s which takes value from the set of labels, xxiis the potential at an image element i corresponding to a label s.

2. The method of claim 1, wherein the image data is marked by one of a user and a computer.

3. The method of claim 1, wherein the image elements are one of a pixel and a voxel.

4. The method of claim 1, wherein the image data includes unlabeled image elements.

5. The method of claim 1, wherein the change in intensities of the image data to edge weights is mapped by a Gaussian weighting function.

6. The method of claim 5, wherein the Gaussian weighting function is given by


wij=exp(−β(gi−gj)2),


where gi indicates image intensity at image element i, gj indicates image intensity at image element j, and β is a free parameter.

7. The method of claim 1, wherein the change in intensities of the image data to edge weights is mapped to represent the image data with random walker biases.

8. The method of claim 1, wherein the potentials for each image element in the image data are determined by


LUX=−BM, 


where LU is a reduced Laplacian matrix, X is a set of probabilities for each image element in the image data, B is a joining block between labeled and unlabeled image elements in a Laplacian matrix and M is a set of indicator values for indicating values of the labeled image elements.

9. The method of claim 1, wherein the determined potentials represent the probability that a random walker starting at an image element in the image data first reaches a seed point in the image data when the seed point is set to unity.

10. The method of claim 1, wherein the labels assigned to each image element are represented by a color.

11. The method of claim 1, further comprising:
outputting the assigned label.

12. The method of claim 1, further comprising:
acquiring the image data.

13. The method of claim 12, wherein the image data is acquired by one of a computed tomographic (CT), helical CT, x-ray, positron emission tomographic (PET), fluoroscopic, ultrasound, and magnetic resonance (MR) imaging technique.

14. The method of claim 12, wherein the image data is acquired by one of a digital camera and a flatbed scanner.

15. A system for multi-label image segmentation, comprising:
a memory device for storing a program;
a processor in communication with the memory device, the processor operative with the program to:
receive image data including a set of labeled image elements;
map a change in intensities of the image data to edge weights;
determine potentials for each image element in the image data base don the edge weights; and
assign a label from a set of labels, based upon the determined potentials, to each image element in the image data,

wherein the label assigned to each image element corresponds to maxs(xis)
where maxs is to maximize over variable s which takes value from the set of labels, xis is the potential at an image element i corresponding to a lable s.

16. The system of claim 15, wherein the image data is marked by one of a user and a computer.

17. The system of claim 15, wherein the image elements are one of a pixel and a voxel.

18. The system of claim 15, wherein the image data includes unlabeled image elements.

19. The system of claim 15, wherein the change in intensities of the image data to edge weights are mapped by a Gaussian weighting function to represent the image data with random walker biases.

20. The system of claim 19, wherein the Gaussian weighting function is given by


wij=exp(gi−gj)2),


where gi indicates image intensity at image element i, gj indicates image intensity at image element j, and β is a free parameter.

21. The system of claim 19, wherein the random walker is biased to avoid crossing object boundaries.

22. The system of claim 15, wherein the potentials for each image element in the image data are determined by


LUX=−BM, 


where LU is a reduced Laplacian matrix, X is a set of probabilities for each image element in the image data, B is a joining block between labeled and unlabeled image elements in a Laplacian matrix and M is a set of indicator values for indicating values of the labeled image elements.

23. The system of claim 15, wherein the determined potentials represent the probability that a random walker starting at an image element in the image data first reaches a seed point in the image data when the seed point is set to unity.

24. The system of claim 15, wherein the labels assigned to each image element are represented by a color.

25. The system of claim 15, wherein the processor is further operative with the program code to:
output the assigned label.

26. The system of claim 15, wherein the processor is further operative with the program code to:
acquire the image data.

27. The system of claim 26, wherein the image data is acquired by one of a computed tomographic (CT), helical CT, x-ray, positron emission tomographic (PET), fluoroscopic, ultrasound, and magnetic resonance (MR) imaging technique.

28. The system of claim 26, wherein the image data is acquired by one of a digital camera and a flatbed scanner.

29. A computer readable storage medium storing computer program code that, when executed by a computer, causes the computer to perform multi-label image segmentation, the computer program logic comprising:
program code for receiving image data including a set of labeled image elements;
program code for mapping a change in intensities of the image data to edge weights;
program code for determining potentials for each image element in the image data based on the edge weights; and
program code for assigning a label from a set of labels, based upon the determined potentials, to each image element in the image data,
wherein the label assigned to each image element corresponds to maxs(xis)
where maxs is to maximize over variable s which takes value from the set of lables, xjs is the potential at an image element i corresponding to a label s.

30. A system for multi-label image segmentation, comprising:
means for receiving image data including a set of labeled image elements;
means for mapping a change in intensities of the image data to edge weights;
means for determining potentials for each image element in the image data based on the edge weights; and
means for assigning a label form a set of labels, based upon the determined potentials, to each image element in the image data,
wherein the label assigned to each image element corresponds to maxs(xis)
where maxs is to maximize over variable s which takes value from the set of lables, xjs is the potential at an image element i corresponding to a label s.

31. A method for semi-automatic multi-label image segmentation, comprising:
acquiring image data;
marking the image data to include a set of labeled image elements;
mapping a change in intensities of the image data to edge weights to represent the image data with random walker biases;
determining potentials for each image element in the image databased on the edge weights, wherein the determined potentials represent the probability that a random walker starting at an image element in the image data first reaches a seed point in the image data set to unity;
assigning a label from a set of labels, based upon the determined potentials, to each image element in the image data; and
outputting a segmentation of the image data including the assigned label s,
wherein the label assigned to each image element corresponds to maxs(xis) 
where maxs is to maximize over variable s which takes value from the set of lables, xjs is the potential at an image element i corresponding to a label s.