The DOI matches its Crossref record.
Template matching using fast normalized cross correlation:
Abstract
In this paper, we present an algorithm for fast calculation of the normalized cross correlation and its application to the problem of template matching. Given a template t, whose position is to be determined in an image f, the basic idea of the algorithm is to represent the template, for which the normalized cross correlation is calculated, as a sum of rectangular basis functions. Then the correlation is calculated for each basis function instead of the whole template. The result of the correlation of the template t and the image f is obtained as the weighted sum of the correlation functions of the basis functions. Depending on the approximation, the algorithm can by far outperform Fourier-transform based implementations of the normalized cross correlation algorithm and it is especially suited to problems, where many different templates are to be found in the same image f.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cited by
Visual Tracking: An Experimental Survey
(2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.230 · Cited by 1,513
Siamese Instance Search for Tracking
Tao, R., Gavves, E., & Smeulders, A. W. M. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.158 · Cited by 1,208
A Novel Performance Evaluation Methodology for Single-Target Trackers
Kristan, M., Matas, J., Leonardis, A., Vojir, T., Pflugfelder, R., Fernandez, G., Nebehay, G., Porikli, F., & Cehovin, L. (2016) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2016.2516982 · Cited by 613
The Visual Object Tracking VOT2014 Challenge Results
Kristan, M., Pflugfelder, R., Leonardis, A., Matas, J., Čehovin, L., Nebehay, G., Vojíř, T., Fernández, G., Lukežič, A., Dimitriev, A., et al. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-16181-5_14 · Cited by 588
The Visual Object Tracking VOT2017 Challenge Results
Kristan, M., Leonardis, A., Matas, J., Felsberg, M., Pflugfelder, R., Zajc, L. C., Vojir, T., Hager, G., Lukezic, A., Eldesokey, A., et al. (2017) · 2017 IEEE International Conference on Computer Vision Workshops (ICCVW) · doi:10.1109/iccvw.2017.230 · Cited by 434
Xu, T., Feng, Z.-H., Wu, X.-J., & Kittler, J. (2019) · IEEE Transactions on Image Processing · doi:10.1109/tip.2019.2919201 · Cited by 412
A fast normalized cross-correlation calculation method for motion estimation
Luo, J., & Konofagou, E. E. (2010) · IEEE Transactions on Ultrasonics, Ferroelectrics and Frequency Control · doi:10.1109/tuffc.2010.1554 · Cited by 384
Opromolla, R., Fasano, G., Rufino, G., & Grassi, M. (2017) · Progress in Aerospace Sciences · doi:10.1016/j.paerosci.2017.07.001 · Cited by 330
Fast normalized cross correlation for defect detection
Tsai, D.-M., & Lin, C.-T. (2003) · Pattern Recognition Letters · doi:10.1016/s0167-8655(03)00106-5 · Cited by 279
Paired cycle‐GAN‐based image correction for quantitative cone‐beam computed tomography
Harms, J., Lei, Y., Wang, T., Zhang, R., Zhou, J., Tang, X., Curran, W. J., Liu, T., & Yang, X. (2019) · Medical Physics · doi:10.1002/mp.13656 · Cited by 257
Deep learning for asteroids autonomous terrain relative navigation
Mancini, P., Cannici, M., & Matteucci, M. (2023) · Advances in Space Research · doi:10.1016/j.asr.2022.04.020 · Cited by 10
Compact Time-Domain Representation for Logical Access Spoofed Audio
Karo, M., Yeredor, A., & Lapidot, I. (2024) · IEEE/ACM Transactions on Audio, Speech, and Language Processing · doi:10.1109/taslp.2023.3341000 · Cited by 6
Metadata
- Authors
- Briechle, K., & Hanebeck, U. D.
- Venue
- SPIE Proceedings
- Publisher
- SPIE
- Published
- 2001-03-20
- Volume
- 4387
- Pages
- 95-102
- ISSN
- 0277-786X (ISSN-L)
- OpenAlex
- W2171447090
- Cited by
- 539
- References
- 0
- FWCI
- 1.91
- Type
- conference paper
- 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.