2017
DOI: 10.1007/s11760-017-1089-4
|View full text |Cite
|
Sign up to set email alerts
|

An image registration algorithm based on phase correlation and the classical Lucas–Kanade technique

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
16
0

Year Published

2018
2018
2025
2025

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 19 publications
(17 citation statements)
references
References 16 publications
0
16
0
Order By: Relevance
“…To improve the line scan camera to higher accuracy, a subpixel image registration method needs to be introduced. In recent years, the most widely used technique for subpixel image registration is based on the peak location search in the cross-correlation of the two aligned images [14]. These cross-correlation-based techniques have significant registration accuracy and robustness to background lighting variations and image noise [15,16], where they can be categorized into two classes, namely spatial domain and Fourier domain methods.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…To improve the line scan camera to higher accuracy, a subpixel image registration method needs to be introduced. In recent years, the most widely used technique for subpixel image registration is based on the peak location search in the cross-correlation of the two aligned images [14]. These cross-correlation-based techniques have significant registration accuracy and robustness to background lighting variations and image noise [15,16], where they can be categorized into two classes, namely spatial domain and Fourier domain methods.…”
Section: Introductionmentioning
confidence: 99%
“…A conventional approach to calculate the image translation within a fraction, 1/ p , of a pixel is to embed the cross power spectrum in a zero-padded matrix in Fourier domain and to compute an inverse Fast Fourier Transform (FFT) to obtain the p -times of the up-sampled phase correlation and locate its peak [27]. This approach provides high registration accuracy and robust results, but the computational time and memory consumption are enormous [14]. To solve the problem of low computational efficiency in the conventional FFT approach, there are approaches based on interpolation algorithms, for example, iterative intensity interpolation [16] and correlation interpolation [28].…”
Section: Introductionmentioning
confidence: 99%
“…The Lucas-Kanade optical flow method uses spatial brightness gradient information to obtain better matching position. It has three assumptions [ 22 , 23 ]: firstly, the brightness between two adjacent frames is constant; secondly, in order to solve the aperture problem, there is the same motion in the same integration window; thirdly, the motion of the object between adjacent frames is relatively small. In order to make all kinds of video images generally conform to the hypothesis thirdly, Bouguet proposed pyramid Lucas Kanade optical flow algorithm.…”
Section: Binocular Stereo Panoramic Image Synthesis Algorithmmentioning
confidence: 99%
“…It refers to the technique that merges an obtained sequence of two or more UAV images into one wide-field image by finding an appropriative image transformation model [6]. Various methods are proposed to find the model, such as region-based methods, represented by phase correlation [7], however, feature-point-based methods are more widely used [8].…”
Section: Related Workmentioning
confidence: 99%