Kunchenko's Polynomials for Template Matching
Oleg Chertov, Taras Slipets

TL;DR
This paper reviews Kunchenko's polynomial method for 1D template matching, comparing its performance with classical methods like cross-correlation and sum of squared differences through numerical experiments.
Contribution
It introduces and evaluates Kunchenko's polynomial approach for template matching, highlighting its effectiveness relative to traditional techniques.
Findings
Kunchenko's polynomial method performs comparably to classical methods.
The method shows potential advantages in specific signal recognition scenarios.
Numerical experiments validate the effectiveness of the approach.
Abstract
This paper reviews Kunchenko's polynomials using as template matching method to recognize template in one-dimensional input signal. Kunchenko's polynomials method is compared with classical methods - cross-correlation and sum of squared differences according to numerical statistical example.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications · Control Systems and Identification · Blind Source Separation Techniques
