Computation of the normalized cross-correlation by fast Fourier transform

The 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 sche...

Descripción completa

Detalles Bibliográficos
Autor principal: Kaso, Artan
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Public Library of Science 2018
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6147431/
https://www.ncbi.nlm.nih.gov/pubmed/30235231
http://dx.doi.org/10.1371/journal.pone.0203434
_version_ 1783356548014145536
author Kaso, Artan
author_facet Kaso, Artan
author_sort Kaso, Artan
collection PubMed
description The 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.
format Online
Article
Text
id pubmed-6147431
institution National Center for Biotechnology Information
language English
publishDate 2018
publisher Public Library of Science
record_format MEDLINE/PubMed
spelling pubmed-61474312018-10-08 Computation of the normalized cross-correlation by fast Fourier transform Kaso, Artan PLoS One Research Article The 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. Public Library of Science 2018-09-20 /pmc/articles/PMC6147431/ /pubmed/30235231 http://dx.doi.org/10.1371/journal.pone.0203434 Text en © 2018 Artan Kaso http://creativecommons.org/licenses/by/4.0/ This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/) , which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
spellingShingle Research Article
Kaso, Artan
Computation of the normalized cross-correlation by fast Fourier transform
title Computation of the normalized cross-correlation by fast Fourier transform
title_full Computation of the normalized cross-correlation by fast Fourier transform
title_fullStr Computation of the normalized cross-correlation by fast Fourier transform
title_full_unstemmed Computation of the normalized cross-correlation by fast Fourier transform
title_short Computation of the normalized cross-correlation by fast Fourier transform
title_sort computation of the normalized cross-correlation by fast fourier transform
topic Research Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6147431/
https://www.ncbi.nlm.nih.gov/pubmed/30235231
http://dx.doi.org/10.1371/journal.pone.0203434
work_keys_str_mv AT kasoartan computationofthenormalizedcrosscorrelationbyfastfouriertransform

Ejemplares similares