mlsanityData to 14 Oct 2026

Recovering H"older smooth functions from noisy modulo samples

arXiv 2112.01610 ↗First posted 2 Dec 2021math.ST stat.ML stat.THcited by 0

Not on the map. Why?

Abstract (arXiv)

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"older 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.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 5 of its 17 references that are in the map. First posted on arXiv 2 Dec 2021.

Builds on

5 of 17 references.

References · 5

  1. 2019On Unlimited Sampling and Reconstructioncited by 22
  2. 2016On the Estimation Performance and Convergence Rate of the Generalized Power Method for Phase Synchronizationcited by 17
  3. 2018Provably robust estimation of modulo 1 samples of a smooth function with applications to phase unwrappingcited by 1
  4. 2020Denoising modulo samples: k-NN regression and tightness of SDP relaxationcited by 1
  5. 2020Error analysis for denoising smooth modulo signals on a graphcited by 1

Built on by

Not cited yet.