.png){kind=icon}
Return
Efficient subpixel image registration algorithms
.png){kind=icon}
PRE
AI
DOI：10.1364/OL.33.000156.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Three new algorithms for 2D translation image registration to within a small fraction of a pixel that use nonlinear optimization and matrix-multiply discrete Fourier transforms are compared. These algorithms can achieve registration with an accuracy equivalent to that of the conventional fast Fourier transform up-sampling approach in a small fraction of the computation time and with greatly reduced memory requirements. Their accuracy and computation time are compared for the purpose of evaluating a translation-invariant error metric. (c) 2008 Optical Society of America.
Journal
IF:
3.3
Papers:
4.0W
Citations:
7.6W
Organization
Cited Papers
No cited papers available