# Patent

## Title
Method for reducing image fuzzy degree of TDI-CCD camera

## Abstract

The present invention belongs to the field of image processing, and particularly relates to the determination of an aerial remote sensing image fuzzy parameter and the elimination of aerial remote sensing image fuzziness based on a TDI-CCD camera. The method comprises the following specific steps: establishing an image coordinate system, reading an area array image, constructing a similarity matching criterion, conducting offset resolving to acquire homonymy points so as to obtain a digital image reducing the chattering influence. The method is relatively simple and precise in computing process, and good in processing effect.

## Background
TECHNICAL FIELD OF THE INVENTION
The current invention belongs in the field of image processing; in particular, it is related to the determination of the parameters of blur of aerial remote sensing images and the removal of the blur of aerial remote sensing images.
BACKGROUND OF THE INVENTION
High-resolution remote sensing images are widely used in areas such as reconnaissance, geographical information system (GIS), digital city and road construction. The imaging devices that are carried on aircrafts and spacecrafts domestically and internationally, which use Time Delay Integration Charge Coupled Device (hereafter abbreviated as TDI-CCD) as the imaging target surface are called TDI-CCD cameras. TDI-CCD camera utilizes a technique that integrates the radiation energy of the same instant field of view (IFOV) on the ground m times, which is equivalent to increasing the exposure time of the same instant field of view from T to mT, but without the need to reduce the flying speed of the flying vehicles. Using this characteristic of the TDI-CCD cameras, images with geometrical resolutions higher than images obtained through single-integration technique may be obtained. The structure of the TDI-CCD cameras is a rectangular CCD array-oriented with a very large length to width ratio, which is functionally speaking equivalent to a linear array CCD. The important prerequisite for a TDI-CCD camera to obtain high-quality images is: all of the m CCD pixels having the logic relationship of delayed integration correspond to the same instant field of view, but the vibrations of the remote sensing platforms such as satellites and aircrafts prevent the imaging environment of the TDI-CCD cameras from satisfying this prerequisite. Satellites in operation have low-frequency vibrations caused by rigid body movement and middle- to high-frequency vibrations caused by the operations of the components for attitude control of the carrying capsulepayloads, for example, the vibrations caused by movements of the sun panels and the vibrations caused by the dynamic unbalance of flywheels or moment-control gyros. The vibration becomes divergent when the frequency and amplitude reach a certain critical value, thus flutter occurs. Oscillation is a very complicated physical phenomenon. For satellite platform, the oscillations of the satellite caused by perturbation could be the oscillations of a certain component, the coupling oscillations of several components, as well as the oscillations of the whole satellite. The TDI-CCD camera carried on a satellite is affected by oscillations, showing as the oscillations of the six exterior orientation elements (spatial locations (X, Y, Z) and the roll angles, pitch angles and yaw angles around the three axes x, y and z) of the camera. The irregular reciprocating translations of the camera in the three-dimensional spatial locations, the reciprocating angular vibrations around the three optical axes of the camera, and the composite motions caused by the disalignment of the optical center of the camera and the center of vibration of the flying vehicle form a very complicated process. But the results are similar: the oscillations described above cause the m CCD pixels having a logic relationship of delayed integration not to completely correspond to the same field of view, energies from different instant fields of view are superimposed as the energy from the same instant field of view, the motion blurs of imaging during flight of the flying vehicle is also superimposed, causing declines of the spatial resolutions of the remote sensing images, loss of the detail information and distortions of the pixel radiation energies. In the same oscillation environment, the higher the geometrical resolution of imaging, the larger the effect caused by oscillations on image blur. This result is contradictory to the original intention of using TDI-CCD cameras to obtain images with high spatial resolution.
In the remote sensing imaging process of the TDI-CCD cameras, M-level-integral correspond to the energy of m ground instant fields of view. If, ignoring the effect of the change of the instant field of view on the blur of the images in one integration period, using the instant field of view under an oscillation-free ideal environment as the true location, then the m instant fields of view of the ground actually obtained have misalignment errors of varying degrees relating to the true location. We further decompose this kind of misalignment errors into the following three vectors: the front (back) misalignment along the direction of integration of the TDI-CCD (the heading of the flying vehicle); the misalignment to the left and right perpendicular to the direction of integration of the TDI-CCD; the rotational misalignment rotating around the vertical axis.
Currently, the processing methods directed at image blurs are roughly direct algorithm and blind restoration algorithm, iterations algorithm. The direct calculation method is to extract motion functions from the images themselves, but because of the randomness of the excitation time of the multiple types of vibration sources, this method results in complexity and irregularity of the combined effect of the vibrations. This causes the algorithm of inversion not able to be accurate, and the result of blur removal is not satisfactory. However, although the blind restoration algorithm does not require the point spread function to be known beforehand, this algorithm needs conducting of an initial estimation of the point spread function, and the accuracy of the estimation is uncertain, and relatively good blur removal result cannot be obtained.
SUMMARY OF THE INVENTION
To eliminate the degradation of image quality caused by oscillations, the current invention puts forth a new transmission process of TDI-CCD camera signals, and provides a new data processing method directed toward this process:
The target area of the TDI-CCD camera utilized in the current invention is n columns and m rows, and the steps are described below:

    
    
        S1. establish a coordinate system of the image: the direction of the number of pixels on the TDI-CCD camera area array, i.e., the direction of columns, is the Y axis, while the direction of the grade of the pixels on the TDI-CCD camera area array, i.e. the direction of rows, is the X axis, the upper left corner of the image is the starting point of the coordinate system, wherein the coordinate for the first row and first column is (0,0);
        S2. read the area array images of the TDI-CCD camera outputted from each integration and number the images: the images are sequentially numbered as G1, G2, G3 . . . Gt . . . Gm;
        S3. decompose the area array images: decompose each image read in S2 by rows, the area array images outputted from each grade of integration are decomposed into m rows, each row having n pixels, each row forms a one-dimensional digital signal after decomposition, the signal length being n, the first N pixels are extracted from each one-dimensional digital signal, separately forming one-dimensional digital signal series recorded as f(t), wherein 0≦t≦m, 0≦N≦n;
        S4. according to the one-dimensional digital signal series, construct similarity matching rules for two one-dimensional signal series, including:
        
            S41. Select the signal series f(i) as the benchmark series, carry out comparison between the signal series f(j) and the benchmark series, the neighborhood identicalness matching condition for the signal series is: ∥vij−vkl∥≦5, wherein indicates the 2-norm operation vij indicates the disparity vector between any two pixels of the two signal series, i represents the index of the pixels in the signal series f(i), j represents the index of the pixels in the signal series f(j), k is the neighborhood of i, l is the neighborhood of j;
            S42. calculate the initial matching probability according to the neighborhood identicalness matching condition of said signal series of S41:
        
        
    
    






  
    
      p
      ij
      
        (
        0
        )
      
    
    =
    
      1
      
        1
        +
        
          w
          ij
        
      
    
  
  ,




    
    
        wherein wijΣ|λ|≦k[g1(i+λ)−g2(j+λ)]2, pij(0) is the initial matching probability, g1(i+λ) represents the gray value at the (i+λ)th pixel of the one-dimensional signal series f(i), g2(j+λ) represents the gray value at the (j+λ)th pixel of the one-dimensional signal series f(j);
        
            S43. according to relaxation method, establish the iteration formula) of qij: pij ̃(r)=Apij(r−1)+Bqij(r−1), wherein
        
        
    
    






  
    
      q
      ij
    
    =
    
      
        ∑
        k
      
      ⁢
      
        
          ∑
          l
        
        ⁢
        
          p
          kl
        
      
    
  
  ,




    
    
        r is iterations), A and B are constants;
        
            S44. according to the iteration formula of S43, obtain the post-normalization matching probability
        
        
    
    






  
    
      
        p
        ij
        
          (
          r
          )
        
      
      :
      
        p
        ij
        
          (
          r
          )
        
      
    
    =
    
      
        p
        ij
        
          ∼
          
            (
            r
            )
          
        
      
      
        
          ∑
          h
        
        ⁢
        
          p
          ij
          
            ∼
            
              (
              r
              )
            
          
        
      
    
  
  ,




    
    
        wherein, h represents all the points that match i;
        
            S45. the Convergence of the sequence of pij′ can be known according to the matching probability obtained in S44, i.e. pij≈1, and the other elements approach 0, wherein,
        
        
    
    






  
    p
    ij
    r
  
  =
  
    [
    
      
        
          
            p
            
              0
              ,
              0
            
          
        
        
          
            p
            
              0
              ,
              1
            
          
        
        
          
            p
            
              0
              ,
              2
            
          
        
        
          
            p
            
              0
              ,
              3
            
          
        
        
          ...
        
        
          
            p
            
              0
              ,
              99
            
          
        
      
      
        
          
            p
            
              1
              ,
              0
            
          
        
        
          
            p
            
              1
              ,
              1
            
          
        
        
          
            p
            
              1
              ,
              2
            
          
        
        
          
            p
            
              1
              ,
              3
            
          
        
        
          ...
        
        
          
            p
            
              1
              ,
              99
            
          
        
      
      
        
          
            p
            
              2
              ,
              0
            
          
        
        
          
            p
            
              2
              ,
              1
            
          
        
        
          
            p
            
              2
              ,
              2
            
          
        
        
          
            p
            
              2
              ,
              3
            
          
        
        
          ...
        
        
          
            p
            
              2
              ,
              99
            
          
        
      
      
        
          
            p
            
              3
              ,
              0
            
          
        
        
          
            p
            
              3
              ,
              1
            
          
        
        
          
            p
            
              3
              ,
              2
            
          
        
        
          
            p
            
              3
              ,
              3
            
          
        
        
          ...
        
        
          
            p
            
              3
              ,
              99
            
          
        
      
      
        
          ⋮
        
        
          ⋮
        
        
          ⋮
        
        
          ⋮
        
        
          ⋱
        
        
          ⋮
        
      
      
        
          
            p
            
              99
              ,
              0
            
          
        
        
          
            p
            
              99
              ,
              1
            
          
        
        
          
            p
            
              99
              ,
              2
            
          
        
        
          
            p
            
              99
              ,
              3
            
          
        
        
          ...
        
        
          
            p
            
              99
              ,
              99
            
          
        
      
    
    ]
  




    
    
        S5. conduct offset calculation according to the neighborhood matching calculation results, obtain the identical point in the images, including:
        
            S51. select the upper and lower neighborhoods corresponding to the benchmark signal series for cycle comparisons, establish the corresponding relationship of the first pair of tie points g1(x1, y1) and g2(x2, y2) by comparing the benchmark signal series and the neighboring series in the next image;
            S52. determine the s known corresponding points of the images according to the corresponding relationship of similarity on the row dimension of the one-dimensional digital signals obtained in S51, in combination with binary quadratic polynomial, using least squares method, obtain x1 and y1 by carrying out surface fitting of the data of the corresponding tie points:

