# Patent

## Title
Microscopic image fusion method based on region growing

## Abstract

A microscopic image fusion method based on region growing judges the fuzzy degree of the microscopic image and determines the fuzzy seed block by evaluating the definition of every image block in the microscopic image. Then, the fuzzy region and clear region are exactly segmented by region growing and are marked. Finally, a clear and high-quality microscopic image, fused by a plurality of microscopic images, is obtained. Due to the combination of the definition evaluation of the microscopic image, and segmentation of the fuzzy region and clear region by region growing, the fusion results of the microscopic image of the present invention show great advantages at the subjective human perception and the objective evaluation. Furthermore, the present invention has simple calculation and stable result, is easy to be implemented and adapted for fusing the digital optical microscopic images which are shot by shallow depth of field.

## Background
BACKGROUND OF THE PRESENT INVENTION
1. Field of Invention
The present invention relates to an image processing technology, and more particularly to a microscopic image fusion method based on region growing.
2. Description of Related Arts
In the optical microscope imaging system, with the increase of the magnification, the depth of field is getting smaller and smaller. Therefore, only those targets at the focal plane or the vicinity thereof are clearly visible, so that even if it has the simplest structure and the relatively flat three-dimensional depth, it is impossible for the object to completely clearly focus in an image. In practical applications of many fields, it is required that the microscopic imaging should not only have high magnification, but also reach a sufficient depth of field, such as the fiber observation of textile industry and the quality inspection of printed circuit board industry. To resolve the above-mentioned technical problem, it is required that the focal length of the optical microscope should be constantly adjusted for obtaining a series of partially clear images, and then the series of partially clear images are inputted into a computer for fusing to obtain the complete and clear image of an object in the whole space. Therefore, the disadvantage that only one focal plane of an object is clearly visible while directly observing by an optical microscope, and the complete and clear image of the object in the whole space are invisible is overcome.
The existing image fusion method is mainly divided into three categories: the pixel-level image fusion method, the feature-level image fusion method and the decision-level image fusion method. The pixel-level image fusion method fuses on the foundation level. Its main advantage is that the fused image contains as many original data as possible, and the accuracy of the fusion is highest, thereby providing the detail information which other fusion levels cannot provide. In general, it processes pixels in the transform domain by means of the wavelet transform or other transformation methods, thus it has relatively higher fusion complexity. The feature-level image fusion method acquires the information from the pre-processed and feature-extracted original input image, such as the comprehensive treatment of the contour, shape, edge and region information. Generally, its implementation needs more empirical parameters. For variable objects, the instability of theirs feature extraction will bring the deviation to the fusion. The decision-level image fusion method makes the optimal fusion decision according to certain criteria and the feasible degree of every decision. However, due to a variety of decision criteria, it needs manual intervention and is difficult to achieve the automatic fusion.
SUMMARY OF THE PRESENT INVENTION
The technical problem to be resolved of the present invention is to provide a microscopic image fusion method based on region growing, which has simple calculation and stable results, and is capable of effectively improving the results of subjective perception and objective evaluation.
To resolve the above-mentioned technical problem, the technical solution of the present invention is described as follows. A microscopic image fusion method based on region growing is characterized by comprising steps of:
(1) setting {IS1(x,y)} to one microscopic image collected under an optical microscope, and setting {IS2(x,y)} to another microscopic image collected under the optical microscope, wherein 0≦x≦W−1, 0≦y≦H−1, W denotes the width of an image, H denotes the height of the image, IS1(x,y) denotes a pixel value of a pixel point whose coordinate position is (x,y) in the {IS1(x,y)}, and IS2(x,y) denotes a pixel value of a pixel point whose coordinate position is (x,y) in the {IS2(x,y)};
(2) dividing the {IS1(x,y)} into




  
    W
    ×
    H
  
  
    n
    ×
    n
  




non-overlapping first image blocks, each of which having a size of n×n, recording a first image block with a coordinate position of (i,j) in the {IS1(x,y)} as IB1—n(i,j), dividing the {IS2(x,y)} into





  
    W
    ×
    H
  
  
    n
    ×
    n
  




non-overlapping second image blocks, each of which having a size of n×n, and recording a second image block with a coordinate position of (i,j) in the {IS2(x,y)} as IB2—n(i,j), wherein





  
    0
    ≤
    i
    ≤
    
      
        W
        n
      
      -
      1
    
  
  ,
  
    0
    ≤
    j
    ≤
    
      
        H
        n
      
      -
      1
    
  
  ,




and n is 2-power;

