Error analysis for denoising smooth modulo signals on a graph - Archive ouverte HAL Access content directly
Journal Articles Applied and Computational Harmonic Analysis Year : 2021

Error analysis for denoising smooth modulo signals on a graph

(1)
1
Hemant Tyagi
  • Function : Author
  • PersonId : 1087784

Abstract

In many applications, we are given access to noisy modulo samples of a smooth function with the goal being to robustly unwrap the samples, i.e., to estimate the original samples of the function. In a recent work, Cucuringu and Tyagi [11] proposed denoising the modulo samples by first representing them on the unit complex circle and then solving a smoothness regularized least squares problem-the smoothness measured w.r.t the Laplacian of a suitable proximity graph G-on the product manifold of unit circles. This problem is a quadratically constrained quadratic program (QCQP) which is nonconvex, hence they proposed solving its sphere-relaxation leading to a trust region subproblem (TRS). In terms of theoretical guarantees, ℓ_2 error bounds were derived for (TRS). These bounds are however weak in general and do not really demonstrate the denoising performed by (TRS). In this work, we analyse the (TRS) as well as an unconstrained relaxation of (QCQP). For both these estimators we provide a refined analysis in the setting of Gaussian noise and derive noise regimes where they provably denoise the modulo observations w.r.t the ℓ_2 norm. The analysis is performed in a general setting where G is any connected graph.
Fichier principal
Vignette du fichier
error_graph_mod1.pdf (956 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03101720 , version 1 (07-01-2021)
hal-03101720 , version 2 (10-01-2022)

Identifiers

  • HAL Id : hal-03101720 , version 2

Cite

Hemant Tyagi. Error analysis for denoising smooth modulo signals on a graph. Applied and Computational Harmonic Analysis, In press. ⟨hal-03101720v2⟩
39 View
41 Download

Share

Gmail Facebook Twitter LinkedIn More