2018
DOI: 10.3390/rs10111719
|View full text |Cite
|
Sign up to set email alerts
|

An Extension of Phase Correlation-Based Image Registration to Estimate Similarity Transform Using Multiple Polar Fourier Transform

Abstract: Image registration is a core technology of many different image processing areas and is widely used in the remote sensing community. The accuracy of image registration largely determines the effect of subsequent applications. In recent years, phase correlation-based image registration has drawn much attention because of its high accuracy and efficiency as well as its robustness to gray difference and even slight changes in content. Many researchers have reported that the phase correlation method can acquire a … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
10
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
8
2

Relationship

2
8

Authors

Journals

citations
Cited by 20 publications
(10 citation statements)
references
References 48 publications
0
10
0
Order By: Relevance
“…For angle and scale estimation, a log-polar Fourier transform is first necessary to operate on the reference and sensed image, respectively. Then, the scale and angle can be converted to the displacements between the amplitude spectrum of log-polar Fourier transform of reference and sensed images [36].…”
Section: Methodsmentioning
confidence: 99%
“…For angle and scale estimation, a log-polar Fourier transform is first necessary to operate on the reference and sensed image, respectively. Then, the scale and angle can be converted to the displacements between the amplitude spectrum of log-polar Fourier transform of reference and sensed images [36].…”
Section: Methodsmentioning
confidence: 99%
“…These merits make it quite feasible for multisensor image registration. When used in coarse registration, PC can be extended to deal with rotation and scale estimation without the need for initialization and iteration using the Fourier-Mellin transform [21][22][23]. For fine registration, PC can be adopted in local template matching even pointwise dense matching with subpixel estimation.…”
Section: Introductionmentioning
confidence: 99%
“…Many local features are developed from the SIFT, such as the Affine-SIFT [6], the UC (Uniform Competency-based) features [7], and the PSO-SIFT [8]. Some studies establish feature descriptors by structure attributes instead of intensities, examples include the HOPC [9], the RIFT [10], the MSPC [11], and the MPFT [12]. Some works attempt to increase the percentage of correct correspondences through the Markov random field [13] and the Gaussian field [14] The combination of the feature-based and the area-based methods has been studied [15,16].…”
Section: Introductionmentioning
confidence: 99%