Share Email Print
cover

Proceedings Paper

Fast Legendre moment computation for template matching
Author(s): Bing C. Li
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Normalized cross correlation (NCC) based template matching is insensitive to intensity changes and it has many applications in image processing, object detection, video tracking and pattern recognition. However, normalized cross correlation implementation is computationally expensive since it involves both correlation computation and normalization implementation. In this paper, we propose Legendre moment approach for fast normalized cross correlation implementation and show that the computational cost of this proposed approach is independent of template mask sizes which is significantly faster than traditional mask size dependent approaches, especially for large mask templates. Legendre polynomials have been widely used in solving Laplace equation in electrodynamics in spherical coordinate systems, and solving Schrodinger equation in quantum mechanics. In this paper, we extend Legendre polynomials from physics to computer vision and pattern recognition fields, and demonstrate that Legendre polynomials can help to reduce the computational cost of NCC based template matching significantly.

Paper Details

Date Published: 1 May 2017
PDF: 9 pages
Proc. SPIE 10202, Automatic Target Recognition XXVII, 102020J (1 May 2017); doi: 10.1117/12.2262783
Show Author Affiliations
Bing C. Li, Lockheed Martin RMS-Owego (United States)


Published in SPIE Proceedings Vol. 10202:
Automatic Target Recognition XXVII
Firooz A. Sadjadi; Abhijit Mahalanobis, Editor(s)

© SPIE. Terms of Use
Back to Top