basedalgorithmtocalculateimagedisplacementswithIDLpro创新.ppt

Understanding FFT- based algorithm to calculate image displacements with IDL programming language By Cynthia Rodriguez University of Texas at San Antonio Automatic image registration Automatic image registration - is the process that aligns one image to a second image of the same scene One image is known as the reference data, and the other image, is known as the input data (or sensed data), which is matched relative to the reference data. This is done so that the properties of an object being imaged can be addressable by the same coordinate pair from either one of the images. FFT- based algorithm Several different algorithms to solve automatic image registration FFT stands for Fast Fourier Transform Formula proven as a successful factor in solving automatic image registration The Basic Idea FFT based automatic registration relies on the Fourier shift theorem, which guarantees that the phase of a specifically defined “ratio” is equal to the phase difference between the images. Ex: Ratio = (x0,y0), [I2(x,y) = I1(x-x0, y-y0)] To find displacement between two images Compute the Ratio Ratio = F1 conj(F2 ) / | F1F2 | And Apply Inverse Fourier transform The Basic Idea By applying the Inverse Fourier transform to the Ratio, we get an array of numbers returned that is zero everywhere except for a small area around a single point. By using the Max function we can find the maximum value The location of the Max value is exactly the displacement (x0,y0) that is needed to optimally register the images. Pseudocode for shift_ Declare and Initiate variables ‘n’ representing columns ‘m’ representing lines or rows Create a byte array Open and read image 1 file into im1 variable Call function FFT for im1 Repeat above steps for im2 Calculate ratio F1 conj(F2 ) / | F1F2 | Call function inverse FFT on ratio Cont. Pseudocode for shift_ The Result from FFT Function Inverse FFT returns an array, with approximate zeros everywhere except at the displacement that is used to register th