(3) evaluating a definition of every first image block in the {IS1(x,y)} for obtaining a definition characteristic value corresponding to every first image block in the {IS1(x,y)}, and recording a corresponding definition characteristic value thereof as Fv1—n(i,j) for the first image block IB1—n(i,j) with the coordinate position of (i,j) in the {IS1(x,y)};
evaluating a definition of every second image block in the {IS2(x,y)} for obtaining a definition characteristic value corresponding to every second image block in the {IS2(x,y)}, and recording a corresponding definition characteristic value thereof as Fv2—n(i,j) for the second image block IB2—n(i,j) with the coordinate position of (i,j) in the {IS2(x,y)};
(4) determining a first decision threshold of the definition characteristic value corresponding to every first image block in the {IS1(x,y)}, recording the first decision threshold as Tn—1; and then judging whether every first image block in the {IS1(x,y)} is a fuzzy seed block according to the definition characteristic value corresponding to every first image block in the {IS1(x,y)} and the first decision threshold Tn—1, wherein for the first image block IB1—n(i,j) with the coordinate position of (i,j) in the {IS1(x,y)}, judge whether the definition characteristic value Fv1—n(i,j) corresponding to the IB1—n(i,j) is smaller than the first decision threshold Tn—1, if it's OK, then judge the IB1—n(i,j) as the fuzzy seed block and set a mark MB1—n(i,j) of every pixel point in the IB1—n(i,j) to 1, if not, judge the IB1—n(i,j) as the non-fuzzy seed block and set the mark MB1—n(i,j) of every pixel point in the IB1—n(i,j) to 0; and then according to the mark MB1—n(i,j) of every pixel point in every first image block in the {IS1(x,y)}, calculating a definition tagged image corresponding to the {IS1(x,y)} and recording the definition tagged image as {ID1—n(x,y)}, wherein ID1—n(x,y)=MB1—n(int(x/n),int(y/n)), ID1—n(x,y) denotes a mark of a pixel point with a coordinate position of (x,y) in the {ID1—n(x,y)}, and int( ) is a rounding operator;
determining a second decision threshold of the definition characteristic value corresponding to every second image block in the {IS2(x,y)}, recording the second decision threshold as Tn—2; and then judging whether every second image block in the {IS2(x,y)} is a fuzzy seed block according to the definition characteristic value corresponding to every second image block in the {IS2(x,y)} and the second decision threshold Tn—2, wherein for the second image block IB2—n(i,j) with the coordinate position of (i,j) in the {IS2(x,y)}, judge whether the definition characteristic value Fv2—n(i,j) corresponding to the IB2—n(i,j) is smaller than the second decision threshold Tn—2, if it's OK, judge the IB2—n(i,j) as the fuzzy seed block and set a mark MB2—n(i,j) of every pixel point in the IB2—n(i,j) to 1, if not, judge the IB2—n(i,j) as the non-fuzzy seed block and set the mark MB2—n(i,j) of every pixel point in the IB2—n(i,j) to 0; and then according to the mark MB2—n(i,j) of every pixel point in every second image block in the {IS2(x,y)}, calculating a definition tagged image corresponding to the {IS2(x,y)} and recording the definition tagged image as {ID2—n(x,y)}, wherein ID2—n(x,y)=MB2—n(int(x/n),int(y/n)), ID2—n(x,y) denotes a mark of a pixel point with a coordinate position of (x,y) in the {ID2—n(x,y)}, and int( ) is a rounding operator;
(5) setting n=128, n=64, n=32, n=16 and n=8, respectively repeating steps (3) to (4) for obtaining a definition tagged image {ID1—128(x,y)} corresponding to the {IS1(x,y)} and a definition tagged image {ID2—128(x,y)} corresponding to the {IS2(x,y)} while n=128; a definition tagged image {ID1—64(x,y)} corresponding to the {IS1(x,y)} and a definition tagged image {ID2—64(x,y)} corresponding to the {IS2(x,y)} while n=64; a definition tagged image {ID1—32(x,y)} corresponding to the {IS1(x,y)} and a definition tagged image {ID2—32(x,y)} corresponding to the {IS2(x,y)} while n=32; a definition tagged image {ID1—16(x,y)} corresponding to the {IS1(x,y)} and a definition tagged image {ID2—16(x,y)} corresponding to the {IS2(x,y)} while n=16; a definition tagged image {ID1—8(x,y)} corresponding to the {IS1(x,y)} and a definition tagged image {ID2—8(x,y)} corresponding to the {IS2(x,y)} while n=8;
(6) based on the pixel points with the mark of 1 in the {ID1—128(x,y)}, {ID1—64(x,y)}, {ID1—32(x,y)}, {ID1—16(x,y)} and {ID1—8(x,y)}, making a fuzzy region growing for obtaining a region growing image corresponding to the {IS1(x,y)} and recording the region growing image as {IG1(x,y)}, wherein IG1(x,y) denotes a mark of a pixel point with a coordinate position of (x,y) in the {IG1(x,y)};
based on the pixel points with the mark of 1 in the {ID2—128(x,y)}, {ID2—64(x,y)}, {ID2—32(x,y)}, {ID2—16(x,y)} and {ID2—8(x,y)}, making a fuzzy region growing for obtaining a region growing image corresponding to the {IS2(x,y)} and recording the region growing image as IG2(x,y), wherein IG2(x,y) denotes a mark of a pixel point with a coordinate position of (x,y) in the {IG2(x,y)}; and
(7) according to the region growing image {IG1(x,y)} corresponding to the {IS1(x,y)} and the region growing image {IG2(x,y)} corresponding to the {IS2(x,y)}, fusing the {IS1(x,y)} and the {IS2(x,y)} for obtaining a final fusion microscopic image and recording the final fusion microscopic image as {IF(x,y)}, wherein




  
    
      I
      F
    
    ⁡
    
      (
      
        x
        ,
        y
      
      )
    
  
  =
  
    {
    
      
        
          
            
              
                I
                
                  S
                  ⁢
                  
                    
                  
                  ⁢
                  1
                
              
              ⁡
              
                (
                
                  x
                  ,
                  y
                
                )
              
            
            ,
          
        
        
          
            
              if
              ⁢
              
                
              
              ⁢
              
                
                  I
                  
                    G
                    ⁢
                    
                      
                    
                    ⁢
                    1
                  
                
                ⁡
                
                  (
                  
                    x
                    ,
                    y
                  
                  )
                
              
            
            =
            
              
                0
                ⁢
                
                  
                
                ⁢
                and
                ⁢
                
                  
                
                ⁢
                
                  
                    I
                    
                      G
                      ⁢
                      
                        
                      
                      ⁢
                      2
                    
                  
                  ⁡
                  
                    (
                    
                      x
                      ,
                      y
                    
                    )
                  
                
              
              =
              1
            
          
        
      
      
        
          
            
              
                I
                
                  S
                  ⁢
                  
                    
                  
                  ⁢
                  2
                
              
              ⁡
              
                (
                
                  x
                  ,
                  y
                
                )
              
            
            ,
          
        
        
          
            
              if
              ⁢
              
                
              
              ⁢
              
                
                  I
                  
                    G
                    ⁢
                    
                      
                    
                    ⁢
                    1
                  
                
                ⁡
                
                  (
                  
                    x
                    ,
                    y
                  
                  )
                
              
            
            =
            
              
                1
                ⁢
                
                  
                
                ⁢
                and
                ⁢
                
                  
                
                ⁢
                
                  
                    I
                    
                      G
                      ⁢
                      
                        
                      
                      ⁢
                      2
                    
                  
                  ⁡
                  
                    (
                    
                      x
                      ,
                      y
                    
                    )
                  
                
              
              =
              0
            
          
        
      
      
        
          C
        
        
          
            
              
                if
                ⁢
                
                  
                
                ⁢
                
                  
                    I
                    
                      G
                      ⁢
                      
                        
                      
                      ⁢
                      1
                    
                  
                  ⁡
                  
                    (
                    
                      x
                      ,
                      y
                    
                    )
                  
                
              
              =
              
                
                  I
                  
                    G
                    ⁢
                    
                      
                    
                    ⁢
                    2
                  
                
                ⁡
                
                  (
                  
                    x
                    ,
                    y
                  
                  )
                
              
            
            ,
          
        
      
    
  




here, IF(x,y) denotes a pixel value of a pixel point with a coordinate position of (x,y) in the {IF(x,y)},





  C
  =
  
    {
    
      
        
          
            
              
                I
                
                  S
                  ⁢
                  
                    
                  
                  ⁢
                  1
                
              
              ⁡
              
                (
                
                  x
                  ,
                  y
                
                )
              
            
            ,
          
        
        
          
            
              if
              ⁢
              
                
              
              ⁢
              
                
                  C
                  
                    nt
                    ⁢
                    
                      
                    
                    ⁢
                    1
                  
                
                ⁡
                
                  (
                  
                    x
                    ,
                    y
                  
                  )
                
              
            
            <
            
              
                C
                
                  nt
                  ⁢
                  
                    
                  
                  ⁢
                  2
                
              
              ⁡
              
                (
                
                  x
                  ,
                  y
                
                )
              
            
          
        
      
      
        
          
            
              
                I
                
                  S
                  ⁢
                  
                    
                  
                  ⁢
                  2
                
              
              ⁡
              
                (
                
                  x
                  ,
                  y
                
                )
              
            
            ,
          
        
        
          
            
              if
              ⁢
              
                
              
              ⁢
              
                
                  C
                  
                    nt
                    ⁢
                    
                      
                    
                    ⁢
                    1
                  
                
                ⁡
                
                  (
                  
                    x
                    ,
                    y
                  
                  )
                
              
            
            >
            
              
                C
                
                  nt
                  ⁢
                  
                    
                  
                  ⁢
                  2
                
              
              ⁡
              
                (
                
                  x
                  ,
                  y
                
                )
              
            
          
        
      
      
        
          
            
              
                
                  
                    I
                    
                      S
                      ⁢
                      
                        
                      
                      ⁢
                      1
                    
                  
                  ⁡
                  
                    (
                    
                      x
                      ,
                      y
                    
                    )
                  
                
                +
                
                  
                    I
                    
                      S
                      ⁢
                      
                        
                      
                      ⁢
                      2
                    
                  
                  ⁡
                  
                    (
                    
                      x
                      ,
                      y
                    
                    )
                  
                
              
              2
            
            ,
          
        
        
          
            
              
                if
                ⁢
                
                  
                
                ⁢
                
                  
                    C
                    
                      nt
                      ⁢
                      
                        
                      
                      ⁢
                      1
                    
                  
                  ⁡
                  
                    (
                    
                      x
                      ,
                      y
                    
                    )
                  
                
              
              =
              
                
                  C
                  
                    nt
                    ⁢
                    
                      
                    
                    ⁢
                    2
                  
                
                ⁡
                
                  (
                  
                    x
                    ,
                    y
                  
                  )
                
              
            
            ,
          
        
      
    
  




Cnt1(x,y) denotes an amount of pixel points with a mark of 1 in an 8 neighbor of the pixel point with a coordinate position of (x,y) in the {IG1(x,y)}, and Cnt2(x,y) denotes an amount of pixel points with a mark of 1 in an 8 neighbor of the pixel point with a coordinate position of (x,y) in the {IG2(x,y)}.

In step (3), the concrete process of calculating the definition characteristic value Fv1—n(i,j) corresponding to the first image block IB1—n(i,j) with the coordinate position of (i,j) in the {IS1(x,y)} comprises steps of: (3-a1) using the improved TenenGrad gradient function to calculate a horizontal gradient and a vertical gradient of every pixel point in the IB1—n(i,j), wherein for a pixel point with a coordinate position of (x1,y1) in the IB1—n(i,j), respectively record the horizontal gradient and the vertical gradient thereof as Gh1(x1,y1) and Gv1(x1,y1), wherein

Gh1(x1,y1)=(f1(x1−1,y1−1)+2f1(x1,y1−1)+f1(x1+1,y1−1))−(f1(x1−1,y1+1)+2f1(x1,y1+1)+f1(x1+1,y1+1)),

Gv1(x1,y1)=(f1(x1+1,y1−1)+2f1(x1+1,y1)+f1(x1+1,y1+1))−(f1(x1−1,y1−1)+2f1(x1−1,y1)+f1(x1−1,y1+1)),

here, 0≦x1≦n−1, 0≦y1≦n−1, f1(x1−1,y1−1) denotes a pixel value of a pixel point with a coordinate position of (x1−1,y1−1) in the IB1—n(i,j), f1(x1,y1−1) denotes a pixel value of a pixel point with a coordinate position of (x1,y1−1) in the IB1—n(i,j), f1(x1+1,y1−1) denotes a pixel value of a pixel point with a coordinate position of (x1+1,y1−1) in the IB1—n(i,j), f1(x1−1,y1+1) denotes a pixel value of a pixel point with a coordinate position of (x1−1,y1+1) in the IB1—n(i,j), f1(x1,y1+1) denotes a pixel value of a pixel point with a coordinate position of (x1,y1+1) in the IB1—n(i,j), f1(x1+1,y1+1) denotes a pixel value of a pixel point with a coordinate position of (x1+1,y1+1) in the IB1—n(i,j), f1(x1+1,y1) denotes a pixel value of a pixel point with a coordinate position of (x1+1,y1) in the IB1—n(i,j), and f1(x1−1,y1) denotes a pixel value of a pixel point with a coordinate position of (x1−1,y1) in the IB1—n(i,j); and (3-a2) according to the horizontal gradient and the vertical gradient of every pixel point in the IB1—n(i,j), calculating the definition characteristic value Fv1—n(i,j) corresponding to the IB1—n(i,j), wherein,





  
    
      F
      
        v
        ⁢
        
          
        
        ⁢
        1
        ⁢
        _n
      
    
    ⁡
    
      (
      
        i
        ,
        j
      
      )
    
  
  =
  
    
      ∑
      
        
          x
          ⁢
          
            
          
          ⁢
          1
        
        =
        0
      
      
        n
        -
        1
      
    
    ⁢
    
      
    
    ⁢
    
      
        ∑
        
          
            y
            ⁢
            
              
            
            ⁢
            1
          
          =
          0
        
        
          n
          -
          1
        
      
      ⁢
      
        
      
      ⁢
      
        
          (
          
            
              
                G
                
                  v
                  ⁢
                  
                    
                  
                  ⁢
                  1
                
                2
              
              ⁡
              
                (
                
                  
                    x
                    1
                  
                  ,
                  
                    y
                    1
                  
                
                )
              
            
            +
            
              
                G
                
                  h
                  ⁢
                  
                    
                  
                  ⁢
                  1
                
                2
              
              ⁡
              
                (
                
                  
                    x
                    ⁢
                    
                      
                    
                    ⁢
                    1
                  
                  ,
                  
                    y
                    ⁢
                    
                      
                    
                    ⁢
                    1
                  
                
                )
              
            
          
          )
        
        .
      
    
  




In step (3), the concrete process of calculating the definition characteristic value Fv2—n(i,j) corresponding to the second image block IB2—n(i,j) with the coordinate position of (i,j) in the {IS2(x,y)} comprises steps of: (3-b1) using the improved TenenGrad gradient function to calculate a horizontal gradient and a vertical gradient of every pixel point in the IB2—n(i,j), wherein for a pixel point with a coordinate position of (x1,y1) in the IB2—n(i,j), respectively record the horizontal gradient and the vertical gradient thereof as Gh2(x1,y1) and Gv2(x1,y1), wherein

Gh2(x1,y1)=(f2(x1−1,y1−1)+2f2(x1,y1−1)+f2(x1+1,y1−1))−(f2(x1−1,y1+1)+2f2(x1,y1+1)+f2(x1+1,y1+1)),

Gv2(x1,y1)=(f2(x1+1,y1−1)+2f2(x1+1,y1)+f2(x1+1,y1+1))−(f2(x1−1,y1−1)+2f2(x1−1,y1)+f2(x1−1,y1+1))

here, 0≦x1≦n−1, 0≦y1≦n−1, f2(x1−1,y1−1) denotes a pixel value of a pixel point with a coordinate position of (x1−1,y1−1) in the IB2—n(i,j), f2(x1,y1−1) denotes a pixel value of a pixel point with a coordinate position of (x1,y1−1) in the IB2—n(i,j), f2(x1+1,y1−1) denotes a pixel value of a pixel point with a coordinate position of (x1+1, y1−1) in the IB2—n(i,j), f2(x1−1,y1+1) denotes a pixel value of a pixel point with a coordinate position of (x1−1,y1+1) in the IB2—n(i,j), f2(x1,y1+1) denotes a pixel value of a pixel point with a coordinate position of (x1,y1+1) in the IB2—n(i,j), f2(x1+1,y1+1) denotes a pixel value of a pixel point with a coordinate position of (x1+1,y1+1) in the IB2—n(i,j), f2(x1+1,y1) denotes a pixel value of a pixel point with a coordinate position of (x1+1,y1) in the IB2—n(i,j), and f2(x1−1,y1) denotes a pixel value of a pixel point with a coordinate position of (x1−1,y1) in the IB2—n(i,j); and (3-b2) according to the horizontal gradient and the vertical gradient of every pixel point in the IB2—n(i,j), calculating the definition characteristic value Fv2—n(i,j) corresponding to the IB2—n(i,j), wherein,





  
    
      F
      
        v
        ⁢
        
          
        
        ⁢
        2
        ⁢
        _n
      
    
    ⁡
    
      (
      
        i
        ,
        j
      
      )
    
  
  =
  
    
      ∑
      
        
          x
          ⁢
          
            
          
          ⁢
          1
        
        =
        0
      
      
        n
        -
        1
      
    
    ⁢
    
      
    
    ⁢
    
      
        ∑
        
          
            y
            ⁢
            
              
            
            ⁢
            1
          
          =
          0
        
        
          n
          -
          1
        
      
      ⁢
      
        
      
      ⁢
      
        
          (
          
            
              
                G
                
                  v
                  ⁢
                  
                    
                  
                  ⁢
                  2
                
                2
              
              ⁡
              
                (
                
                  
                    x
                    1
                  
                  ,
                  
                    y
                    1
                  
                
                )
              
            
            +
            
              
                G
                
                  h
                  ⁢
                  
                    
                  
                  ⁢
                  2
                
                2
              
              ⁡
              
                (
                
                  
                    x
                    ⁢
                    
                      
                    
                    ⁢
                    1
                  
                  ,
                  
                    y
                    ⁢
                    
                      
                    
                    ⁢
                    1
                  
                
                )
              
            
          
          )
        
        .
      
    
  




In step (4), the concrete process of determining the first decision threshold Tn—1 of the definition characteristic value corresponding to every first image block in the {IS1(x,y)} comprises steps of: (4-a1) sequencing the definition characteristic value corresponding to every first image block in the {IS1(x,y)}, finding out a maximum definition characteristic value and a minimum characteristic value, and respectively recording the maximum definition characteristic value and the minimum characteristic value as Fv1—n—MAX and Fv1—n—MIN; and (4-a2) calculating the first decision threshold Tn—1, wherein Tn—1=Fv1—n—MIN+(Fv1—n—MAX−Fv1—n—MIN)−w1, here, w1 is a weight factor.
In step (4), the concrete process of determining the second decision threshold Tn—2 of the definition characteristic value corresponding to every second image block in the {IS2(x,y)} comprises steps of: (4-b1) sequencing the definition characteristic value corresponding to every second image block in the {IS2(x,y)}, finding out a maximum definition characteristic value and a minimum characteristic value, and respectively recording the maximum definition characteristic value and the minimum characteristic value as Fv2—n—MAX and Fv2—n—MIN; and (4-b2) calculating the second decision threshold Tn—2, wherein Tn—2=Fv2—n—MIN+(Fv2—n—MAX−Fv2—n—MIN)×w2, here, w2 is a weight factor.
In (4-a2) of step (4), 0.4≦w1≦0.6; and in (4-b2) of step (4), 0.4≦w2≦0.6.
In step (6), the acquisition process of the region growing image {IG1(x,y)} corresponding to the {IS1(x,y)} comprises steps of: (6-a1) while n=128, regarding the definition tagged image {ID1—128(x,y)} corresponding to the {IS1(x,y)} as a starting seed image; (6-a2) studying 8 image blocks each of which having a size of




  
    n
    2
  
  ×
  
    n
    2
  




adjacent to every fuzzy seed block with the size of n×n in the {IS1(x,y)}, wherein if the mark





  
    I
    
      D
      ⁢
      
        
      
      ⁢
      1
      ⁢
      _
      ⁢
      
        
      
      ⁢
      
        n
        2
      
    
  
  ⁡
  
    (
    
      x
      ,
      y
    
    )
  




corresponding to every pixel point in the image block with the size of





  
    n
    2
  
  ×
  
    n
    2
  




adjacent to every fuzzy seed block with the size of n×n in {IS1(x,y)} is 1, then a mark of every pixel point in the image block with the size of





  
    n
    2
  
  ×
  
    n
    2
  




at the same position in the starting seed image is set to 1; (6-a3) setting





  
    n
    =
    
      n
      2
    
  
  ;




and returning to step (6-a2) till n=8, here, “=” is an assignment symbol in





  
    n
    =
    
      n
      2
    
  
  ;




and (6-a4) while n=8, directly setting a mark of every pixel point in image blocks in the starting seed image to 1, wherein the image blocks in the starting seed image has the same position with 8 image blocks, each of which having a size of 4×4, adjacent to every fuzzy seed block with a size of 8×8 in the {IS1(x,y)}; and then setting n=4, and directly setting a mark of every pixel point in image blocks in the starting seed image to 1, wherein the image blocks in the starting seed image has the same position with 8 image blocks, each of which having a size of 2×2, adjacent to every fuzzy seed block with a size of 4×4 in the {IS1(x,y)}; and then setting n=2, and directly setting the mark of 8 pixel points in the starting seed image to 1, wherein the 8 pixel points in the starting seed image has the same position with the 8 pixel points adjacent to every fuzzy seed block with a size of 2×2 in the {IS1(x,y)}, thereby obtaining the region growing image {IG1(x,y)} corresponding to the {IS1(x,y)}, wherein the pixel point in {IS1(x,y)} whose corresponding mark in {IG1(x,y)} is 1 is a fuzzy pixel point, and the pixel point in {IS1(x,y)} whose corresponding mark in {IG1(x,y)} is 0 is a non-fuzzy pixel point.

In step (6), the acquisition process of the region growing image {IG2(x,y)} corresponding to the {IS2(x,y)} comprises steps of: (6-b1) while n=128, regarding the definition tagged image {ID2—128(x,y)} corresponding to the {IS2(x,y)} as a starting seed image; (6-b2) studying 8 image blocks each of which having a size of




  
    n
    2
  
  ×
  
    n
    2
  




adjacent to every fuzzy seed block with the size of n×n in the {IS2(x,y)}, wherein if the mark of





  
    I
    
      D
      ⁢
      
        
      
      ⁢
      2
      ⁢
      _
      ⁢
      
        
      
      ⁢
      
        n
        2
      
    
  
  ⁡
  
    (
    
      x
      ,
      y
    
    )
  




corresponding to every pixel point in the image block with the size of





  
    n
    2
  
  ×
  
    n
    2
  




adjacent to every fuzzy seed block with the size of n×n in {IS2(x,y)} is 1, then a mark of every pixel point in the image block with the size of





  
    n
    2
  
  ×
  
    n
    2
  




at the same position in the starting seed image is set to 1; (6-b3) setting





  
    n
    =
    
      n
      2
    
  
  ,




and returning to step (6-b2) till n=8, here, “=” is an assignment symbol in





  
    n
    =
    
      n
      2
    
  
  ;




and (6-b4) while n=8, directly setting a mark of every pixel point in image blocks in the starting seed image to 1, wherein the image blocks in the starting seed image has the same position with 8 image blocks, each of which having a size of, 4×4 adjacent to every fuzzy seed block with a size of 8×8 in the {IS2(x,y)}; and then setting n=4, and directly setting a mark of every pixel point in image blocks in the starting seed image to 1, wherein the image blocks in the starting seed image has the same position with 8 image blocks, each of which having a size of 2×2, adjacent to every fuzzy seed block with a size of 4×4 in the {IS2(x,y)}; and then setting n=2, and directly setting the mark of 8 pixel points in the starting seed image to 1, wherein the 8 pixel points in the starting seed image has the same position with the 8 pixel points adjacent to every fuzzy seed block with a size of 2×2 in the {IS2(x,y)}, thereby obtaining the region growing image {IG2(x,y)} corresponding to the {IS2(x,y)}, wherein the pixel point in {IS2(x,y)} whose corresponding mark in {IG2(x,y)} is 1 is a fuzzy pixel point, and the pixel point in {IS2(x,y)} whose corresponding mark in {IG2(x,y)} is 0 is a non-fuzzy pixel point.

Compared with the prior art, the present invention has some advantages as follows. By evaluating the definition of every image block in the microscopic image, the fuzzy degree of the microscopic image is judged and the fuzzy seed block is determined. Then, the region growing is used to progressively complete the accurate segmentation of the fuzzy region and the clear region. Finally, by the fusion rule of the microscopic image, a clear and high-quality microscopic image fused by a plurality of microscopic images is obtained. Due to the combination of the definition evaluation of the microscopic image, and the segmentation of the fuzzy region and clear region of every microscopic image by the region growing, the fusion result of the microscopic image of the present invention shows great advantages at the subjective human perception and the objective evaluation. Furthermore, the present invention has simple calculation and stable result, is easy to be implemented and adapted for fusing the digital optical microscopic images which are shot by shallow depth of field.
These and other objectives, features, and advantages of the present invention will become apparent from the following detailed description, the accompanying drawings, and the appended claims.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a general block diagram of the present invention.
FIG. 2 shows the process of the region growing.
FIG. 3a is the first microscopic image of the cross section of the dicotyledonous stem.
FIG. 3b is the second microscopic image of the cross section of the dicotyledonous stem.
FIG. 3c is the first microscopic image of the epithelial tissue.
FIG. 3d is the second microscopic image of the epithelial tissue.
FIG. 4a shows the microscopic image whose definition is judged after the microscopic image shown in FIG. 3a is divided into 128×128 image blocks, wherein the white part at the left is the eliminated fuzzy region which is marked by {ID1—128(x,y)}.
FIG. 4b shows the rest microscopic image after the fuzzy region growing of the image block with the size of 64×64 shown in FIG. 4a. 
FIG. 4c shows the rest microscopic image after the fuzzy region growing of the image block with the size of 32×32 shown in FIG. 4b. 
FIG. 4d shows the rest microscopic image after the fuzzy region growing of the image block with the size of 16×16 shown in FIG. 4c. 
FIG. 4e shows the rest microscopic image after the fuzzy region growing of the image block with the size of 8×8 shown in FIG. 4d. 
FIG. 4f shows the rest microscopic image after the fuzzy region growing of the image block with the size of 4×4 shown in FIG. 4e. 
FIG. 4g shows the rest microscopic image after the fuzzy region growing of the image block with the size of 2×2 shown in FIG. 4f. 
FIG. 4h shows the rest microscopic image after the fuzzy region growing of the image block with the size of 1×1 shown in FIG. 4g. 
FIG. 5 is a final fusion microscopic image of the cross section of the dicotyledonous stem.
FIG. 6 is a final fusion microscopic image of the epithelial tissue.



DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT
The present invention is further explained in detail with the accompanying drawings.
FIG. 1 shows a flow chart of a microscopic image fusion method based on region growing provided by the present invention. The microscopic image fusion method based on region growing comprises steps as follows.
(1) Set {IS1(x,y)} to one microscopic image collected under an optical microscope, and set {IS2(x,y)} to another microscopic image collected under the optical microscope, wherein 0≦x≦W−1, 0≦y≦H−1, W denotes the width of an image, H denotes the height of the image, IS1(x,y) denotes a pixel value of a pixel point whose coordinate position is (x,y) in the {IS1(x,y)}, and IS2(x,y) denotes a pixel value of a pixel point whose coordinate position is (x,y) in the {IS2(x,y)}.
To verify the validity of the present invention, two pairs of microscopic images which are shot under the condition of shallow depth of field of the optical microscope are selected in this embodiment, as shown in FIG. 3, wherein FIGS. 3a and 3b are two microscopic images of the cross section of the dicotyledonous stem, FIGS. 3c and 3d are two microscopic images of the epithelial tissue. These images are with the size of 1024×768. It is seen that each of them has some blurring regions. In this embodiment, the microscopic image shown by FIG. 3a is {IS1(x,y)}, and the microscopic image shown by FIG. 3b is {IS2(x,y)}. Similarly, the microscopic image shown by FIG. 3c is {IS1(x,y)}, and the microscopic image shown by FIG. 3d is {IS2(x,y)}.
(2) Divide the {IS1(x,y)} into




  
    W
    ×
    H
  
  
    n
    ×
    n
  




non-overlapping first image blocks, each of which having a size of n×n, record a first image block with a coordinate position of (i,j) in the {IS1(x,y)} as IB1—n(i,j), divide the {IS2(x,y)} into





  
    W
    ×
    H
  
  
    n
    ×
    n
  




non-overlapping second image blocks, each of which having a size of n×n, and record a second image block with a coordinate position of (i,j) in the {IS2(x,y)} as IB2—n(i,j), wherein





  
    0
    ≤
    i
    ≤
    
      
        W
        n
      
      -
      1
    
  
  ,
  
    0
    ≤
    j
    ≤
    
      
        H
        n
      
      -
      1
    
  
  ,




and n is 2-power.

(3) Evaluate a definition of every first image block in the {IS1(x,y)} for obtaining a definition characteristic value corresponding to every first image block in the {IS1(x,y)}, and record a corresponding definition characteristic value thereof as Fv1—n(i,j) for the first image block IB1—n(i,j) with the coordinate position of (i,j) in the {IS1(x,y)}. In the specific embodiment, the concrete process of calculating the definition characteristic value Fv1—n(i,j) corresponding to the first image block IB1—n(i,j) with the coordinate position of (i,j) in the {IS1(x,y)} comprises steps of: (3-a1) using the improved TenenGrad gradient function to calculate a horizontal gradient and a vertical gradient of every pixel point in the IB1—n(i,j), wherein for a pixel point with a coordinate position of (x1,y1) in the IB1—n(i,j), respectively record the horizontal gradient and the vertical gradient thereof as Gh1(x1,y1) and Gv1(x1,y1), wherein

Gh1(x1,y1)=(f1(x1−1,y1−1)+2f1(x1,y1−1)+f1(x1+1,y1−1))−(f1(x1−1,y1+1)+2f1(x1,y1+1)+f1(x1+1,y1+1)),

Gv1(x1,y1)=(f1(x1+1,y1−1)+2f1(x1+1,y1)+f1(x1+1,y1+1))−(f1(x1−1,y1−1)+2f1(x1−1,y1)+f1(x1−1,y1+1)),

here, 0≦x1≦n−1, 0≦y≦n−1, f1(x1−1,y1−1) denotes a pixel value of a pixel point with a coordinate position of (x1−1,y1−1) in the IB1—n(i,j), f1(x1,y1−1) denotes a pixel value of a pixel point with a coordinate position of (x1,y1−1) in the IB1—n(i,j), f1(x1+1,y1−1) denotes a pixel value of a pixel point with a coordinate position of (x1+1,y1−1) in the IB1—n(i,j), f1(x1−1,y1+1) denotes a pixel value of a pixel point with a coordinate position of (x1−1,y1+1) in the IB1—n(i,j), f1(x1,y1+1) denotes a pixel value of a pixel point with a coordinate position of (x1,y1+1) in the IB1—n(i,j), f1(x1+1,y1+1) denotes a pixel value of a pixel point with a coordinate position of (x1+1,y1+1) in the IB1—n(i,j), f1(x1+1,y1) denotes a pixel value of a pixel point with a coordinate position of (x1+1,y1) in the IB1—n(i,j), and f1(x1−1,y1) denotes a pixel value of a pixel point with a coordinate position of (x1−1,y1) in the IB1—n(i,j); and (3-a2) according to the horizontal gradient and the vertical gradient of every pixel point in the IB1—n(i,j), calculating the definition characteristic value Fv1—n(i,j) corresponding to the IB1—n(i,j), namely, summing total sums of squares of the horizontal gradient and the vertical gradient of every pixel point in the IB1—n(i,j) for obtaining the definition characteristic value Fv1—n(i,j) corresponding to the IB1—n(i,j), wherein,





  
    
      F
      
        v
        ⁢
        
          
        
        ⁢
        1
        ⁢
        _n
      
    
    ⁡
    
      (
      
        i
        ,
        j
      
      )
    
  
  =
  
    
      ∑
      
        
          x
          ⁢
          
            
          
          ⁢
          1
        
        =
        0
      
      
        n
        -
        1
      
    
    ⁢
    
      
    
    ⁢
    
      
        ∑
        
          
            y
            ⁢
            
              
            
            ⁢
            1
          
          =
          0
        
        
          n
          -
          1
        
      
      ⁢
      
        
      
      ⁢
      
        
          (
          
            
              
                G
                
                  v
                  ⁢
                  
                    
                  
                  ⁢
                  1
                
                2
              
              ⁡
              
                (
                
                  
                    x
                    1
                  
                  ,
                  
                    y
                    1
                  
                
                )
              
            
            +
            
              
                G
                
                  h
                  ⁢
                  
                    
                  
                  ⁢
                  1
                
                2
              
              ⁡
              
                (
                
                  
                    x
                    ⁢
                    
                      
                    
                    ⁢
                    1
                  
                  ,
                  
                    y
                    ⁢
                    
                      
                    
                    ⁢
                    1
                  
                
                )
              
            
          
          )
        
        .
      
    
  




Evaluate a definition of every second image block in the {IS2(x,y)} for obtaining a definition characteristic value corresponding to every second image block in the {IS2(x,y)}, and record a corresponding definition characteristic value thereof as Fv2—n(i,j) for the second image block IB2—n(i,j) with the coordinate position of (i,j) in the {IS2(x,y)}. In the specific embodiment, the concrete process of calculating the definition characteristic value Fv2—n(i,j) corresponding to the second image block IB2—n(i,j) with the coordinate position of (i,j) in the {IS2(x,y)} comprises steps of: (3-b1) using the improved TenenGrad gradient function to calculate a horizontal gradient and a vertical gradient of every pixel point in the IB2—n(i,j), wherein for a pixel point with a coordinate position of (x1,y1) in the IB2—n(i,j), respectively record the horizontal gradient and the vertical gradient thereof as Gh2(x1,y1) and Gv2(x1,y1), wherein

Gh2(x1,y1)=(f2(x1−1,y1−1)+2f2(x1,y1−1)+f2(x1+1,y1−1))−(f2(x1−1,y1+1)+2f2(x1,y1+1)+f2(x1+1,y1+1)),

Gv2(x1,y1)=(f2(x1+1,y1−1)+2f2(x1+1,y1)+f2(x1+1,y1+1))−(f2(x1−1,y1−1)+2f2(x1−1,y1)+f2(x1−1,y1+1))

here, 0≦x1≦n−1, 0≦y1≦n−1, f2(x1−1,y1−1) denotes a pixel value of a pixel point with a coordinate position of (x1−1,y1−1) in the IB2—n(i,j), f2(x1,y1−1) denotes a pixel value of a pixel point with a coordinate position of (x1,y1−1) in the IB2—n(i,j), f2(x1+1,y1−1) denotes a pixel value of a pixel point with a coordinate position of (x1+1,y1−1) in the IB2—n(i,j), f2(x1−1,y1+1) denotes a pixel value of a pixel point with a coordinate position of (x1−1,y1+1) in the IB2—n(i,j), f2(x1,y1+1) denotes a pixel value of a pixel point with a coordinate position of (x1,y1+1) in the IB2—n(i,j), f2(x1+1,y1+1) denotes a pixel value of a pixel point with a coordinate position of (x1+1,y1+1) in the IB2—n(i,j), f2(x1+1,y1) denotes a pixel value of a pixel point with a coordinate position of (x1+1,y1) in the IB2—n(i,j), and f2(x1−1,y1) denotes a pixel value of a pixel point with a coordinate position of (x1−1,y1) in the IB2—n(i,j); and (3-b2) according to the horizontal gradient and the vertical gradient of every pixel point in the IB2—n(i,j), calculating the definition characteristic value Fv2—n(i,j) corresponding to the IB2—n(i,j), namely, summing total sums of squares of the horizontal gradient and the vertical gradient of every pixel point in the IB2—n(i,j) for obtaining the definition characteristic value Fv2—n(i,j) corresponding to the IB2—n(i,j), wherein,





  
    
      F
      
        v
        ⁢
        
          
        
        ⁢
        2
        ⁢
        _n
      
    
    ⁡
    
      (
      
        i
        ,
        j
      
      )
    
  
  =
  
    
      ∑
      
        
          x
          ⁢
          
            
          
          ⁢
          1
        
        =
        0
      
      
        n
        -
        1
      
    
    ⁢
    
      
    
    ⁢
    
      
        ∑
        
          
            y
            ⁢
            
              
            
            ⁢
            1
          
          =
          0
        
        
          n
          -
          1
        
      
      ⁢
      
        
      
      ⁢
      
        
          (
          
            
              
                G
                
                  v
                  ⁢
                  
                    
                  
                  ⁢
                  2
                
                2
              
              ⁡
              
                (
                
                  
                    x
                    1
                  
                  ,
                  
                    y
                    1
                  
                
                )
              
            
            +
            
              
                G
                
                  h
                  ⁢
                  
                    
                  
                  ⁢
                  2
                
                2
              
              ⁡
              
                (
                
                  
                    x
                    ⁢
                    
                      
                    
                    ⁢
                    1
                  
                  ,
                  
                    y
                    ⁢
                    
                      
                    
                    ⁢
                    1
                  
                
                )
              
            
          
          )
        
        .
      
    
  




(4) Determine a first decision threshold of the definition characteristic value corresponding to every first image block in the {IS1(x,y)}, record the first decision threshold as Tn—1; and then judge whether every first image block in the {IS1(x,y)} is a fuzzy seed block according to the definition characteristic value corresponding to every first image block in the {IS1(x,y)} and the first decision threshold Tn—1, wherein for the first image block IB1—n(i,j) with the coordinate position of (i,j) in the {IS1(x,y)}, judge whether the definition characteristic value Fv1—n(i,j) corresponding to the IB1—n(i,j) is smaller than the first decision threshold Tn—1, if it's OK, then judge the IB1—n(i,j) as the fuzzy seed block and set a mark MB1—n(i,j) of every pixel point in the IB1—n(i,j) to 1, if not, judge the IB1—n(i,j) as the non-fuzzy seed block and set the mark MB1—n(i,j) of every pixel point in the IB1—n(i,j) to 0, namely,




  
    
      M
      
        B
        ⁢
        
          
        
        ⁢
        1
        ⁢
        _n
      
    
    ⁡
    
      (
      
        i
        ,
        j
      
      )
    
  
  =
  
    {
    
      
        
          
            1
            ,
          
        
        
          
            
              if
              ⁢
              
                
              
              ⁢
              
                
                  F
                  
                    v
                    ⁢
                    
                      
                    
                    ⁢
                    1
                    ⁢
                    _n
                  
                
                ⁡
                
                  (
                  
                    i
                    ,
                    j
                  
                  )
                
              
            
            <
            
              T
              
                n_
                ⁢
                1
              
            
          
        
      
      
        
          
            0
            ,
          
        
        
          
            otherwise
            ;
          
        
      
    
  




and then according to the mark MB1—n(i,j) of every pixel point in every first image block in the {IS1(x,y)}, calculate a definition tagged image corresponding to the {IS1(x,y)} and record the definition tagged image as {ID1—n(x,y)}, wherein ID1—n(x,y)=MB1—n(int(x/n),int(y/n)), ID1—n(x,y) denotes a mark of a pixel point with a coordinate position of (x,y) in the {ID1—n(x,y)}, and int( ) is a rounding operator.

In the specific embodiment, the concrete process of determining the first decision threshold Tn—1 of the definition characteristic value corresponding to every first image block in the {IS1(x,y)} comprises steps of: (4-a1) sequencing the definition characteristic value corresponding to every first image block in the {IS1(x,y)}, finding out a maximum definition characteristic value and a minimum characteristic value, and respectively recording the maximum definition characteristic value and the minimum characteristic value as Fv1—n—MAX and Fv1—n—MIN; and (4-a2) calculating the first decision threshold Tn—1, wherein Tn—1=Fv1—n—MIN+(Fv1—n—MAX−Fv1—n—MIN)×w1, here, w1 is a weight factor.
Determine a second decision threshold of the definition characteristic value corresponding to every second image block in the {IS2(x,y)}, record the second decision threshold as Tn—2; and then judge whether every second image block in the {IS2(x,y)} is a fuzzy seed block according to the definition characteristic value corresponding to every second image block in the {IS2(x,y)} and the second decision threshold Tn—2, wherein for the second image block IB2—n(i,j) with the coordinate position of (i,j) in the {IS2(x,y)}, judge whether the definition characteristic value Fv2—n(i,j) corresponding to the IB2—n(i,j) is smaller than the second decision threshold Tn—2, if it's OK, judge the IB2—n(i,j) as the fuzzy seed block and set a mark MB2—n(i,j) Of every pixel point in the IB2—n(i,j) to 1, if not, judge the IB2—n(i,j) as the non-fuzzy seed block and set the mark MB2—n(i,j) of every pixel point in the IB2—n(i,j) to 0, namely,




  
    
      M
      
        B
        ⁢
        
          
        
        ⁢
        2
        ⁢
        _n
      
    
    ⁡
    
      (
      
        i
        ,
        j
      
      )
    
  
  =
  
    {
    
      
        
          
            1
            ,
          
        
        
          
            
              if
              ⁢
              
                
              
              ⁢
              
                
                  F
                  
                    v
                    ⁢
                    
                      
                    
                    ⁢
                    2
                    ⁢
                    _n
                  
                
                ⁡
                
                  (
                  
                    i
                    ,
                    j
                  
                  )
                
              
            
            <
            
              T
              
                n_
                ⁢
                2
              
            
          
        
      
      
        
          
            0
            ,
          
        
        
          
            otherwise
            ;
          
        
      
    
  




and then according to the mark MB2—n(i,j) of every pixel point in every second image block in the {IS2(x,y)}, calculate a definition tagged image corresponding to the {IS2(x,y)} and record the definition tagged image as {ID2—n(x,y)}, wherein ID2—n(x,y)=MB2—n(int(x/n),int(y/n)), ID2—n(x,y) denotes a mark of a pixel point with a coordinate position of (x,y) in the {ID2—n(x,y)}, and int( ) is a rounding operator.

In the specific embodiment, the concrete process of determining the second decision threshold Tn—2 of the definition characteristic value corresponding to every second image block in the {IS2(x,y)} comprises steps of: (4-b1) sequencing the definition characteristic value corresponding to every second image block in the {IS2(x,y)}, finding out a maximum definition characteristic value and a minimum characteristic value, and respectively recording the maximum definition characteristic value and the minimum characteristic value as Fv2—n—MAX and Fv2—n—MIN; and (4-b2) calculating the second decision threshold Tn—2, wherein Tn—2=Fv2—n—MIN+(Fv2—n—MAX−Fv2—n—MIN)×w2, here, w2 is a weight factor.
The w1 and w2 varies with different microscopic images; while choosing w1, the value of Fv1—n—MAX−Fv1—n—MIN should be regarded as an important reference; while choosing w2, the value of Fv2—n—MAX−Fv2—n—MIN should be regarded as an important reference; and in this practical operation process, w1=w2=0.5.
(5) Set n=128, n=64, n=32, n=16 and n=8, respectively repeat steps (3) to (4) for obtaining a definition tagged image {ID1—128(x,y)} corresponding to the {IS1(x,y)} and a definition tagged image {ID2—128(x,y)} corresponding to the {IS2(x,y)} while n=128; a definition tagged image {ID1—64(x,y)} corresponding to the {IS1(x,y)} and a definition tagged image {ID2—64(x,y)} corresponding to the {IS2(x,y)} while n=64; a definition tagged image {ID1—32(x,y)} corresponding to the {IS1(x,y)} and a definition tagged image {ID2—32(x,y)} corresponding to the {IS2(x,y)} while n=32; a definition tagged image {ID1—16(x,y)} corresponding to the {IS1(x,y)} and a definition tagged image {ID2—16(x,y)} corresponding to the {IS2(x,y)} while n=16; a definition tagged image {ID1—8(x,y)} corresponding to the {IS1(x,y)} and a definition tagged image {ID2—8(x,y)} corresponding to the {IS2(x,y)} while n=8.
(6) Based on the pixel points with the mark of 1 in the obtained {ID1—128(x,y)}, {ID1—64(x,y)}, {ID1—32(x,y)}, {ID1—16(x,y)} and {ID1—8(x,y)} under a group of blocks with various sizes, make a fuzzy region growing for obtaining a region growing image corresponding to the {IS1(x,y)} and record the region growing image as {IG1(x,y)}, wherein IG1(x,y) denotes a mark of a pixel point with a coordinate position of (x,y) in the {IG1(x,y)}.
In the specific embodiment, the acquisition process of the region growing image {IG1(x,y)} corresponding to the {IS1(x,y)} comprises steps of: (6-a1) while n=128, regarding the definition tagged image {ID1—128(x,y)} corresponding to the {IS1(x,y)} as a starting seed image; (6-a2) studying 8 image blocks (2 image blocks respectively at up, down, left and right) each of which having a size of




  
    n
    2
  
  ×
  
    n
    2
  




adjacent to every fuzzy seed block with the size of n×n in the {IS1(x,y)}, wherein if the mark





  
    I
    
      D
      ⁢
      
        
      
      ⁢
      1
      ⁢
      _
      ⁢
      
        n
        2
      
    
  
  ⁡
  
    (
    
      x
      ,
      y
    
    )
  




corresponding to every pixel point in the image block with the size of





  
    n
    2
  
  ×
  
    n
    2
  




adjacent to every fuzzy seed block with the size of n×n in {IS1(x,y)} is 1, then make a region growing, namely, a mark of every pixel point in the image block with the size of





  
    n
    2
  
  ×
  
    n
    2
  




at the same position in the starting seed image is set to 1; (6-a3) setting





  
    n
    =
    
      n
      2
    
  
  ,




and returning to step (6-a2) till n=8, here, “=” is an assignment symbol in





  
    n
    =
    
      n
      2
    
  
  ;




and (6-a4) while n=8, directly setting a mark of every pixel point in image blocks in the starting seed image to 1, wherein the image blocks in the starting seed image has the same position with 8 image blocks, each of which having a size of 4×4, adjacent to every fuzzy seed block with a size of 8×8 in the {IS1(x,y)}; and then setting n=4, and directly setting a mark of every pixel point in image blocks in the starting seed image to 1, wherein the image blocks in the starting seed image has the same position with 8 image blocks, each of which having a size of 2×2, adjacent to every fuzzy seed block with a size of 4×4 in the {IS1(x,y)}; and then setting n=2, and directly setting the mark of 8 pixel points in the starting seed image to 1, wherein the 8 pixel points in the starting seed image has the same position with the 8 pixel points adjacent to every fuzzy seed block with a size of 2×2 in the {IS1(x,y)}, thereby obtaining the region growing image {IG1(x,y)} corresponding to the {IS1(x,y)}, wherein the pixel point in {IS1(x,y)} whose corresponding mark in {IG1(x,y)} is 1 is a fuzzy pixel point, and the pixel point in {IS1(x,y)} whose corresponding mark in {IG1(x,y)} is 0 is a non-fuzzy pixel point.

FIG. 2 shows the process of the region growing. The biggest block with vertical stripe in the middle denote the fuzzy seed block which is regarded as a fuzzy seed block by the definition evaluation after {IS1(x,y)} is divided into first image blocks each of which having the size of 128×128. The blurring region grows from the fuzzy seed block. The image blocks shown by 45° diagonal stripe in FIG. 2 are with the size of 64×64. For each of these 64×64 image blocks, if its corresponding mark in {ID1—64(x,y)} is 1, the 64×64 image block is remarked as fuzzy seed blocks at next growing. Similarly, the image blocks shown by 135° diagonal stripe in FIG. 2 are with the size of 32×32. For each of these 32×32 image blocks, if its corresponding mark in {ID1—32(x,y)} is 1, the 32×32 image block is remarked as fuzzy seed blocks. But if the corresponding mark in {ID1—32(x,y)} is 0, for example the 32×32 image block at the tenth row and the third column without stripe in FIG. 2, the 32×32 image block will not be remarked as fuzzy seed block, thus the region growth will be stopped at this direction. The fuzzy region grows till the image block is split into 1×1 or the corresponding marks in {ID1—n(x,y)} of all boundary blocks are 0. In this embodiment, the microscopic image in FIG. 3a is divided into image blocks each of which having the size of 128×128 and then the definition of the image blocks is judged. The judged microscopic image is shown in FIG. 4a, wherein the white part at the left is the eliminated fuzzy region which is marked by {ID1—128(x,y)}. FIGS. 4b to 4h are microscopic images after the region growing of the blocks with various sizes in turn.
Based on the pixel points with the mark of 1 in the obtained {ID2—128(x,y)}, {ID2—64(x,y)}, {ID2—32(x,y)}, {ID2—16(x,y)} and {ID2—8(x,y)} under a group of blocks with various sizes, make a fuzzy region growing for obtaining a region growing image corresponding to the {IS2(x,y)} and record the region growing image as {IG2(x,y)}, wherein IG2(x,y) denotes a mark of a pixel point with a coordinate position of (x,y) in the {IG2(x,y)}.
In the specific embodiment, the acquisition process of the region growing image {IG2(x,y)} corresponding to the {IS2(x,y)} comprises steps of: (6-b1) while n=128, regarding the definition tagged image {ID2—128(x,y)} corresponding to the {IS2(x,y)} as a starting seed image; (6-b2) studying 8 image blocks each of which having a size of




  
    n
    2
  
  ×
  
    n
    2
  




adjacent to every fuzzy seed block with the size of n×n in the {IS2(x,y)}, wherein if the mark of





  
    I
    
      D
      ⁢
      
        
      
      ⁢
      2
      ⁢
      _
      ⁢
      
        
      
      ⁢
      
        n
        2
      
    
  
  ⁡
  
    (
    
      x
      ,
      y
    
    )
  




corresponding to every pixel point in the image block with the size of





  
    n
    2
  
  ×
  
    n
    2
  




adjacent to every fuzzy seed block with the size of n×n in {IS2(x,y)} is 1, then a mark of every pixel point in the image block with the size of





  
    n
    2
  
  ×
  
    n
    2
  




at the same position in the starting seed image is set to 1; (6-b3) setting





  
    n
    =
    
      n
      2
    
  
  ,




and returning to step (6-b2) till n=8, here, “=” is an assignment symbol in





  
    n
    =
    
      n
      2
    
  
  ;




and (6-b4) while n=8, directly setting a mark of every pixel point in image blocks in the starting seed image to 1, wherein the image blocks in the starting seed image has the same position with 8 image blocks, each of which having a size of 4×4, adjacent to every fuzzy seed block with a size of 8×8 in the {IS2(x,y)}; and then setting n=4, and directly setting a mark of every pixel point in image blocks in the starting seed image to 1, wherein the image blocks in the starting seed image has the same position with 8 image blocks, each of which having a size of 2×2, adjacent to every fuzzy seed block with a size of 4×4 in the {IS2(x,y)}; and then setting n=2, and directly setting the mark of 8 pixel points in the starting seed image to 1, wherein the 8 pixel points in the starting seed image has the same position with the 8 pixel points adjacent to every fuzzy seed block with a size of 2×2 in the {IS2(x,y)}, thereby obtaining the region growing image {IG2(x,y)} corresponding to the {IS2(x,y)}, wherein the pixel point in {IS2(x,y)} whose corresponding mark in {IG2(x,y)} is 1 is a fuzzy pixel point, and the pixel point in {IS2(x,y)} whose corresponding mark in {IG2(x,y)} is 0 is a non-fuzzy pixel point.

(7) According to the region growing image {IG1(x,y)} corresponding to the {IS1(x,y)} and the region growing image {IG2(x,y)} corresponding to the {IS2(x,y)}, fuse the {IS1(x,y)} and the {IS2(x,y)} for obtaining a final fusion microscopic image and record the final fusion microscopic image as {IF(x,y)}, wherein




  
    
      I
      F
    
    ⁡
    
      (
      
        x
        ,
        y
      
      )
    
  
  =
  
    {
    
      
        
          
            
              
                I
                
                  S
                  ⁢
                  
                    
                  
                  ⁢
                  1
                
              
              ⁡
              
                (
                
                  x
                  ,
                  y
                
                )
              
            
            ,
          
        
        
          
            
              if
              ⁢
              
                
              
              ⁢
              
                
                  I
                  
                    G
                    ⁢
                    
                      
                    
                    ⁢
                    1
                  
                
                ⁡
                
                  (
                  
                    x
                    ,
                    y
                  
                  )
                
              
            
            =
            
              
                0
                ⁢
                
                  
                
                ⁢
                and
                ⁢
                
                  
                
                ⁢
                
                  
                    I
                    
                      G
                      ⁢
                      
                        
                      
                      ⁢
                      2
                    
                  
                  ⁡
                  
                    (
                    
                      x
                      ,
                      y
                    
                    )
                  
                
              
              =
              1
            
          
        
      
      
        
          
            
              
                I
                
                  S
                  ⁢
                  
                    
                  
                  ⁢
                  2
                
              
              ⁡
              
                (
                
                  x
                  ,
                  y
                
                )
              
            
            ,
          
        
        
          
            
              if
              ⁢
              
                
              
              ⁢
              
                
                  I
                  
                    G
                    ⁢
                    
                      
                    
                    ⁢
                    1
                  
                
                ⁡
                
                  (
                  
                    x
                    ,
                    y
                  
                  )
                
              
            
            =
            
              
                1
                ⁢
                
                  
                
                ⁢
                and
                ⁢
                
                  
                
                ⁢
                
                  
                    I
                    
                      G
                      ⁢
                      
                        
                      
                      ⁢
                      2
                    
                  
                  ⁡
                  
                    (
                    
                      x
                      ,
                      y
                    
                    )
                  
                
              
              =
              0
            
          
        
      
      
        
          C
        
        
          
            
              
                if
                ⁢
                
                  
                
                ⁢
                
                  
                    I
                    
                      G
                      ⁢
                      
                        
                      
                      ⁢
                      1
                    
                  
                  ⁡
                  
                    (
                    
                      x
                      ,
                      y
                    
                    )
                  
                
              
              =
              
                
                  I
                  
                    G
                    ⁢
                    
                      
                    
                    ⁢
                    2
                  
                
                ⁡
                
                  (
                  
                    x
                    ,
                    y
                  
                  )
                
              
            
            ,
          
        
      
    
  




here, IF(x,y) denotes a pixel value of a pixel point with a coordinate position of (x,y) in the {IF(x,y)}, wherein





  C
  =
  
    {
    
      
        
          
            
              
                I
                
                  S
                  ⁢
                  
                    
                  
                  ⁢
                  1
                
              
              ⁡
              
                (
                
                  x
                  ,
                  y
                
                )
              
            
            ,
          
        
        
          
            
              if
              ⁢
              
                
              
              ⁢
              
                
                  C
                  
                    nt
                    ⁢
                    
                      
                    
                    ⁢
                    1
                  
                
                ⁡
                
                  (
                  
                    x
                    ,
                    y
                  
                  )
                
              
            
            <
            
              
                C
                
                  nt
                  ⁢
                  
                    
                  
                  ⁢
                  2
                
              
              ⁡
              
                (
                
                  x
                  ,
                  y
                
                )
              
            
          
        
      
      
        
          
            
              
                I
                
                  S
                  ⁢
                  
                    
                  
                  ⁢
                  2
                
              
              ⁡
              
                (
                
                  x
                  ,
                  y
                
                )
              
            
            ,
          
        
        
          
            
              if
              ⁢
              
                
              
              ⁢
              
                
                  C
                  
                    nt
                    ⁢
                    
                      
                    
                    ⁢
                    1
                  
                
                ⁡
                
                  (
                  
                    x
                    ,
                    y
                  
                  )
                
              
            
            >
            
              
                C
                
                  nt
                  ⁢
                  
                    
                  
                  ⁢
                  2
                
              
              ⁡
              
                (
                
                  x
                  ,
                  y
                
                )
              
            
          
        
      
      
        
          
            
              
                
                  
                    I
                    
                      S
                      ⁢
                      
                        
                      
                      ⁢
                      1
                    
                  
                  ⁡
                  
                    (
                    
                      x
                      ,
                      y
                    
                    )
                  
                
                +
                
                  
                    I
                    
                      S
                      ⁢
                      
                        
                      
                      ⁢
                      2
                    
                  
                  ⁡
                  
                    (
                    
                      x
                      ,
                      y
                    
                    )
                  
                
              
              2
            
            ,
          
        
        
          
            
              
                if
                ⁢
                
                  
                
                ⁢
                
                  
                    C
                    
                      nt
                      ⁢
                      
                        
                      
                      ⁢
                      1
                    
                  
                  ⁡
                  
                    (
                    
                      x
                      ,
                      y
                    
                    )
                  
                
              
              =
              
                
                  C
                  
                    nt
                    ⁢
                    
                      
                    
                    ⁢
                    2
                  
                
                ⁡
                
                  (
                  
                    x
                    ,
                    y
                  
                  )
                
              
            
            ,
          
        
      
    
  




Cnt1(x,y) denotes an amount of pixel points with a mark of 1 in an 8 neighbor of the pixel point with a coordinate position of (x,y) in the {IG1(x,y)}(namely, an amount of fuzzy pixel points), and Cnt2(x,y) denotes an amount of pixel points with a mark of 1 in an 8 neighbor of the pixel point with a coordinate position of (x,y) in the {IG2(x,y)}(namely, an amount of fuzzy pixel points).

FIG. 5 is the final fusion microscopic image corresponding to FIGS. 3a and 3b. FIG. 6 is the final fusion microscopic image corresponding to FIGS. 3c and 3d. Seen from FIGS. 5 and 6, under various microscopic images, the fusion microscopic image obtained by the present invention has richer detail information compared with each of the original images shown in FIG. 3, thereby verifying the feasibility of the present invention.
In the specific embodiment, four object evaluation criteria are selected to measure objective quality of the final fusion images obtained with the present invention. The first object evaluation criterion is TenenGrad function which reflects the texture detail information of the microscopic image. The second object evaluation criterion is Variance function which reflects the integrity of the whole information of the microscopic image. The other two object evaluation criterions are DCT function and Hadamard function which reflect the amount of information in the frequency domain of the microscopic image. The larger the values of four selected object evaluation criteria are, the better the quality of the fused microscopic image is, and the clearer the texture is. Table 1 shows the comparison results of the objective quality of the original microscopic image and the fusion microscopic image obtained by the present invention. Seen from Table 1, every performance index of the fusion microscopic image obtained by the present invention is better and is consistent with the subjective perception.







TABLE 1







the comparison of the object evaluation indexes of 


the original microscopic image and the fusion 


microscopic image obtained by the present invention










First Group
Second Group














Defi-
Defi-
Defi-
Defi-
Defi-
Defi-



nition
nition
nition
nition
nition
nition



of the 1st
of the 2nd
of the 
of the 1st
of the 2nd
of the 



original
original
fused
original
original
fused



image
image
image
image
image
image





TenenGrad
9.5837
7.2121
13.5728
3.7874
5.8198
7.3080


Variance
1.0379
0.9972
 1.2308
6.1984
6.6823
7.1260


DCT
3.8604
3.3031
 4.6264
2.0471
1.7681
2.4788


Hadamard
8.4318
7.1302
 9.7902
3.6442
3.3301
4.5130









One skilled in the art will understand that the embodiment of the present invention as shown in the drawings and described above is exemplary only and not intended to be limiting.
It will thus be seen that the objects of the present invention have been fully and effectively accomplished. Its embodiments have been shown and described for the purposes of illustrating the functional and structural principles of the present invention and is subject to change without departure from such principles. Therefore, this invention includes all modifications encompassed within the spirit and scope of the following claims.

## Claims

1. A microscopic image fusion method based on region growing, comprising steps of:
(1) setting {IS1(x,y)} to one microscopic image collected under an optical microscope, and setting {IS2(x,y)} to another microscopic image collected under the optical microscope, wherein 0≦x≦W−1, 0≦y≦H−1, W denotes a width of an image, H denotes a height of the image, IS1(x,y) denotes a pixel value of a pixel point whose coordinate position is (x,y) in the {IS1(x,y)}, and IS2(x,y) denotes a pixel value of a pixel point whose coordinate position is (x,y) in the {IS2(x,y)};
(2) dividing the {IS1(x,y)} into





  
    W
    ×
    H
  
  
    n
    ×
    n
  



 non-overlapping first image blocks, each of which having a size of n×n, recording a first image block with a coordinate position of (i,j) in the {IS1(x,y)} as IB1—n(i,j), dividing the {IS2(x,y)} into





  
    W
    ×
    H
  
  
    n
    ×
    n
  



 non-overlapping second image blocks, each of which having a size of n×n, and recording a second image block with a coordinate position of (i,j) in the {IS2(x,y)} as IB2—n(i,j), wherein





  
    0
    ≤
    i
    ≤
    
      
        W
        n
      
      -
      1
    
  
  ,
  
    0
    ≤
    j
    ≤
    
      
        H
        n
      
      -
      1
    
  
  ,



 and n is 2-power;
(3) evaluating a definition of every first image block in the {IS1(x,y)} for obtaining a definition characteristic value corresponding to every first image block in the {IS1(x,y)}, and recording a corresponding definition characteristic value thereof as Fv1—n(i,j) for the first image block IB1—n(i,j) with the coordinate position of (i,j) in the {IS1(x,y)};
evaluating a definition of every second image block in the {IS2(x,y)} for obtaining a definition characteristic value corresponding to every second image block in the {IS2(x,y)}, and recording a corresponding definition characteristic value thereof as Fv2—n(i,j) for the second image block IB2—n(i,j) with the coordinate position of (i,j) in the {IS2(x,y)};
(4) determining a first decision threshold of the definition characteristic value corresponding to every first image block in the {IS1(x,y)}, recording the first decision threshold as Tn—1; and then judging whether every first image block in the {IS1(x,y)} is a fuzzy seed block according to the definition characteristic value corresponding to every first image block in the {IS1(x,y)} and the first decision threshold Tn—1, wherein for the first image block IB1—n(i,j) with the coordinate position of (i,j) in the {IS1(x,y)}, judge whether the definition characteristic value Fv1—n(i,j) corresponding to the IB1—n(i,j) is smaller than the first decision threshold Tn—1, if it's OK, then judge the IB1—n(i,j) as the fuzzy seed block and set a mark MB1—n(i,j) of every pixel point in the IB1—n(i,j) to 1, if not, judge the IB1—n(i,j) as the non-fuzzy seed block and set the mark MB1—n(i,j) of every pixel point in the IB1—n(i,j) to 0; and then according to the mark MB1—n(i,j) of every pixel point in every first image block in the {IS1(x,y)}, calculating a definition tagged image corresponding to the {IS1(x,y)} and recording the definition tagged image as {ID1—n(x,y)}, wherein ID1—n(x,y)=MB1—n(int(x/n),int(y/n)), ID1—n(x,y) denotes a mark of a pixel point with a coordinate position of (x,y) in the {ID1—n(x,y)}, and int( ) is a rounding operator;
determining a second decision threshold of the definition characteristic value corresponding to every second image block in the {IS2(x,y)}, recording the second decision threshold as Tn—2; and then judging whether every second image block in the {IS2(x,y)} is a fuzzy seed block according to the definition characteristic value corresponding to every second image block in the {IS2(x,y)} and the second decision threshold Tn—2, wherein for the second image block IB2—n(i,j) with the coordinate position of (i,j) in the {IS2(x,y)}, judge whether the definition characteristic value Fv2—n(i,j) corresponding to the IB2—n(i,j) is smaller than the second decision threshold Tn—2, if it's OK, judge the IB2—n(i,j) as the fuzzy seed block and set a mark MB2—n(i,j) of every pixel point in the IB2—n(i,j) to 1, if not, judge the IB2—n(i,j) as the non-fuzzy seed block and set the mark MB2—n(i,j) Of every pixel point in the IB2—n(i,j) to 0; and then according to the mark MB2—n(i,j) Of every pixel point in every second image block in the {IS2(x,y)}, calculating a definition tagged image corresponding to the {IS2(x,y)} and recording the definition tagged image as {ID2—n(x,y)}, wherein ID2—n(x,y)=MB2—n(int(x/n),int(y/n)), ID2—n(x,y) denotes a mark of a pixel point with a coordinate position of (x,y) in the {ID2—n(x,y)}, and int( ) is a rounding operator;
(5) setting n=128, n=64, n=32, n=16 and n=8, respectively repeating steps (3) to (4) for obtaining a definition tagged image {ID1—128(x,y)} corresponding to the {IS1(x,y)} and a definition tagged image {ID2—128(x,y)} corresponding to the {IS2(x,y)} while n=128; a definition tagged image {ID1—64(x,y)} corresponding to the {IS1(x,y)} and a definition tagged image {ID2—64(x,y)} corresponding to the {IS2(x,y)} while n=64; a definition tagged image {ID1—32(x,y)} corresponding to the {IS1(x,y)} and a definition tagged image {ID2—32(x,y)} corresponding to the {IS2(x,y)} while n=32; a definition tagged image {ID1—16(x,y)} corresponding to the {IS1(x,y)} and a definition tagged image {ID2—16(x,y)} corresponding to the {IS2(x,y)} while n=16; a definition tagged image {ID1—8(x,y)} corresponding to the {IS1(x,y)} and a definition tagged image {ID2—8(x,y)} corresponding to the {IS2(x,y)} while n=8;
(6) based on the pixel points with the mark of 1 in the {ID1—128(x,y)}, {ID1—64(x,y)}, {ID1—32(x,y)}, {ID1—16(x,y)} and {ID1—8(x,y)}, making a fuzzy region growing for obtaining a region growing image corresponding to the {IS1(x,y)} and recording the region growing image as {IG1(x,y)}, wherein IG1(x,y) denotes a mark of a pixel point with a coordinate position of (x,y) in the {IG1(x,y)};
based on the pixel points with the mark of 1 in the {ID2—128(x,y)}, {ID2—64(x,y)}, {ID2—32(x,y)}, {ID2—16(x,y)} and {ID2—8(x,y)}, making a fuzzy region growing for obtaining a region growing image corresponding to the {IS2(x,y)} and recording the region growing image as IG2(x,y), wherein IG2(x,y) denotes a mark of a pixel point with a coordinate position of (x,y) in the {IG2(x,y)}; and
(7) according to the region growing image {IG1(x,y)} corresponding to the {IS1(x,y)} and the region growing image {IG2(x,y)} corresponding to the {IS2(x,y)}, fusing the {IS1(x,y)} and the {IS2(x,y)} for obtaining a final fusion microscopic image and recording the final fusion microscopic image as {IF(x,y)}, wherein





  
    
      I
      F
    
    ⁡
    
      (
      
        x
        ,
        y
      
      )
    
  
  =
  
    {
    
      
        
          
            
              
                I
                
                  S
                  ⁢
                  
                    
                  
                  ⁢
                  1
                
              
              ⁡
              
                (
                
                  x
                  ,
                  y
                
                )
              
            
            ,
          
        
        
          
            
              if
              ⁢
              
                
              
              ⁢
              
                
                  I
                  
                    G
                    ⁢
                    
                      
                    
                    ⁢
                    1
                  
                
                ⁡
                
                  (
                  
                    x
                    ,
                    y
                  
                  )
                
              
            
            =
            
              
                0
                ⁢
                
                  
                
                ⁢
                and
                ⁢
                
                  
                
                ⁢
                
                  
                    I
                    
                      G
                      ⁢
                      
                        
                      
                      ⁢
                      2
                    
                  
                  ⁡
                  
                    (
                    
                      x
                      ,
                      y
                    
                    )
                  
                
              
              =
              1
            
          
        
      
      
        
          
            
              
                I
                
                  S
                  ⁢
                  
                    
                  
                  ⁢
                  2
                
              
              ⁡
              
                (
                
                  x
                  ,
                  y
                
                )
              
            
            ,
          
        
        
          
            
              if
              ⁢
              
                
              
              ⁢
              
                
                  I
                  
                    G
                    ⁢
                    
                      
                    
                    ⁢
                    1
                  
                
                ⁡
                
                  (
                  
                    x
                    ,
                    y
                  
                  )
                
              
            
            =
            
              
                1
                ⁢
                
                  
                
                ⁢
                and
                ⁢
                
                  
                
                ⁢
                
                  
                    I
                    
                      G
                      ⁢
                      
                        
                      
                      ⁢
                      2
                    
                  
                  ⁡
                  
                    (
                    
                      x
                      ,
                      y
                    
                    )
                  
                
              
              =
              0
            
          
        
      
      
        
          C
        
        
          
            
              
                if
                ⁢
                
                  
                
                ⁢
                
                  
                    I
                    
                      G
                      ⁢
                      
                        
                      
                      ⁢
                      1
                    
                  
                  ⁡
                  
                    (
                    
                      x
                      ,
                      y
                    
                    )
                  
                
              
              =
              
                
                  I
                  
                    G
                    ⁢
                    
                      
                    
                    ⁢
                    2
                  
                
                ⁡
                
                  (
                  
                    x
                    ,
                    y
                  
                  )
                
              
            
            ,
          
        
      
    
  



 here, IF(x,y) denotes a pixel value of a pixel point with a coordinate position of (x,y) in the {IF(x,y)},





  C
  =
  
    {
    
      
        
          
            
              
                I
                
                  S
                  ⁢
                  
                    
                  
                  ⁢
                  1
                
              
              ⁡
              
                (
                
                  x
                  ,
                  y
                
                )
              
            
            ,
          
        
        
          
            
              if
              ⁢
              
                
              
              ⁢
              
                
                  C
                  
                    nt
                    ⁢
                    
                      
                    
                    ⁢
                    1
                  
                
                ⁡
                
                  (
                  
                    x
                    ,
                    y
                  
                  )
                
              
            
            <
            
              
                C
                
                  nt
                  ⁢
                  
                    
                  
                  ⁢
                  2
                
              
              ⁡
              
                (
                
                  x
                  ,
                  y
                
                )
              
            
          
        
      
      
        
          
            
              
                I
                
                  S
                  ⁢
                  
                    
                  
                  ⁢
                  2
                
              
              ⁡
              
                (
                
                  x
                  ,
                  y
                
                )
              
            
            ,
          
        
        
          
            
              if
              ⁢
              
                
              
              ⁢
              
                
                  C
                  
                    nt
                    ⁢
                    
                      
                    
                    ⁢
                    1
                  
                
                ⁡
                
                  (
                  
                    x
                    ,
                    y
                  
                  )
                
              
            
            >
            
              
                C
                
                  nt
                  ⁢
                  
                    
                  
                  ⁢
                  2
                
              
              ⁡
              
                (
                
                  x
                  ,
                  y
                
                )
              
            
          
        
      
      
        
          
            
              
                
                  
                    I
                    
                      S
                      ⁢
                      
                        
                      
                      ⁢
                      1
                    
                  
                  ⁡
                  
                    (
                    
                      x
                      ,
                      y
                    
                    )
                  
                
                +
                
                  
                    I
                    
                      S
                      ⁢
                      
                        
                      
                      ⁢
                      2
                    
                  
                  ⁡
                  
                    (
                    
                      x
                      ,
                      y
                    
                    )
                  
                
              
              2
            
            ,
          
        
        
          
            
              
                if
                ⁢
                
                  
                
                ⁢
                
                  
                    C
                    
                      nt
                      ⁢
                      
                        
                      
                      ⁢
                      1
                    
                  
                  ⁡
                  
                    (
                    
                      x
                      ,
                      y
                    
                    )
                  
                
              
              =
              
                
                  C
                  
                    nt
                    ⁢
                    
                      
                    
                    ⁢
                    2
                  
                
                ⁡
                
                  (
                  
                    x
                    ,
                    y
                  
                  )
                
              
            
            ,
          
        
      
    
  



 Cnt1(x,y) denotes an amount of pixel points with a mark of 1 in an 8 neighbor of a pixel point with a coordinate position of (x,y) in the {IG1(x,y)}, and Cnt2(x,y) denotes an amount of pixel points with a mark of 1 in an 8 neighbor of a pixel point with a coordinate position of (x,y) in the {IG2(x,y)}.

2. The microscopic image fusion method based on region growing, as recited in claim 1, wherein in step (3), a concrete process of calculating the definition characteristic value Fv1—n(i,j) corresponding to the first image block IB1—n(i,j) with the coordinate position of (i,j) in the {IS1(x,y)} comprises steps of: (3-a1) using the improved TenenGrad gradient function to calculate a horizontal gradient and a vertical gradient of every pixel point in the IB1—n(i,j), wherein for a pixel point with a coordinate position of (x1,y1) in the IB1—n(i,j), respectively record the horizontal gradient and the vertical gradient thereof as Gh1(x1,y1) and Gv1(x1,y1), wherein


Gh1(x1,y1)=(f1(x1−1,y1−1)+2f1(x1,y1−1)+f1(x1+1,y1−1))−(f1(x1−1,y1+1)+2f1(x1,y1+1)+f1(x1+1,y1+1)),



Gv1(x1,y1)=(f1(x1+1,y1−1)+2f1(x1+1,y1)+f1(x1+1,y1+1))−(f1(x1−1,y1−1)+2f1(x1−1,y1)+f1(x1−1,y1+1)),


here, 0≦x1≦n−1, 0≦y1≦n−1, f1(x1−1,y1−1) denotes a pixel value of a pixel point with a coordinate position of (x1−1,y1−1) in the IB1—n(i,j), f1(x1,y1−1) denotes a pixel value of a pixel point with a coordinate position of (x1,y1−1) in the IB1—n(i,j), f1(x1+1,y1−1) denotes a pixel value of a pixel point with a coordinate position of (x1+1,y1−1) in the IB1—n(i,j), f1(x1−1,y1+1) denotes a pixel value of a pixel point with a coordinate position of (x1−1,y1+1) in the IB1—n(i,j), f1(x1,y1+1) denotes a pixel value of a pixel point with a coordinate position of (x1,y1+1) in the IB1—n(i,j), f1(x1+1,y1+1) denotes a pixel value of a pixel point with a coordinate position of (x1+1,y1+1) in the IB1—n(i,j), f1(x1+1,y1) denotes a pixel value of a pixel point with a coordinate position of (x1+1,y1) in the IB1—n(i,j), and f1(x1−1,y1) denotes a pixel value of a pixel point with a coordinate position of (x1−1,y1) in the IB1—n(i,j); and (3-a2) according to the horizontal gradient and the vertical gradient of every pixel point in the IB1—n(i,j), calculating the definition characteristic value Fv1—n(i,j) corresponding to the IB1—n(i,j), wherein,




  
    
      
        F
        
          v
          ⁢
          
            
          
          ⁢
          1
          ⁢
          
            
          
          ⁢
          _
          ⁢
          
            
          
          ⁢
          n
        
      
      ⁡
      
        (
        
          i
          ,
          j
        
        )
      
    
    =
    
      
        ∑
        
          
            x
            1
          
          =
          0
        
        
          n
          -
          1
        
      
      ⁢
      
        
          ∑
          
            
              y
              1
            
            =
            0
          
          
            n
            -
            1
          
        
        ⁢
        
          (
          
            
              
                G
                
                  v
                  ⁢
                  
                    
                  
                  ⁢
                  1
                
                2
              
              ⁡
              
                (
                
                  
                    x
                    1
                  
                  ,
                  
                    y
                    1
                  
                
                )
              
            
            +
            
              
                G
                
                  h
                  ⁢
                  
                    
                  
                  ⁢
                  1
                
                2
              
              ⁡
              
                (
                
                  
                    x
                    ⁢
                    
                      
                    
                    ⁢
                    1
                  
                  ,
                  
                    y
                    ⁢
                    
                      
                    
                    ⁢
                    1
                  
                
                )
              
            
          
          )
        
      
    
  
  ;



wherein in step (3), a concrete process of calculating the definition characteristic value Fv2—n(i,j) corresponding to the second image block IB2—n(i,j) with the coordinate position of (i,j) in the {IS2(x,y)} comprises steps of: (3-b1) using the improved TenenGrad gradient function to calculate a horizontal gradient and a vertical gradient of every pixel point in the IB2—n(i,j), wherein for a pixel point with a coordinate position of (x1,y1) in the IB2—n(i,j), respectively record the horizontal gradient and the vertical gradient thereof as Gh2(x1,y1) and Gv2(x1,y1), wherein


Gh2(x1,y1)=(f2(x1−1,y1−1)+2f2(x1,y1−1)+f2(x1+1,y1−1))−(f2(x1−1,y1+1)+2f2(x1,y1+1)+f2(x1+1,y1+1)),



Gv2(x1,y1)=(f2(x1+1,y1−1)+2f2(x1+1,y1)+f2(x1+1,y1+1))−(f2(x1−1,y1−1)+2f2(x1−1,y1)+f2(x1−1,y1+1))


here, 0≦x1≦n−1, 0≦y1≦n−1, f2(x1−1,y1−1) denotes a pixel value of a pixel point with a coordinate position of (x1−1,y1−1) in the IB2—n(i,j), f2(x1,y1−1) denotes a pixel value of a pixel point with a coordinate position of (x1,y1−1) in the IB2—n(i,j), f2(x1+1,y1−1) denotes a pixel value of a pixel point with a coordinate position of (x1+1,y1−1) in the IB2—n(i,j), f2(x1−1,y1+1) denotes a pixel value of a pixel point with a coordinate position of (x1−1,y1+1) in the IB2—n(i,j), f2(x1,y1+1) denotes a pixel value of a pixel point with a coordinate position of (x1,y1+1) in the IB2—n(i,j), f2(x1+1,y1+1) denotes a pixel value of a pixel point with a coordinate position of (x1+1,y1+1) in the IB2—n(i,j), f2(x1+1,y1) denotes a pixel value of a pixel point with a coordinate position of (x1+1,y1) in the IB2—n(i,j), and f2(x1−1,y1) denotes a pixel value of a pixel point with a coordinate position of (x1−1,y1) in the IB2—n(i,j); and (3-b2) according to the horizontal gradient and the vertical gradient of every pixel point in the IB2—n(i,j), calculating the definition characteristic value Fv2—n(i,j) corresponding to the IB2—n(i,j) wherein,





  
    
      F
      
        v
        ⁢
        
          
        
        ⁢
        2
        ⁢
        _
        ⁢
        
          
        
        ⁢
        n
      
    
    ⁡
    
      (
      
        i
        ,
        j
      
      )
    
  
  =
  
    
      ∑
      
        
          
        
        ⁢
        
          
            x
            1
          
          =
          0
        
      
      
        n
        -
        1
      
    
    ⁢
    
      
        ∑
        
          
            y
            1
          
          =
          0
        
        
          n
          -
          1
        
      
      ⁢
      
        
          (
          
            
              
                G
                
                  v
                  ⁢
                  
                    
                  
                  ⁢
                  2
                
                2
              
              ⁡
              
                (
                
                  
                    x
                    1
                  
                  ,
                  
                    y
                    1
                  
                
                )
              
            
            +
            
              
                G
                
                  h
                  ⁢
                  
                    
                  
                  ⁢
                  2
                
                2
              
              ⁡
              
                (
                
                  
                    x
                    ⁢
                    
                      
                    
                    ⁢
                    1
                  
                  ,
                  
                    y
                    ⁢
                    
                      
                    
                    ⁢
                    1
                  
                
                )
              
            
          
          )
        
        .

3. The microscopic image fusion method based on region growing, as recited in claim 1, wherein in step (4), a concrete process of determining the first decision threshold Tn—1 of the definition characteristic value corresponding to every first image block in the {IS1(x,y)} comprises steps of: (4-a1) sequencing the definition characteristic value corresponding to every first image block in the {IS1(x,y)}, finding out a maximum definition characteristic value and a minimum characteristic value, and respectively recording the maximum definition characteristic value and the minimum characteristic value as Fv1—n—MAX and Fv1—n—MIN; and (4-a2) calculating the first decision threshold Tn—1, wherein Tn—1=Fv1—n—MIN+(Fv1—n—MAX−Fv1—n—MIN)×w1, here, w1 is a weight factor;
wherein in step (4), the concrete process of determining the second decision threshold Tn—2 of the definition characteristic value corresponding to every second image block in the {IS2(x,y)} comprises steps of: (4-b1) sequencing the definition characteristic value corresponding to every second image block in the {IS2(x,y)}, finding out a maximum definition characteristic value and a minimum characteristic value, and respectively recording the maximum definition characteristic value and the minimum characteristic value as Fv2—n—MAX and Fv2—n—MIN; and (4-b2) calculating the second decision threshold Tn—2, wherein Tn—2=Fv2—n—MIN+(Fv2—n—MAX−Fv2—n—MIN)×w2, here, w2 is a weight factor.

4. The microscopic image fusion method based on region growing, as recited in claim 2, wherein in step (4), a concrete process of determining the first decision threshold Tn—1 of the definition characteristic value corresponding to every first image block in the {IS1(x,y)} comprises steps of: (4-a1) sequencing the definition characteristic value corresponding to every first image block in the {IS1(x,y)}, finding out a maximum definition characteristic value and a minimum characteristic value, and respectively recording the maximum definition characteristic value and the minimum characteristic value as Fv1—n—MAX and Fv1—n—MIN; and (4-a2) calculating the first decision threshold Tn—1, wherein Tn—1=Fv1—n—MIN+(Fv1—n—MAX−Fv1—n—MIN)×w1, here, w1 is a weight factor;
wherein in step (4), the concrete process of determining the second decision threshold Tn—2 of the definition characteristic value corresponding to every second image block in the {IS2(x,y)} comprises steps of: (4-b1) sequencing the definition characteristic value corresponding to every second image block in the {IS2(x,y)}, finding out a maximum definition characteristic value and a minimum characteristic value, and respectively recording the maximum definition characteristic value and the minimum characteristic value as Fv2—n—MAX and Fv2—n—MIN; and (4-b2) calculating the second decision threshold Tn—2, wherein Tn—2=Fv2—n—MIN+(Fv2—n—MAX−Fv2—n—MIN)×w2, here, w2 is a weight factor.

5. The microscopic image fusion method based on region growing, as recited in claim 3, wherein in (4-a2) of step (4), 0.4≦w1≦0.6; and in (4-b2) of step (4), 0.4≦w2≦0.6.

6. The microscopic image fusion method based on region growing, as recited in claim 4, wherein in (4-a2) of step (4), 0.4≦w1≦0.6; and in (4-b2) of step (4), 0.4≦w2≦0.6.

7. The microscopic image fusion method based on region growing, as recited in claim 1, wherein in step (6), the acquisition process of the region growing image {IG1(x,y)} corresponding to the {IS1(x,y)} comprises steps of: (6-a1) while n=128, regarding the definition tagged image {ID1—128(x,y)} corresponding to the {IS1(x,y)} as a starting seed image; (6-a2) studying 8 image blocks each of which having a size of




  
    n
    2
  
  ×
  
    n
    2
  




adjacent to every fuzzy seed block with the size of n×n in the {IS1(x,y)}, wherein if a mark




  
    I
    
      D
      ⁢
      
        
      
      ⁢
      1
      ⁢
      _
      ⁢
      
        
      
      ⁢
      
        n
        2
      
    
  
  ⁡
  
    (
    
      x
      ,
      y
    
    )
  




corresponding to every pixel point in the image block with the size of




  
    n
    2
  
  ×
  
    n
    2
  




adjacent to every fuzzy seed block with the size of n×n in {IS1(x,y)} is 1, then a mark of every pixel point in the image block with the size of




  
    n
    2
  
  ×
  
    n
    2
  




at the same position in the starting seed image is set to 1; (6-a3) setting




  
    n
    =
    
      n
      2
    
  
  ,




and returning to step (6-a2) till n=8, here, “=” is an assignment symbol in




  
    n
    =
    
      n
      2
    
  
  ;




and (6-a4) while n=8, directly setting a mark of every pixel point in image blocks in the starting seed image to 1, wherein the image blocks in the starting seed image has a same position with 8 image blocks, each of which having a size of 4×4, adjacent to every fuzzy seed block with a size of 8×8 in the {IS1(x,y)}; and then setting n=4, and directly setting a mark of every pixel point in image blocks in the starting seed image to 1, wherein the image blocks in the starting seed image has a same position with 8 image blocks, each of which having a size of 2×2, adjacent to every fuzzy seed block with a size of 4×4 in the {IS1(x,y)}; and then setting n=2, and directly setting a mark of 8 pixel points in the starting seed image to 1, wherein the 8 pixel points in the starting seed image has a same position with the 8 pixel points adjacent to every fuzzy seed block with a size of 2×2 in the {IS1(x,y)}, thereby obtaining the region growing image {IG1(x,y)} corresponding to the {IS1(x,y)}, wherein the pixel point in {IS1(x,y)} whose corresponding mark in {IG1(x,y)} is 1 is a fuzzy pixel point, and the pixel point in {IS1(x,y)} whose corresponding mark in {IG1(x,y)} is 0 is a non-fuzzy pixel point;
wherein in step (6), the acquisition process of the region growing image {IG2(x,y)} corresponding to the {IS2(x,y)} comprises steps of: (6-b1) while n=128, regarding the definition tagged image {ID2—128(x,y)} corresponding to the {IS2(x,y)} as a starting seed image; (6-b2) studying 8 image blocks each of which having a size of





  
    n
    2
  
  ×
  
    n
    2
  



 adjacent to every fuzzy seed block with the size of n×n in the {IS2(x,y)}, wherein if a mark of





  
    I
    
      D
      ⁢
      
        
      
      ⁢
      2
      ⁢
      _
      ⁢
      
        
      
      ⁢
      
        n
        2
      
    
  
  ⁡
  
    (
    
      x
      ,
      y
    
    )
  



 corresponding to every pixel point in the image block with the size of





  
    n
    2
  
  ×
  
    n
    2
  



 adjacent to every fuzzy seed block with the size of n×n in {IS2(x,y)} is 1, then a mark of every pixel point in the image block with the size of





  
    n
    2
  
  ×
  
    n
    2
  



 at the same position in the starting seed image is set to 1; (6-b3) setting





  
    n
    =
    
      n
      2
    
  
  ,



 and returning to step (6-b2) till n=8, here, “=” is an assignment symbol in





  
    n
    =
    
      n
      2
    
  
  ;



 and (6-b4) while n=8, directly setting a mark of every pixel point in image blocks in the starting seed image to 1, wherein the image blocks in the starting seed image has a same position with 8 image blocks, each of which having a size of 4×4, adjacent to every fuzzy seed block with a size of 8×8 in the {IS2(x,y)}; and then setting n=4, and directly setting a mark of every pixel point in image blocks in the starting seed image to 1, wherein the image blocks in the starting seed image has a same position with 8 image blocks, each of which having a size of 2×2, adjacent to every fuzzy seed block with a size of 4×4 in the {IS2(x,y)}; and then setting n=2, and directly setting a mark of 8 pixel points in the starting seed image to 1, wherein the 8 pixel points in the starting seed image has a same position with the 8 pixel points adjacent to every fuzzy seed block with a size of 2×2 in the {IS2(x,y)}, thereby obtaining the region growing image {IG2(x,y)} corresponding to the {IS2(x,y)}, wherein the pixel point in {IS2(x,y)} whose corresponding mark in {IG2(x,y)} is 1 is a fuzzy pixel point, and the pixel point in {IS2(x,y)} whose corresponding mark in {IG2(x,y)} is 0 is a non-fuzzy pixel point.

8. The microscopic image fusion method based on region growing, as recited in claim 2, wherein in step (6), the acquisition process of the region growing image {IG1(x,y)} corresponding to the {IS1(x,y)} comprises steps of: (6-a1) while n=128, regarding the definition tagged image {ID1—128(x,y)} corresponding to the {IS1(x,y)} as a starting seed image; (6-a2) studying 8 image blocks each of which having a size of




  
    n
    2
  
  ×
  
    n
    2
  




adjacent to every fuzzy seed block with the size of n×n in the {IS1(x,y)}, wherein if a mark




  
    I
    
      D
      ⁢
      
        
      
      ⁢
      1
      ⁢
      _
      ⁢
      
        n
        2
      
    
  
  ⁡
  
    (
    
      x
      ,
      y
    
    )
  




corresponding to every pixel point in the image block with the size of




  
    n
    2
  
  ×
  
    n
    2
  




adjacent to every fuzzy seed block with the size of n×n in {IS1(x,y)} is 1, then a mark of every pixel point in the image block with the size of




  
    n
    2
  
  ×
  
    n
    2
  




at the same position in the starting seed image is set to 1; (6-a3) setting




  
    n
    =
    
      n
      2
    
  
  ,




and returning to step (6-a2) till n=8, here, “=” is an assignment symbol in




  
    n
    =
    
      n
      2
    
  
  ;




and (6-a4) while n=8, directly setting a mark of every pixel point in image blocks in the starting seed image to 1, wherein the image blocks in the starting seed image has a same position with 8 image blocks, each of which having a size of 4×4, adjacent to every fuzzy seed block with a size of 8×8 in the {IS1(x,y)}; and then setting n=4, and directly setting a mark of every pixel point in image blocks in the starting seed image to 1, wherein the image blocks in the starting seed image has a same position with 8 image blocks, each of which having a size of 2×2, adjacent to every fuzzy seed block with a size of 4×4 in the {IS1(x,y)}; and then setting n=2, and directly setting a mark of 8 pixel points in the starting seed image to 1, wherein the 8 pixel points in the starting seed image has a same position with the 8 pixel points adjacent to every fuzzy seed block with a size of 2×2 in the {IS1(x,y)}, thereby obtaining the region growing image {IG1(x,y)} corresponding to the {IS1(x,y)}, wherein the pixel point in {IS1(x,y)} whose corresponding mark in {IG1(x,y)} is 1 is a fuzzy pixel point, and the pixel point in {IS1(x,y)} whose corresponding mark in {IG1(x,y)} is 0 is a non-fuzzy pixel point;
wherein in step (6), the acquisition process of the region growing image {IG2(x,y)} corresponding to the {IS2(x,y)} comprises steps of: (6-b1) while n=128, regarding the definition tagged image {ID2—128(x,y)} corresponding to the {IS2(x,y)} as a starting seed image; (6-b2) studying 8 image blocks each of which having a size of





  
    n
    2
  
  ×
  
    n
    2
  



 adjacent to every fuzzy seed block with the size of n×n in the {IS2(x,y)}, wherein if a mark of





  
    I
    
      D
      ⁢
      
        
      
      ⁢
      2
      ⁢
      _
      ⁢
      
        
      
      ⁢
      
        n
        
          2
          ⁢
          
            
          
        
      
    
  
  ⁡
  
    (
    
      x
      ,
      y
    
    )
  



 corresponding to every pixel point in the image block with the size of





  
    n
    2
  
  ×
  
    n
    2
  



 adjacent to every fuzzy seed block with the size of n×n in {IS2(x,y)} is 1, then a mark of every pixel point in the image block with the size of





  
    n
    2
  
  ×
  
    n
    2
  



 at the same position in the starting seed image is set to 1; (6-b3) setting





  
    n
    =
    
      n
      2
    
  
  ,



 and returning to step (6-b2) till n=8, here, “=” is an assignment symbol in





  
    n
    =
    
      n
      2
    
  
  ;



 and (6-b4) while n=8, directly setting a mark of every pixel point in image blocks in the starting seed image to 1, wherein the image blocks in the starting seed image has a same position with 8 image blocks, each of which having a size of 4×4, adjacent to every fuzzy seed block with a size of 8×8 in the {IS2(x,y)}; and then setting n=4, and directly setting a mark of every pixel point in image blocks in the starting seed image to 1, wherein the image blocks in the starting seed image has a same position with 8 image blocks, each of which having a size of 2×2, adjacent to every fuzzy seed block with a size of 4×4 in the {IS2(x,y)}; and then setting n=2, and directly setting a mark of 8 pixel points in the starting seed image to 1, wherein the 8 pixel points in the starting seed image has a same position with the 8 pixel points adjacent to every fuzzy seed block with a size of 2×2 in the {IS2(x,y)}, thereby obtaining the region growing image {IG2(x,y)} corresponding to the {IS2(x,y)}, wherein the pixel point in {IS2(x,y)} whose corresponding mark in {IG2(x,y)} is 1 is a fuzzy pixel point, and the pixel point in {IS2(x,y)} whose corresponding mark in {IG2(x,y)} is 0 is a non-fuzzy pixel point.

9. The microscopic image fusion method based on region growing, as recited in claim 3, wherein in step (6), the acquisition process of the region growing image {IG1(x,y)} corresponding to the {IS1(x,y)} comprises steps of: (6-a1) while n=128, regarding the definition tagged image {ID1—128(x,y)} corresponding to the {IS1(x,y)} as a starting seed image; (6-a2) studying 8 image blocks each of which having a size of




  
    n
    2
  
  ×
  
    n
    2
  




adjacent to every fuzzy seed block with the size of n×n in the {IS1(x,y)}, wherein if a mark




  
    I
    
      D
      ⁢
      
        
      
      ⁢
      2
      ⁢
      _
      ⁢
      
        
      
      ⁢
      
        n
        
          2
          ⁢
          
            
          
        
      
    
  
  ⁡
  
    (
    
      x
      ,
      y
    
    )
  




corresponding to every pixel point in the image block with the size of




  
    n
    2
  
  ×
  
    n
    2
  




adjacent to every fuzzy seed block with the size of n×n in {IS1(x,y)} is 1, then a mark of every pixel point in the image block with the size of




  
    n
    2
  
  ×
  
    n
    2
  




at the same position in the starting seed image is set to 1; (6-a3) setting




  
    n
    =
    
      n
      2
    
  
  ,




and returning to step (6-a2) till n=8, here, “=” is an assignment symbol in




  
    n
    =
    
      n
      2
    
  
  ;




and (6-a4) while n=8, directly setting a mark of every pixel point in image blocks in the starting seed image to 1, wherein the image blocks in the starting seed image has a same position with 8 image blocks, each of which having a size of 4×4, adjacent to every fuzzy seed block with a size of 8×8 in the {IS1(x,y)}; and then setting n=4, and directly setting a mark of every pixel point in image blocks in the starting seed image to 1, wherein the image blocks in the starting seed image has a same position with 8 image blocks, each of which having a size of 2×2, adjacent to every fuzzy seed block with a size of 4×4 in the {IS1(x,y)}; and then setting n=2, and directly setting a mark of 8 pixel points in the starting seed image to 1, wherein the 8 pixel points in the starting seed image has a same position with the 8 pixel points adjacent to every fuzzy seed block with a size of 2×2 in the {IS1(x,y)}, thereby obtaining the region growing image {IG1(x,y)} corresponding to the {IS1(x,y)}, wherein the pixel point in {IS1(x,y)} whose corresponding mark in {IG1(x,y)} is 1 is a fuzzy pixel point, and the pixel point in {IS1(x,y)} whose corresponding mark in {IG1(x,y)} is 0 is a non-fuzzy pixel point;
wherein in step (6), the acquisition process of the region growing image {IG2(x,y)} corresponding to the {IS2(x,y)} comprises steps of: (6-b1) while n=128, regarding the definition tagged image {ID2—128(x,y)} corresponding to the {IS2(x,y)} as a starting seed image; (6-b2) studying 8 image blocks each of which having a size of





  
    n
    2
  
  ×
  
    n
    2
  



 adjacent to every fuzzy seed block with the size of n×n in the {IS2(x,y)}, wherein if a mark of





  
    I
    
      D
      ⁢
      
        
      
      ⁢
      2
      ⁢
      _
      ⁢
      
        
      
      ⁢
      
        n
        2
      
    
  
  ⁡
  
    (
    
      x
      ,
      y
    
    )
  



 corresponding to every pixel point in the image block with the size of





  
    n
    2
  
  ×
  
    n
    2
  



 adjacent to every fuzzy seed block with the size of n×n in {IS2(x,y)} is 1, then a mark of every pixel point in the image block with the size of





  
    n
    2
  
  ×
  
    n
    2
  



 at the same position in the starting seed image is set to 1; (6-b3) setting





  
    n
    =
    
      n
      2
    
  
  ,



 and returning to step (6-b2) till n=8, here, “=” is an assignment symbol in





  
    n
    =
    
      n
      2
    
  
  ;



 and (6-b4) while n=8, directly setting a mark of every pixel point in image blocks in the starting seed image to 1, wherein the image blocks in the starting seed image has a same position with 8 image blocks, each of which having a size of 4×4, adjacent to every fuzzy seed block with a size of 8×8 in the {IS2(x,y)}; and then setting n=4, and directly setting a mark of every pixel point in image blocks in the starting seed image to 1, wherein the image blocks in the starting seed image has a same position with 8 image blocks, each of which having a size of 2×2, adjacent to every fuzzy seed block with a size of 4×4 in the {IS2(x,y)}; and then setting n=2, and directly setting a mark of 8 pixel points in the starting seed image to 1, wherein the 8 pixel points in the starting seed image has a same position with the 8 pixel points adjacent to every fuzzy seed block with a size of 2×2 in the {IS2(x,y)}, thereby obtaining the region growing image {IG2(x,y)} corresponding to the {IS2(x,y)}, wherein the pixel point in {IS2(x,y)} whose corresponding mark in {IG2(x,y)} is 1 is a fuzzy pixel point, and the pixel point in {IS2(x,y)} whose corresponding mark in {IG2(x,y)} is 0 is a non-fuzzy pixel point.

10. The microscopic image fusion method based on region growing, as recited in claim 4, wherein in step (6), the acquisition process of the region growing image {IG1(x,y)} corresponding to the {IS1(x,y)} comprises steps of: (6-a1) while n=128, regarding the definition tagged image {ID1—128(x,y)} corresponding to the {IS1(x,y)} as a starting seed image; (6-a2) studying 8 image blocks each of which having a size of




  
    n
    2
  
  ×
  
    n
    2
  




adjacent to every fuzzy seed block with the size of n×n in the {IS1(x,y)}, wherein if a mark




  
    I
    
      D
      ⁢
      
        
      
      ⁢
      1
      ⁢
      _
      ⁢
      
        
      
      ⁢
      
        n
        2
      
    
  
  ⁡
  
    (
    
      x
      ,
      y
    
    )
  




corresponding to every pixel point in the image block with the size of




  
    n
    2
  
  ×
  
    n
    2
  




adjacent to every fuzzy seed block with the size of n×n in {IS1(x,y)} is 1, then a mark of every pixel point in the image block with the size of




  
    n
    2
  
  ×
  
    n
    2
  




at the same position in the starting seed image is set to 1; (6-a3) setting




  
    n
    =
    
      n
      2
    
  
  ,




and returning to step (6-a2) till n=8, here, “=” is an assignment symbol in




  
    n
    =
    
      n
      2
    
  
  ;




and (6-a4) while n=8, directly setting a mark of every pixel point in image blocks in the starting seed image to 1, wherein the image blocks in the starting seed image has a same position with 8 image blocks, each of which having a size of 4×4, adjacent to every fuzzy seed block with a size of 8×8 in the {IS1(x,y)}; and then setting n=4, and directly setting a mark of every pixel point in image blocks in the starting seed image to 1, wherein the image blocks in the starting seed image has a same position with 8 image blocks, each of which having a size of 2×2, adjacent to every fuzzy seed block with a size of 4×4 in the {IS1(x,y)}; and then setting n=2, and directly setting a mark of 8 pixel points in the starting seed image to 1, wherein the 8 pixel points in the starting seed image has a same position with the 8 pixel points adjacent to every fuzzy seed block with a size of 2×2 in the {IS1(x,y)}, thereby obtaining the region growing image {IG1(x,y)} corresponding to the {IS1(x,y)}, wherein the pixel point in {IS1(x,y)} whose corresponding mark in {IG1(x,y)} is 1 is a fuzzy pixel point, and the pixel point in {IS1(x,y)} whose corresponding mark in {IG1(x,y)} is 0 is a non-fuzzy pixel point;
wherein in step (6), the acquisition process of the region growing image {IG2(x,y)} corresponding to the {IS2(x,y)} comprises steps of: (6-b1) while n=128, regarding the definition tagged image {ID2—128(x,y)} corresponding to the {IS2(x,y)} as a starting seed image; (6-b2) studying 8 image blocks each of which having a size of





  
    n
    2
  
  ×
  
    n
    2
  



 adjacent to every fuzzy seed block with the size of n×n in the {IS2(x,y)}, wherein if a mark of





  
    I
    
      D
      ⁢
      
        
      
      ⁢
      2
      ⁢
      _
      ⁢
      
        
      
      ⁢
      
        n
        2
      
    
  
  ⁡
  
    (
    
      x
      ,
      y
    
    )
  



 corresponding to every pixel point in the image block with the size of





  
    n
    2
  
  ×
  
    n
    2
  



 adjacent to every fuzzy seed block with the size of n×n in {IS2(x,y)} is 1, then a mark of every pixel point in the image block with the size of





  
    n
    2
  
  ×
  
    n
    2
  



 at the same position in the starting seed image is set to 1; (6-b3) setting





  
    n
    =
    
      n
      2
    
  
  ,



 and returning to step (6-b2) till n=8, here, “=” is an assignment symbol in





  
    n
    =
    
      n
      2
    
  
  ;



 and (6-b4) while n=8, directly setting a mark of every pixel point in image blocks in the starting seed image to 1, wherein the image blocks in the starting seed image has a same position with 8 image blocks, each of which having a size of 4×4, adjacent to every fuzzy seed block with a size of 8×8 in the {IS2(x,y)}; and then setting n=4, and directly setting a mark of every pixel point in image blocks in the starting seed image to 1, wherein the image blocks in the starting seed image has a same position with 8 image blocks, each of which having a size of 2×2, adjacent to every fuzzy seed block with a size of 4×4 in the {IS2(x,y)}; and then setting n=2, and directly setting a mark of 8 pixel points in the starting seed image to 1, wherein the 8 pixel points in the starting seed image has a same position with the 8 pixel points adjacent to every fuzzy seed block with a size of 2×2 in the {IS2(x,y)}, thereby obtaining the region growing image {IG2(x,y)} corresponding to the {IS2(x,y)}, wherein the pixel point in {IS2(x,y)} whose corresponding mark in {IG2(x,y)} is 1 is a fuzzy pixel point, and the pixel point in {IS2(x,y)} whose corresponding mark in {IG2(x,y)} is 0 is a non-fuzzy pixel point.

11. The microscopic image fusion method based on region growing, as recited in claim 5, wherein in step (6), the acquisition process of the region growing image {IG1(x,y)} corresponding to the {IS1(x,y)} comprises steps of: (6-a1) while n=128, regarding the definition tagged image {ID1—128(x,y)} corresponding to the {IS1(x,y)} as a starting seed image; (6-a2) studying 8 image blocks each of which having a size of




  
    n
    2
  
  ×
  
    n
    2
  




adjacent to every fuzzy seed block with the size of n×n in the {IS1(x,y)}, wherein if a mark




  
    I
    
      D
      ⁢
      
        
      
      ⁢
      1
      ⁢
      
        
      
      ⁢
      _
      ⁢
      
        
      
      ⁢
      
        n
        2
      
    
  
  ⁡
  
    (
    
      x
      ,
      y
    
    )
  




corresponding to every pixel point in the image block with the size of




  
    n
    2
  
  ×
  
    n
    2
  




adjacent to every fuzzy seed block with the size of n×n in {IS1(x,y)} is 1, then a mark of every pixel point in the image block with the size of




  
    n
    2
  
  ×
  
    n
    2
  




at the same position in the starting seed image is set to 1; (6-a3) setting




  
    n
    =
    
      n
      2
    
  
  ,




and returning to step (6-a2) till n=8, here, “=” is an assignment symbol in




  
    n
    =
    
      n
      2
    
  
  ;




and (6-a4) while n=8, directly setting a mark of every pixel point in image blocks in the starting seed image to 1, wherein the image blocks in the starting seed image has a same position with 8 image blocks, each of which having a size of 4×4, adjacent to every fuzzy seed block with a size of 8×8 in the {IS1(x,y)}; and then setting n=4, and directly setting a mark of every pixel point in image blocks in the starting seed image to 1, wherein the image blocks in the starting seed image has a same position with 8 image blocks, each of which having a size of 2×2, adjacent to every fuzzy seed block with a size of 4×4 in the {IS1(x,y)}; and then setting n=2, and directly setting a mark of 8 pixel points in the starting seed image to 1, wherein the 8 pixel points in the starting seed image has a same position with the 8 pixel points adjacent to every fuzzy seed block with a size of 2×2 in the {IS1(x,y)}, thereby obtaining the region growing image {IG1(x,y)} corresponding to the {IS1(x,y)}, wherein the pixel point in {IS1(x,y)} whose corresponding mark in {IG1(x,y)} is 1 is a fuzzy pixel point, and the pixel point in {IS1(x,y)} whose corresponding mark in {IG1(x,y)} is 0 is a non-fuzzy pixel point;
wherein in step (6), the acquisition process of the region growing image {IG2(x,y)} corresponding to the {IS2(x,y)} comprises steps of: (6-b1) while n=128, regarding the definition tagged image {ID2—128(x,y)} corresponding to the {IS2(x,y)} as a starting seed image; (6-b2) studying 8 image blocks each of which having a size of





  
    n
    2
  
  ×
  
    n
    2
  



 adjacent to every fuzzy seed block with the size of n×n in the {IS2(x,y)}, wherein if a mark





  
    I
    
      D
      ⁢
      
        
      
      ⁢
      2
      ⁢
      
        
      
      ⁢
      _
      ⁢
      
        
      
      ⁢
      
        n
        2
      
    
  
  ⁡
  
    (
    
      x
      ,
      y
    
    )
  



 corresponding to every pixel point in the image block with the size of





  
    n
    2
  
  ×
  
    n
    2
  



 adjacent to every fuzzy seed block with the size of n×n in {IS2(x,y)} is 1, then a mark of every pixel point in the image block with the size of





  
    n
    2
  
  ×
  
    n
    2
  



 at the same position in the starting seed image is set to 1; (6-b3) setting





  
    n
    =
    
      n
      2
    
  
  ,



 and returning to step (6-b2) till n=8, here, “=” is an assignment symbol in





  
    n
    =
    
      n
      2
    
  
  ;



 and (6-b4) while n=8, directly setting a mark of every pixel point in image blocks in the starting seed image to 1, wherein the image blocks in the starting seed image has a same position with 8 image blocks, each of which having a size of 4×4, adjacent to every fuzzy seed block with a size of 8×8 in the {IS2(x,y)}; and then setting n=4, and directly setting a mark of every pixel point in image blocks in the starting seed image to 1, wherein the image blocks in the starting seed image has a same position with 8 image blocks, each of which having a size of 2×2, adjacent to every fuzzy seed block with a size of 4×4 in the {IS2(x,y)}; and then setting n=2, and directly setting a mark of 8 pixel points in the starting seed image to 1, wherein the 8 pixel points in the starting seed image has a same position with the 8 pixel points adjacent to every fuzzy seed block with a size of 2×2 in the {IS2(x,y)}, thereby obtaining the region growing image {IG2(x,y)} corresponding to the {IS2(x,y)}, wherein the pixel point in {IS2(x,y)} whose corresponding mark in {IG2(x,y)} is 1 is a fuzzy pixel point, and the pixel point in {IS2(x,y)} whose corresponding mark in {IG2(x,y)} is 0 is a non-fuzzy pixel point.

12. The microscopic image fusion method based on region growing, as recited in claim 6, wherein in step (6), the acquisition process of the region growing image {IG1(x,y)} corresponding to the {IS1(x,y)} comprises steps of: (6-a1) while n=128, regarding the definition tagged image {ID1—128(x,y)} corresponding to the {IS1(x,y)} as a starting seed image; (6-a2) studying 8 image blocks each of which having a size of




  
    n
    2
  
  ×
  
    n
    2
  




adjacent to every fuzzy seed block with the size of n×n in the {IS1(x,y)}, wherein if a mark




  
    I
    
      D
      ⁢
      
        
      
      ⁢
      1
      ⁢
      _
      ⁢
      
        n
        2
      
    
  
  ⁡
  
    (
    
      x
      ,
      y
    
    )
  




corresponding to every pixel point in the image block with the size of




  
    n
    2
  
  ×
  
    n
    2
  




adjacent to every fuzzy seed block with the size of n×n in {IS1(x,y)} is 1, then a mark of every pixel point in the image block with the size of




  
    n
    2
  
  ×
  
    n
    2
  




at the same position in the starting seed image is set to 1; (6-a3) setting




  
    n
    =
    
      n
      2
    
  
  ,




and returning to step (6-a2) till n=8, here, “=” is an assignment symbol in




  
    n
    =
    
      n
      2
    
  
  ;




and (6-a4) while n=8, directly setting a mark of every pixel point in image blocks in the starting seed image to 1, wherein the image blocks in the starting seed image has a same position with 8 image blocks, each of which having a size of 4×4, adjacent to every fuzzy seed block with a size of 8×8 in the {IS1(x,y)}; and then setting n=4, and directly setting a mark of every pixel point in image blocks in the starting seed image to 1, wherein the image blocks in the starting seed image has a same position with 8 image blocks, each of which having a size of 2×2, adjacent to every fuzzy seed block with a size of 4×4 in the {IS1(x,y)}; and then setting n=2, and directly setting a mark of 8 pixel points in the starting seed image to 1, wherein the 8 pixel points in the starting seed image has a same position with the 8 pixel points adjacent to every fuzzy seed block with a size of 2×2 in the {IS1(x,y)}, thereby obtaining the region growing image {IG1(x,y)} corresponding to the {IS1(x,y)}, wherein the pixel point in {IS1(x,y)} whose corresponding mark in {IG1(x,y)} is 1 is a fuzzy pixel point, and the pixel point in {IS1(x,y)} whose corresponding mark in {IG1(x,y)} is 0 is a non-fuzzy pixel point;
wherein in step (6), the acquisition process of the region growing image {IG2(x,y)} corresponding to the {IS2(x,y)} comprises steps of: (6-b1) while n=128, regarding the definition tagged image {ID2—128(x,y)} corresponding to the {IS2(x,y)} as a starting seed image; (6-b2) studying 8 image blocks each of which having a size of





  
    n
    2
  
  ×
  
    n
    2
  



 adjacent to every fuzzy seed block with the size of n×n in the {IS2(x,y)}, wherein if a mark





  
    I
    
      D
      ⁢
      
        
      
      ⁢
      2
      ⁢
      _
      ⁢
      
        
      
      ⁢
      
        n
        2
      
    
  
  ⁡
  
    (
    
      x
      ,
      y
    
    )
  



 corresponding to every pixel point in the image block with the size of





  
    n
    2
  
  ×
  
    n
    2
  



 adjacent to every fuzzy seed block with the size of n×n in {IS2(x,y)} is 1, then a mark of every pixel point in the image block with the size of





  
    n
    2
  
  ×
  
    n
    2
  



 at the same position in the starting seed image is set to 1; (6-b3) setting





  
    n
    =
    
      n
      2
    
  
  ,



 and returning to step (6-b2) till n=8, here, “=” is an assignment symbol in





  
    n
    =
    
      n
      2
    
  
  ;



 and (6-b4) while n=8, directly setting a mark of every pixel point in image blocks in the starting seed image to 1, wherein the image blocks in the starting seed image has a same position with 8 image blocks, each of which having a size of 4×4, adjacent to every fuzzy seed block with a size of 8×8 in the {IS2(x,y)}; and then setting n=4, and directly setting a mark of every pixel point in image blocks in the starting seed image to 1, wherein the image blocks in the starting seed image has a same position with 8 image blocks, each of which having a size of 2×2, adjacent to every fuzzy seed block with a size of 4×4 in the {IS2(x,y)}; and then setting n=2, and directly setting a mark of 8 pixel points in the starting seed image to 1, wherein the 8 pixel points in the starting seed image has a same position with the 8 pixel points adjacent to every fuzzy seed block with a size of 2×2 in the {IS2(x,y)}, thereby obtaining the region growing image {IG2(x,y)} corresponding to the {IS2(x,y)}, wherein the pixel point in {IS2(x,y)} whose corresponding mark in {IG2(x,y)} is 1 is a fuzzy pixel point, and the pixel point in {IS2(x,y)} whose corresponding mark in {IG2(x,y)} is 0 is a non-fuzzy pixel point.