x1=a00+a10x2+a01y2+a11x2y2+a20x22+a02y22 

y1=b00+b10x2+b01y2+b11x2y2+b20x22+b02y22;

        
        
        S6. conduct spatial geometrical correction on the images according to the x1 and y1 obtained in S5, and use double direction linear interpolation to carry out pixel gray value reassignments;
        S7. carry out traversal operations on subsequent images relative to the benchmark image G1, traverse step S3 to step S6;
        S8. superimpose the one-dimensional signal series having the same instant field of view in the corrected images in the coordinate system to become the first row of the digital image of the images with the flutter effects removed, repeat step S3 to step S8, arrange each row of the superimposed images obtained with reduced oscillation effects according to spatial and chronological order to form digital images with reduced oscillation effects.
    
    


Furthermore, said k of S41 is the neighborhood of i that meets the identicalness matching condition, said l is the neighborhood of j that meets the identicalness matching condition.
Furthermore, said 0≦i≦N−1, 0≦j≦N−1 in S41
Furthermore, said number of iterations r of S43 satisfies 1≦r≦N.
Furthermore, for said s known corresponding points of S52, m−4≦s≦m−1.
The effects of the current invention: conduct offset calculation in the process of removing blurs from the images, correct the blurs caused by oscillations, the calculation process is relatively simple and accurate, and relatively good blur-removal effects can be obtained.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is the established coordinate system of the planar image.
FIG. 2 is the sectional drawing of the corresponding relationships between the m images and the ground target in the ideal working mode the TCI-CCD camera.
FIG. 3 is the sectional drawing of the corresponding relationships between the m images and the ground target under oscillation conditions of the TCI-CCD camera.
FIG. 4 is the workflow chart for calculating the amount of offset between the similar row signals of the t+1th image and the tth image.
FIG. 5 is the schematic drawing of the workflow to restore oscillation images through the current method.



