相关法.docxVIP

Efficient subpixel image registration by cross-correlation.Registers two images (2-D rigid translation) within a fraction of a pixel specified by the user. Instead of computing a zero-padded FFT (fast Fourier transform), this code uses selective upsampling by a matrix-multiply DFT (discrete FT) to dramatically reduce computation time and memory without sacrificing accuracy. With this procedure all the image points are used to compute the upsampled cross-correlation in a very small neighborhood around its peak. This algorithm is referred to as the single-step DFT algorithm in [1].[1] Manuel Guizar-Sicairos, Samuel T. Thurman, and James R. Fienup, Efficient subpixel image registration algorithms, Opt. Lett. 33, 156-158 (2008).Contentsfile:///F:\My%20profiles\Matlab%20profile\source_code\7MATLAB_huxiangguan_tuxiangpipie\html\efficient_subpixel_registration.htmlSyntaxfile:///F:\My%20profiles\Matlab%20profile\source_code\7MATLAB_huxiangguan_tuxiangpipie\html\efficient_subpixel_registration.htmlObtain a reference and shifted imagesfile:///F:\My%20profiles\Matlab%20profile\source_code\7MATLAB_huxiangguan_tuxiangpipie\html\efficient_subpixel_registration.htmlSample Image Registrationfile:///F:\My%20profiles\Matlab%20profile\source_code\7MATLAB_huxiangguan_tuxiangpipie\html\efficient_subpixel_registration.htmlDisclaimerSyntaxThe code receives the FFT of the reference and the shifted images, and an (integer) upsampling factor. The code expects FFTs with DC in (1,1) so do not use fftshift. output = dftregistration(fft2(f),fft2(g),usfac);The images are registered to within 1/usfac of a pixel.output(1) is the normalized root-mean-squared error (NRMSE) [1] between f and g.output(2) is the global phase difference between the two images (should be zero if images are real-valued and non-negative).output(3) and output(4) are the row and column shifts between f and g respectively. [output Greg] = dftregistration(fft2(f),fft2(g),usfac);Greg is an optional output, it returns the Fourier