2015
DOI: 10.1109/lsp.2015.2437881
|View full text |Cite
|
Sign up to set email alerts
|

High-Speed Image Registration Algorithm with Subpixel Accuracy

Abstract: A new, fast and computationally efficient lateral subpixel shift registration algorithm is presented. It is limited to register images that differ by small subpixel shifts otherwise its performance degrades. This algorithm significantly improves the performance of the single-step discrete Fourier transform approach proposed by Guizar-Sicairos et al. and can be applied efficiently on large dimension images. It reduces the dimension of Fourier transform of the cross correlation matrix and reduces the discrete Fo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 26 publications
(12 citation statements)
references
References 10 publications
0
12
0
Order By: Relevance
“…The displacement between the measurements p Θ and the reprojectionsp Θ is commonly estimated by cross-correlation methods, which can be implemented with deep subpixel accuracy [44,48,49]. However, we have observed that the cross-correlation-based methods may become unstable if the data contains systematic errors.…”
Section: Projection-matching Alignment (Pma) Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…The displacement between the measurements p Θ and the reprojectionsp Θ is commonly estimated by cross-correlation methods, which can be implemented with deep subpixel accuracy [44,48,49]. However, we have observed that the cross-correlation-based methods may become unstable if the data contains systematic errors.…”
Section: Projection-matching Alignment (Pma) Methodsmentioning
confidence: 99%
“…However, we have observed that the cross-correlation-based methods may become unstable if the data contains systematic errors. Additionally, the computational complexity of these methods grows significantly with the aimed level of subpixel accuracy [49]. Therefore, we have adopted an optimization approach inspired by the optical flow methods [50], which we found to be more robust and can iteratively reach deep subpixel accuracy.…”
Section: Projection-matching Alignment (Pma) Methodsmentioning
confidence: 99%
“…Firstly, an image block with the size is N × N is selected in an overlapped area from the Frame 1, where the selected block area, denoted by f (x, y), is called a registration reference template. Then, block registration algorithms 3840 are able to apply to the reference template ( f (x, y)) and Frame 2 to determine the matched block in Frame 2. Here, the matched block in Frame 2 is denoted by f ′(x, y).…”
Section: Proposed Methodsmentioning
confidence: 99%
“…For the frequency-based image correlation methods, we can alternatively upsample the computed cross-power spectrum to a higher resolution in the frequency domain, since the correlation of two upsampled images is equivalent to upsampling the correlation of two original images [48]. There are two manners to achieve frequency-based upsampled cross-correlation: zero-padding and matrix-multiply discrete FT [49,50]. The former is realized by extending the cross-power spectrum and inserting zero frequencies in the middle, which is equivalent to interpolating the corresponding time signal, and the latter is realized by means of discrete FT implementation in the form of matrix multiplication.…”
Section: Local Upsampling In the Frequency Domainmentioning
confidence: 99%