Template Matching with Ranks

12/14/2020
by   Ery Arias-Castro, et al.
0

We consider the problem of matching a template to a noisy signal. Motivated by some recent proposals in the signal processing literature, we suggest a rank-based method and study its asymptotic properties using some well-established techniques in empirical process theory combined with Hájek's projection method. The resulting estimator of the shift is shown to achieve a parametric rate of convergence and to be asymptotically normal. Some numerical simulations corroborate these findings.

READ FULL TEXT
research
09/09/2020

Template Matching and Change Point Detection by M-estimation

We consider the fundamental problem of matching a template to a signal. ...
research
07/11/2011

Kunchenko's Polynomials for Template Matching

This paper reviews Kunchenko's polynomials using as template matching me...
research
09/16/2015

Fast Template Matching by Subsampled Circulant Matrix

Template matching is widely used for many applications in image and sign...
research
11/19/2019

Towards A Theory of Duality for Graph Signal Processing

Motivated by duality in traditional signal processing, we investigate th...
research
05/29/2019

Rank-one Multi-Reference Factor Analysis

In recent years, there is a growing need for processing methods aimed at...
research
07/24/2020

Approximately Optimal Binning for the Piecewise Constant Approximation of the Normalized Unexplained Variance (nUV) Dissimilarity Measure

The recently introduced Matching by Tone Mapping (MTM) dissimilarity mea...
research
08/02/2017

Practically efficient methods for performing bit-reversed permutation in C++11 on the x86-64 architecture

The bit-reversed permutation is a famous task in signal processing and i...

Please sign up or login with your details

Forgot password? Click here to reset