Abstract
A new fast algorithm for the computation of the normalized cross-correlation (NCC) is presented. For a search window of size M and a template of size N, our fast NCC requires only approximately 3N⋅(M−N+1) additions/subtractions without multiplications. Numerical results with 100,000 test signals show that the use of the fast NCC instead of the traditional approaches for the determination of the degree of similarity between a test signal and a reference signal (template) brings about a significant improvement in terms of false negative rate, identification rate and computational cost without a significant increase in false positive rate, especially when signal to noise ratio (SNR) is higher than 4 dB.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
