2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) 2016
DOI: 10.1109/cvpr.2016.639
|View full text |Cite
|
Sign up to set email alerts
|

Globally Optimal Rigid Intensity Based Registration: A Fast Fourier Domain Approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2019
2019
2020
2020

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 14 publications
0
3
0
Order By: Relevance
“…Scale invariant feature transform (SIFT) and speed-up robust feature (SURF) are effective image feature point matching algorithms; however, they are computationally complex, and their real-time performance is poor. Rublee et al showed that oriented fast and rotated brief (ORB) has strong robustness as well as a high data-processing speed (one order of magnitude faster than that of the SURF algorithm and two orders of magnitude faster than that of the SIFT algorithm) [40,41], which can partially compensate for the poor robustness of the intensity-based registration method [42,43]. This study adopts a sub-voxel-level high-precision image registration algorithm based on a combination of ORB feature extraction and an intensity-based registration method [44,45].…”
Section: Sub-voxel-level Joint Registration Between Image Bandsmentioning
confidence: 99%
See 1 more Smart Citation
“…Scale invariant feature transform (SIFT) and speed-up robust feature (SURF) are effective image feature point matching algorithms; however, they are computationally complex, and their real-time performance is poor. Rublee et al showed that oriented fast and rotated brief (ORB) has strong robustness as well as a high data-processing speed (one order of magnitude faster than that of the SURF algorithm and two orders of magnitude faster than that of the SIFT algorithm) [40,41], which can partially compensate for the poor robustness of the intensity-based registration method [42,43]. This study adopts a sub-voxel-level high-precision image registration algorithm based on a combination of ORB feature extraction and an intensity-based registration method [44,45].…”
Section: Sub-voxel-level Joint Registration Between Image Bandsmentioning
confidence: 99%
“…The registration process of the algorithm is shown in Figure 1. of the SURF algorithm and two orders of magnitude faster than that of the SIFT algorithm) [40,41], which can partially compensate for the poor robustness of the intensity-based registration method [42,43]. This study adopts a sub-voxel-level high-precision image registration algorithm based on a combination of ORB feature extraction and an intensity-based registration method [44,45].…”
Section: Sub-voxel-level Joint Registration Between Image Bandsmentioning
confidence: 99%
“…The transform domain-based registration algorithm transforms images from the spatial domain to the frequency domain and then analyzes the image in the frequency domain to determine the registration parameters. The commonly used frequency domain transform-based image registration algorithms mainly include wavelet transform registration technology [20,21], Fourier transform registration technology [22][23][24] and composite registration algorithm combined with the space and frequency domain [25,26]. This type of image registration method has a strong anti-noise ability, but the calculation amount is relatively large.…”
Section: Introductionmentioning
confidence: 99%