EMBODIMENTS
The embodiments of the current invention are presented below in combination with the figures:
For the convenience of description, we select a TDI-CCD camera with the number of column pixels being 1024 and the number of row pixels being 32.
S1. Establish a coordinate system of the image: the direction of the number of pixels on the TDI-CCD camera area array, i.e., the direction of columns, is the Y axis, while the direction of the grades of the pixels on the TDI-CCD camera area array, i.e. the direction of rows, is the X axis, the upper left corner of the image is the starting point of the coordinate system, wherein the coordinate for the first row and first column is (0,0).
S2. Set the series of the TDI-CCD camera as 1, each grade of integration outputs an area array image of 32 rows and 1024 columns, the area array images are sequentially numbered as G1, G2, G3 . . . Gt . . . G32. Set G1 as the benchmark reference image, wherein gt(xt, yt) is the pixel gray value of Gt at (xt, yt).
S3. Perform decomposition on the area array images: decompose each area array image read in S2 by rows, the area array image outputted by each series is decomposed into 32 rows, each row having 1024 pixels. After the decomposition, each row forms a one-dimensional digital signal, the length of the digital signal being 1024. Extract the first 100 pixels from each one-dimensional digital signal, respectively forming an one-dimensional digital signal series that is recorded as f(t), the length of the one-dimensional digital signal series being 100;
S4. Construct a similarity matching rules for two rows of one-dimensional digital signal series:
One-dimensional digital signal series f(2.0:99.1) as benchmark series, carry out comparison between one-dimensional digital signal series f(j) and the benchmark series f(i), wherein 0≦j≦99. The neighborhood identicalness matching condition of the signal series is ∥vij−vkl∥≦5, wherein, represents obtaining normal number, vij represents the disparity vector between any two pixels of the two rows of signal series, i represents the index of the pixels in the signal series f(i), j represents the index of the pixels in the signal series f(j), k is a neighborhood of i, l is a neighborhood of j. Calculate the initial matching probability




  
    
      p
      ij
      
        (
        0
        )
      
    
    =
    
      1
      
        1
        +
        
          w
          ij
        
      
    
  
  ,




