Efficient subpixel image registration by cross-correlation
Registers two images (2-D rigid translation) within a fraction of a pixel specified by the user.
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
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).
Please refer to the attached HTML for more details and a sample implementation.
Cite As
Manuel Guizar (2026). Efficient subpixel image registration by cross-correlation (https://nl.mathworks.com/matlabcentral/fileexchange/18401-efficient-subpixel-image-registration-by-cross-correlation), MATLAB Central File Exchange. Retrieved .
Acknowledgements
Inspired: BacStalk, STXM ParticleAnalysis2 GUI, BiofilmQ, Automatic 2d Rigid Body Image Registration, STXM data analysis script collection - STACKLab, STXM Spectromicroscopy Particle Analysis Routines
Categories
Find more on Geometric Transformation and Image Registration in Help Center and MATLAB Answers
General Information
- Version 1.1.0.0 (182 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
