.png){kind=icon}
.png){kind=icon}
Return
High-Speed Image Registration Algorithm with Subpixel Accuracy
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2015.2437881.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A new, fast and computationally efficient lateral subpixel shift registration algorithm is presented. It is limited to register images that differ by small subpixel shifts otherwise its performance degrades. This algorithm significantly improves the performance of the single-step discrete Fourier transform approach proposed by Guizar-Sicairos et al. and can be applied efficiently on large dimension images. It reduces the dimension of Fourier transform of the cross correlation matrix and reduces the discrete Fourier transform (DFT) matrix multiplications to speed up the registration process. Simulations show that our algorithm reduces computation time and memory requirements without sacricing the accuracy associated with the usual FFT approach accuracy.
Keywords:
Fast Fourier transform
phase correlation
subpixel registration
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W
Organization
View more organizations