wherein, wijΣ|λ|≦k[g1(i+λ)=g2(j+λ)]2, pij(0) is the initial matching probability, g1(i+λ) represents the gray value of the one-dimensional signal series f(i) at the (i+λ)th pixel, g2(j+λ) represents the gray value of the one-dimensional signal series f(j) at the (j+λ)th pixel. The current invention utilizes relaxation method, establish the iteration formula of qij: pij ̃(r)=Apij(r−1)+Bqij(r−1), wherein





  
    
      q
      ij
    
    =
    
      
        ∑
        k
      
      ⁢
      
        
          ∑
          l
        
        ⁢
        
          p
          kl
        
      
    
  
  ,




r is the number of iterations, A and B are constants. According to the iteration formula, obtain the post-normalization matching probability





  
    
      
        p
        ij
        
          (
          r
          )
        
      
      :
      
        p
        ij
        
          (
          r
          )
        
      
    
    =
    
      
        p
        ij
        
          ∼
          
            (
            r
            )
          
        
      
      
        
          ∑
          h
        
        ⁢
        
          p
          ij
          
            ∼
            
              (
              r
              )
            
          
        
      
    
  
  ,




wherein, h represents every point that matches i.

The maximum number of iterations of the TDI-CCD camera based on this embodiment is r=100. Through iterative operation, it can be known which diagonal series the result of the matrix converges to.




  
    
      p
      ij
      r
    
    =
    
      [
      
        
          
            
              p
              
                0
                ,
                0
              
            
          
          
            
              p
              
                0
                ,
                1
              
            
          
          
            
              p
              
                0
                ,
                2
              
            
          
          
            
              p
              
                0
                ,
                3
              
            
          
          
            ...
          
          
            
              p
              
                0
                ,
                99
              
            
          
        
        
          
            
              p
              
                1
                ,
                0
              
            
          
          
            
              p
              
                1
                ,
                1
              
            
          
          
            
              p
              
                1
                ,
                2
              
            
          
          
            
              p
              
                1
                ,
                3
              
            
          
          
            ...
          
          
            
              p
              
                1
                ,
                99
              
            
          
        
        
          
            
              p
              
                2
                ,
                0
              
            
          
          
            
              p
              
                2
                ,
                1
              
            
          
          
            
              p
              
                2
                ,
                2
              
            
          
          
            
              p
              
                2
                ,
                3
              
            
          
          
            ...
          
          
            
              p
              
                2
                ,
                99
              
            
          
        
        
          
            
              p
              
                3
                ,
                0
              
            
          
          
            
              p
              
                3
                ,
                1
              
            
          
          
            
              p
              
                3
                ,
                2
              
            
          
          
            
              p
              
                3
                ,
                3
              
            
          
          
            ...
          
          
            
              p
              
                3
                ,
                99
              
            
          
        
        
          
            ⋮
          
          
            ⋮
          
          
            ⋮
          
          
            ⋮
          
          
            ⋱
          
          
            ⋮
          
        
        
          
            
              p
              
                99
                ,
                0
              
            
          
          
            
              p
              
                99
                ,
                1
              
            
          
          
            
              p
              
                99
                ,
                2
              
            
          
          
            
              p
              
                99
                ,
                3
              
            
          
          
            ...
          
          
            
              p
              
                99
                ,
                99
              
            
          
        
      
      ]
    
  
  ,
  
    1
    ≤
    R
    ≤
    
      100
      ∘
    
  




