Abstract

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 upsampling 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.

© 2008 Optical Society of America

Efficient subpixel registration for polarization-modulated 3D imaging

Zhen Chen, Bo Liu, Shengjie Wang, and Enhai Liu
Opt. Express 26(18) 23040-23050 (2018)

Subpixel image registration with reduced bias

Wei Tong
Opt. Lett. 36(5) 763-765 (2011)

Efficient algorithm for computation of the second-order moment of the subpixel-edge position

Frédéric Bouchara
Appl. Opt. 43(23) 4550-4558 (2004)

Adaptive cross-correlation algorithm for extended scene Shack-Hartmann wavefront sensing

Erkin Sidick, Joseph J. Green, Rhonda M. Morgan, Catherine M. Ohara, and David C. Redding
Opt. Lett. 33(3) 213-215 (2008)

Power cepstrum and spectrum techniques applied to image registration

Dah-Jye Lee, Thomas F. Krile, and Sunanda Mitra
Appl. Opt. 27(6) 1099-1106 (1988)