pith. sign in

arxiv: 1107.2085 · v1 · pith:EMDONMNJnew · submitted 2011-07-11 · 💻 cs.CV

Kunchenko's Polynomials for Template Matching

Oleg Chertov , Taras Slipets This is my paper
classification 💻 cs.CV
keywords kunchenkopolynomialstemplatematchingmethodaccordingclassicalcompared
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Generalized Stochastic Approximation of the Log-Likelihood Ratio for Robust Sequential Change-Point Detection

    stat.ME 2026-05 unverdicted novelty 7.0 full

    A new approximation method for the log-likelihood ratio allows robust sequential change-point detection in non-Gaussian processes using moments up to order 3s.

  2. From Volterra Series to Kunchenko Stochastic Polynomials: Half a Century of Non-Gaussian Estimation Methodology

    stat.ME 2026-05 unverdicted novelty 3.0

    This work traces the evolution of Kunchenko stochastic polynomials as a semiparametric methodology for non-Gaussian estimation, linking them formally to Volterra series while outlining the school's dissertations, coll...