When converging to the leading diagonal series, i.e., p0.0≈1, p1.1≈1, p2.2≈1, . . . , the iterating trend of the other elements approaches 0, and Δy=0 here.
When converging to a certain diagonal series in the upper triangle of the matrix, i.e., p0,j≈1, p1,j+1≈1, p2,j+2≈1, . . . , the iterating trend of the other elements approaches 0, and here Δy=0−j.
When converging to a certain diagonal series in the lower triangle of the matrix, i.e., p0,i≈1, p1,i+1≈1, p2,i+2≈1, . . . , the iterating trend of the other elements approaches 0, and here Δy=0−i.
Through iterative operation, Δy can be calculated, when the matrix does not converge after 100 times of iterations, the iterative operation is stopped, the two rows of signal series lack similarity.
S5. Carry out offset calculation, including:

    
    
        carry out similarity comparison between the digital signal series f(3,0:99,2) formed by the first 100 pixels of the third row of G2 with the benchmark signal series f(2,0:99,1), if |Δy|≦5 in this comparison, they are considered to correspond to the integration energy of the same instant field of view, then the identical point that point g2(2,0+Δy) in G2 corresponds to in G1 is g1(1,0);
        if the shift |Δy|>5, it illustrates that different instant fields of view are corresponded to, then similarity comparison is carried out between the digital signal series f(2,0:99,2) formed by the first 100 pixels of the second row of G2 and the benchmark signal series f(2,0:99,1), |Δy|≦5 in this comparison, it is considered that they correspond to the integration energy of the same instant field of view, then the tie point that point g2(1,0+Δy) in G2 corresponds to in G1 is g1(1,0);
        if the shift |Δy|>5, it illustrates that different instant fields of view are corresponded to, then similarity comparison is carried out between the digital signal series f(4,0:99,2) formed by the first 100 pixels of the fourth row of G2 and the benchmark signal series f(2,0:99,1), |Δy|≦15 in this comparison, it is considered that they correspond to the integration energy of the same instant field of view, then the tie point that point g2(3,0+Δy) in G2 corresponds to in G1 is g1(1,0);
        if the shift |Δy|>5, it illustrates that different instant fields of view are corresponded to, then similarity comparison is carried out between the digital signal series f(1,0:99,2) formed by the first 100 pixels of the first row of G2 and the benchmark signal series f(2,0:99,1), if |Δy|≦5 in this comparison, they are considered to correspond to the integration energy of the same instant field of view, then the tie point that point g2(0,0+Δy) in G2 corresponds to in G1 is g1(1,0);
        if the shift |Δy|>5, it illustrates that different instant fields of view are corresponded to, then similarity comparison is carried out between the digital signal series f(5,0:99,2) formed by the first 100 pixels of the fifth row of G2 and the benchmark signal series f(2,0:99,1), |Δy|≦15 in this comparison, it is considered that they correspond to the integration energy of the same instant field of view, then the tie point that point g2(4,0+Δy) in G2 corresponds to in G1 is g1(1,0);
        if the shift |Δy|>5, it illustrates that different instant fields of view are corresponded to.
    
    


