The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Parametric Image Alignment Using Enhanced Correlation Coefficient Maximization
Abstract
In this work we propose the use of a modified version of the correlation coefficient as a performance criterion for the image alignment problem. The proposed modification has the desirable characteristic of being invariant with respect to photometric distortions. Since the resulting similarity measure is a nonlinear function of the warp parameters, we develop two iterative schemes for its maximization, one based on the forward additive approach and the second on the inverse compositional method. As it is customary in iterative optimization, in each iteration, the nonlinear objective function is approximated by an alternative expression for which the corresponding optimization is simple. In our case we propose an efficient approximation that leads to a closed-form solution (per iteration) which is of low computational complexity, the latter property being particularly strong in our inverse version. The proposed schemes are tested against the Forward Additive Lucas-Kanade and the Simultaneous Inverse Compositional (SIC) algorithm through simulations. Under noisy conditions and photometric distortions, our forward version achieves more accurate alignments and exhibits faster convergence whereas our inverse version has similar performance as the SIC algorithm but at a lower computational complexity.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1981) · Cited by 11,963
Horn, B. K. P., & Schunck, B. G. (1981) · Artificial Intelligence · doi:10.1016/0004-3702(81)90024-2 · Cited by 10,312
Shi, J., & Tomasi (1994) · Proceedings of IEEE Conference on Computer Vision and Pattern Recognition CVPR-94 · doi:10.1109/cvpr.1994.323794 · Cited by 7,724
Horn, B. K., & Schunck, B. G. (1981) · SPIE Proceedings · doi:10.1117/12.965761 · Cited by 7,394
(1986) · Cited by 3,616
Lucas-Kanade 20 Years On: A Unifying Framework
Baker, S., & Matthews, I. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000011205.11775.fd · Cited by 3,155
Barnett, V., Lewis, T., & Abeles, F. (1979) · Physics Today · doi:10.1063/1.2995737 · Cited by 2,824
A computational framework and an algorithm for the measurement of visual motion
Anandan, P. (1989) · International Journal of Computer Vision · doi:10.1007/bf00158167 · Cited by 1,073
Efficient region tracking with parametric models of geometry and illumination
Hager, G. D., & Belhumeur, P. N. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.722606 · Cited by 1,066
Handbook of Mathematical Models in Computer Vision
(2006) · doi:10.1007/0-387-28831-7 · Cited by 574
Buckland, W. R. (1979) · Journal of the Operational Research Society · doi:10.1057/jors.1979.165 · Cited by 562
Black, M. J., & Yacoob, Y. (2002) · Proceedings of IEEE International Conference on Computer Vision · doi:10.1109/iccv.1995.466915 · Cited by 457
A framework for the robust estimation of optical flow
Black, M. J., & Anandan, P. (2002) · 1993 (4th) International Conference on Computer Vision · doi:10.1109/iccv.1993.378214 · Cited by 454
Shum, H.-Y., & Szeliski, R. (2000) · International Journal of Computer Vision · doi:10.1023/a:1008195814169 · Cited by 412
Direct methods for recovering motion
Horn, B. K. P., & Weldon, E. J. (1988) · International Journal of Computer Vision · doi:10.1007/bf00836281 · Cited by 387
Construction of Panoramic Image Mosaics with Global and Local Alignment
Shum, H.-Y., & Szeliski, R. (2001) · Monographs in Computer Science · doi:10.1007/978-1-4757-3482-9_13 · Cited by 356
A low-dimensional representation of human faces for arbitrary lighting conditions
Hallinan (1994) · Proceedings of IEEE Conference on Computer Vision and Pattern Recognition CVPR-94 · doi:10.1109/cvpr.1994.323941 · Cited by 293
Elastic registration in the presence of intensity variations
Periaswamy, S., & Farid, H. (2003) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2003.815069 · Cited by 237
A generalized brightness change model for computing optical flow
Negahdaripour, S., & Yu, C.-H. (2002) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.1993.378241 · Cited by 104
A fast parametric motion estimation algorithm with illumination and lens distortion correction
Altunbasak, Y., Mersereau, R. M., & Patti, A. J. (2003) · IEEE Transactions on Image Processing · doi:10.1109/tip.2003.809012 · Cited by 95
Projective registration with difference decomposition
Gleicher, M. L. (2002) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.1997.609345 · Cited by 79
Motion displacement estimation using an affine model for image matching
Fuh, C., & Maragos, P. A. (1991) · Optical Engineering · doi:10.1117/12.55885 · Cited by 61
Cited by
Adversarial Examples: Attacks and Defenses for Deep Learning
Yuan, X., He, P., Zhu, Q., & Li, X. (2019) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2018.2886017 · Cited by 1,733
Zhou, X., Koltun, V., & Krähenbühl, P. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-58548-8_28 · Cited by 1,428
StrongSORT: Make DeepSORT Great Again
Du, Y., Zhao, Z., Song, Y., Zhao, Y., Su, F., Gong, T., & Meng, H. (2023) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2023.3240881 · Cited by 1,191
“For Strong-SORT, the matching distance threshold is 0.45, the warp mode for ECC is MOTION EUCLIDEAN , the momentum term α in EMA is 0.9 and the weight factor for appearance cost λ is 0.98.”
MethodInfluentialTracking Without Bells and Whistles
Bergmann, P., Meinhardt, T., & Leal-Taixe, L. (2019) · 2019 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00103 · Cited by 1,110
Real-world single image super-resolution: A brief review
Chen, H., He, X., Qing, L., Wu, Y., Ren, C., Sheriff, R. E., & Zhu, C. (2022) · Information Fusion · doi:10.1016/j.inffus.2021.09.005 · Cited by 405
Metadata
- Authors
- Evangelidis, G. D., & Psarakis, E. Z.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2008-10
- Volume
- 30
- Issue
- 10
- Pages
- 1858-1865
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2101544546
- Cited by
- 731
- References
- 22
- FWCI
- 4.30
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.