Computation of the normalized cross-correlation by fast Fourier transform
PublisherPublic Library of Science
MetadataShow full item record
AbstractThe normalized cross-correlation (NCC), usually its 2D version, is routinely encountered in template matching algorithms, such as in facial recognition, motion-tracking, registration in medical imaging, etc. Its rapid computation becomes critical in time sensitive applications. Here I develop a scheme for the computation of NCC by fast Fourier transform that can favorably compare for speed efficiency with other existing techniques and may outperform some of them given an appropriate search scenario. © 2018 Artan Kaso. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Keywordfast Fourier transform
Magnetic Resonance Imaging
Identifier to cite or link to this itemhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85053618880&doi=10.1371%2fjournal.pone.0203434&partnerID=40&md5=7e4585ad789b0a5d6ca280340f73669b; http://hdl.handle.net/10713/8749
- Masked object registration in the Fourier domain.
- Authors: Padfield D
- Issue date: 2012 May
- Matching by tone mapping: photometric invariant template matching.
- Authors: Hel-Or Y, Hel-Or H, David E
- Issue date: 2014 Feb
- Fast normalized cross correlation for motion tracking using basis functions.
- Authors: Hii AJ, Hann CE, Chase JG, Van Houten EE
- Issue date: 2006 May
- Fast template matching based on normalized cross correlation with adaptive multilevel winner update.
- Authors: Wei SD, Lai SH
- Issue date: 2008 Nov
- Gridding-based direct Fourier inversion of the three-dimensional ray transform.
- Authors: Penczek PA, Renka R, Schomberg H
- Issue date: 2004 Apr