Thus, carry out Comparing loop on the neighborhoods that the benchmark signal corresponds to, establish the corresponding relationships between the first corresponding tie points g1(x1, y1) and g2(x2, y2) by the comparison of the benchmark signal series and the neighboring series in the next image.
S6. The corresponding relationship in similarity on the row dimension that the one-dimensional digital series have ensures that each one-dimensional signal series afterwards in the two images are corresponding one-to-one in similarity, and thus the s(32−4≦s≦32−1) known corresponding points can finally be found, that is, these s corresponding tie points g1(x1, y1) and g2(x2, y2) are known. In combination with bivariate quadratic polynomial, using least squares method, x1 and y1 are obtained by carrying out surface fitting of the data of the corresponding tie points:

x1=a00+a10x2+a01y2+a11x2y2+a20x22+a02y22 

y1=b00+b10x2+b01y2+b11x2y2+b20x22+b02y22,

by the x1 and y1 obtained, on the second image, use this bivariate quadratic polynomial to carry out spatial geometrical correction and use double direction interpolation to carry out pixel gray value reassignments.

S7. According to the process described above, first use the reference image coordinate system that uses G2 as the benchmark to carry out geometrical corrections and pixel interpolations on G3, then in combination with the spatial relationship obtained of G2 and G1, carry out correction on G3 based on G1. Repeating this step, carry out corrections on G4, G5, G6 . . . G32.
S8. Cause the one-dimensional signal series having the same instant field of view in the area array images obtained by the corrections described above to superimpose in the coordinate system, only complete the addition of 30 rows of signal series having the same instant field of view, forming one row of digital image removed of oscillation effects, the effect being analogous to integration of 30 stage.



  
    E
    =
    
      
        ∫
        
          Δ
          ⁢
          
            
          
          ⁢
          S
        
        
          
        
      
      ⁢
      
        
          ρ
          ⁡
          
            (
            
              x
              ,
              y
            
            )
          
        
        ⁢
        
          
            E
            in
          
          ⁡
          
            (
            
              x
              ,
              y
            
            )
          
        
        ⁢
        
          
        
        ⁢
        
          d
          s
        
      
    
  




  
    
      
        g
        ⁡
        
          (
          
            x
            ,
            y
          
          )
        
      
      =
      
        
          k
          ·
          E
        
        =
        
          k
          ·
          
            
              ∫
              
                Δ
                ⁢
                
                  
                
                ⁢
                S
              
              
                
              
            
            ⁢
            
              
                ρ
                ⁡
                
                  (
                  
                    x
                    ,
                    y
                  
                  )
                
              
              ⁢
              
                
                  E
                  in
                
                ⁡
                
                  (
                  
                    x
                    ,
                    y
                  
                  )
                
              
              ⁢
              
                
              
              ⁢
              
                d
                s
              
            
          
        
      
    
    ,
  



