Recovering Hölder smooth functions from noisy modulo samples

by   Michaël Fanuel, et al.
University of Lille

In signal processing, several applications involve the recovery of a function given noisy modulo samples. The setting considered in this paper is that the samples corrupted by an additive Gaussian noise are wrapped due to the modulo operation. Typical examples of this problem arise in phase unwrapping problems or in the context of self-reset analog to digital converters. We consider a fixed design setting where the modulo samples are given on a regular grid. Then, a three stage recovery strategy is proposed to recover the ground truth signal up to a global integer shift. The first stage denoises the modulo samples by using local polynomial estimators. In the second stage, an unwrapping algorithm is applied to the denoised modulo samples on the grid. Finally, a spline based quasi-interpolant operator is used to yield an estimate of the ground truth function up to a global integer shift. For a function in Hölder class, uniform error rates are given for recovery performance with high probability. This extends recent results obtained by Fanuel and Tyagi for Lipschitz smooth functions wherein kNN regression was used in the denoising step.


page 1

page 2

page 3

page 4


Denoising modulo samples: k-NN regression and tightness of SDP relaxation

Many modern applications involve the acquisition of noisy modulo samples...

Toward L_∞-recovery of Nonlinear Functions: A Polynomial Sample Complexity Bound for Gaussian Random Fields

Many machine learning applications require learning a function with a sm...

Structural Risk Minimization for C^1,1(R^d) Regression

One means of fitting functions to high-dimensional data is by providing ...

A Topological Lowpass Filter for Quasiperiodic Signals

This article presents a two-stage topological algorithm for recovering a...

Error analysis for denoising smooth modulo signals on a graph

In many applications, we are given access to noisy modulo samples of a s...

Efficient Approximate Recovery from Pooled Data Using Doubly Regular Pooling Schemes

In the pooled data problem we are given n agents with hidden state bits,...

Please sign up or login with your details

Forgot password? Click here to reset