Algorithms for subpixel registration
Computer Vision, Graphics, and Image Processing
A geometric approach to subpixel registration accuracy
Computer Vision, Graphics, and Image Processing
Discrete-time signal processing
Discrete-time signal processing
Hi-index | 0.00 |
A new image registration algorithm is presented which achieves subpixel accuracy using a frequency domain technique. The proposed approach is efficient compared to the conventional approaches based on interpolation or correlations in spatial/frequency domain [1]. Furthermore, the proposed approach can achieve subpixel accuracy registration even when images contain aliasing errors due to undersampling. The FFT's of the images are used which have computational complexities smaller than the interpolation or convolution computations by orders of magnitude. The accuracy of the proposed approach is demonstrated through computer simulations for different types of images.