wherein, ρ(x, y) represents the spectral reflective ratio of waveband feature ground objects, Ein(x, y) represents the radiation energy of the waveband through a unit area in a unit time, k is the gain coefficient. The pixel gray value of the final image with reduced effects of oscillation is {tilde over (g)}(x, y):





  
    
      g
      ~
    
    ⁡
    
      (
      
        x
        ,
        y
      
      )
    
  
  =
  
    
      ∑
      
        m
        =
        1
      
      30
    
    ⁢
    
      
        
          g
          m
        
        ⁡
        
          (
          
            x
            ,
            y
          
          )
        
      
      .
    
  




According to spatial and chronological orders, arrange each row of the digital images obtained after superposition and with reduced effects of oscillations, finally forming digital images with reduced effects of oscillations.

## Claims

1. A method for reducing blurs of TDI-CCD camera images, in which the target surface that supports the TDI-CCD camera is set to be n columns and m rows, wherein the method for reducing blurs includes the following steps:
S1. establish a coordinate system of the image: the direction of the number of pixels on the TDI-CCD camera area array, which is the direction of columns, is the Y axis, while the direction of the grades of the pixels on the TDI-CCD camera area, which is the direction of rows, is the X axis, the upper left corner of the image is the starting point of the coordinate system, wherein the coordinate for the first row and first column is (0,0);
S2. read the area array images of the TDI-CCD camera outputted from each integration and carry out numbering of the images: the images are sequentially numbered as G1, G2, G3 . . . Gt . . . Gm;
S3. carry out decomposition on the area array images: decompose each image read in S2 by rows, each area array image outputted from the integration grades is decomposed into m rows, each row having n pixels, each row forms a one-dimensional digital signal after decomposition, the signal length being n, the first N pixels are extracted from each one-dimensional digital signal, respectively forming one-dimensional digital signal series that is recorded as f(t), wherein 0≦t≦m, 0≦N≦n;
S4. according to the one-dimensional digital signal series of S3, construct similarity matching rules for two one-dimensional signal series, including:
S41. select signal series f(i) as the benchmark series, carry out comparison between the signal series f(j) and the benchmark signal series, the neighborhood identicalness matching condition for the signal series is: ∥vij−vkl∥≦5, wherein ∥*∥ represents obtaining normal number, vij represents the disparity vector between any two pixels of the two rows of signal series, i represents the index of the pixels in the signal series f(i), j represents the index of the pixels in the signal series f(j), k is a neighborhood of i, l is a neighborhood of j;
S42. calculate the initial matching probability according to said neighborhood identicalness matching condition of the signal series of S41:






  
    
      P
      ij
      
        (
        0
        )
      
    
    =
    
      1
      
        1
        +
        
          w
          ij
        
      
    
  
  ,



wherein wij=Σ|λ|≦k[g1(i+λ)−g2(j+λ)]2, pij(0) is the initial matching probability, g1(i+λ) represents the gray value of the one-dimensional signal series f(i) at the (i+λ)th pixel, g2(j+λ) represents the gray value of the one-dimensional signal series f(j) at the (j+λ)th pixel;
S43. according to relaxation method, establish the iteration formula of qij: pij ̃(r)=Apij(r−1)+Bqij(r−1), wherein






  
    
      q
      ij
    
    =
    
      
        ∑
        k
      
      ⁢
      
        
          ∑
          l
        
        ⁢
        
          p
          kl
        
      
    
  
  ,



r is the number of iterations, A and B are constants;
S44. according to the iteration formula of S43, obtain the post-normalization matching probability






  
    
      
        p
        ij
        
          (
          r
          )
        
      
      :
      
        p
        ij
        
          (
          r
          )
        
      
    
    =
    
      
        p
        ij
        
          ∼
          
            (
            r
            )
          
        
      
      
        
          ∑
          h
        
        ⁢
        
          p
          ij
          
            ∼
            
              (
              r
              )
            
          
        
      
    
  
  ,



wherein, h represents every point that matches i;
S45. the converging diagonal series of pij′ can be known according to the matching probability obtained in S44, wherein the matching probability pij≈1, and other elements approach 0, wherein,






  
    
      p
      ij
      r
    
    =
    
      [
      
        
          
            
              p
              
                0
                ,
                0
              
            
          
          
            
              p
              
                0
                ,
                1
              
            
          
          
            
              p
              
                0
                ,
                2
              
            
          
          
            
              p
              
                0
                ,
                3
              
            
          
          
            ...
          
          
            
              p
              
                0
                ,
                
                  N
                  -
                  1
                
              
            
          
        
        
          
            
              p
              
                1
                ,
                0
              
            
          
          
            
              p
              
                1
                ,
                1
              
            
          
          
            
              p
              
                1
                ,
                2
              
            
          
          
            
              p
              
                1
                ,
                3
              
            
          
          
            ...
          
          
            
              p
              
                1
                ,
                
                  N
                  -
                  1
                
              
            
          
        
        
          
            
              p
              
                2
                ,
                0
              
            
          
          
            
              p
              
                2
                ,
                1
              
            
          
          
            
              p
              
                2
                ,
                2
              
            
          
          
            
              p
              
                2
                ,
                3
              
            
          
          
            ...
          
          
            
              p
              
                2
                ,
                
                  N
                  -
                  1
                
              
            
          
        
        
          
            
              p
              
                3
                ,
                0
              
            
          
          
            
              p
              
                3
                ,
                1
              
            
          
          
            
              p
              
                3
                ,
                2
              
            
          
          
            
              p
              
                3
                ,
                3
              
            
          
          
            ...
          
          
            
              p
              
                3
                ,
                
                  N
                  -
                  1
                
              
            
          
        
        
          
            ⋮
          
          
            ⋮
          
          
            ⋮
          
          
            ⋮
          
          
            ⋱
          
          
            ⋮
          
        
        
          
            
              p
              
                
                  N
                  -
                  1
                
                ,
                0
              
            
          
          
            
              p
              
                
                  N
                  -
                  1
                
                ,
                1
              
            
          
          
            
              p
              
                
                  N
                  -
                  1
                
                ,
                2
              
            
          
          
            
              p
              
                
                  N
                  -
                  1
                
                ,
                3
              
            
          
          
            ...
          
          
            
              p
              
                
                  N
                  -
                  1
                
                ,
                
                  N
                  -
                  1
                
              
            
          
        
      
      ]
    
  
  ;



S5. Conduct offset calculation according to the neighborhood matching calculation results of S4, obtain the tie points in the images, including:
S51. select the upper and lower neighborhoods corresponding to the benchmark signal series for cycle comparison, establish the corresponding relationship for the first pair of tie points g1(x1,y1) and g2(x2,y2) by comparing the benchmark signal series and the neighboring series in the next image;
S52. determine s known corresponding points of the images according to the corresponding relationship of similarity on the row dimension of the one-dimensional digital signal obtained in S51, in combination with bivariate quadratic polynomial, using least square method, obtain x1 and y1 by carrying out surface fitting of the data for the corresponding tie points:


x1=a00+a10x2+a01y2+a11x2y2+a20x22+a02y22 



y1=b00+b10x2+b01y2+b11x2y2+b20x22+b02y22;



S6. conduct spatial geometric correction on the images according to x1 and y1 obtained in S5, and use double direction linear interpolation to carry out pixel gray value reassignments;
S7. repeat step S3 to step S6 on subsequent images relative to the benchmark image G1;
S8. superimpose the one-dimensional signal series having the same instant field of view in the corrected images in the coordinate system to become the first row of digital image of the images with the oscillation effects removed, repeat step S3 to step S8, arrange each row of the superimposed image obtained with the reduced oscillation effects according to spatial and chronological order to form digital images with the oscillation effects reduced.

2. The method for reducing blurs of TDI-CCD camera images of claim 1, characterized in that: said k of S41 is the neighborhood of i that meets the identicalness matching condition, said l is the neighborhood of j that meets the identicalness matching condition.

3. The method for reducing blurs of TDI-CCD camera images of claim 1, characterized in that: 0≦i≦N−1, 0≦j≦N−1 in S41.

4. The method for reducing blurs of TDI-CCD camera images of claim 1, characterized in that: said number of iterations r of S43 satisfies 1≦r≦N.

5. The method for reducing blurs of TDI-CCD camera images of claim 1, characterized in that: for said s known corresponding points of S52, m−4≦s≦m−1.