Error analysis for denoising smooth modulo signals on a graph
From MaRDI portal
Publication:2075004
Recommendations
- Denoising modulo samples: k-NN regression and tightness of SDP relaxation
- Provably robust estimation of modulo 1 samples of a smooth function with applications to phase unwrapping
- Sharp MSE bounds for proximal denoising
- Approximate \(\ell_0\)-penalized estimation of piecewise-constant signals on graphs
- On recovery guarantees for angular synchronization
Cites work
- Concentration inequalities. A nonasymptotic theory of independence
- Estimating a smooth function on a large graph by Bayesian Laplacian regularisation
- scientific article; zbMATH DE number 1522808 (Why is no real title available?)
- Learning Theory
- Minimax lower bounds for function estimation on graphs
- Minimizing a quadratic over a sphere
- Newton’s Method with a Model Trust Region Modification
- On the estimation performance and convergence rate of the generalized power method for phase synchronization
- Provably robust estimation of modulo 1 samples of a smooth function with applications to phase unwrapping
- Solving the trust-region subproblem by a generalized eigenvalue problem
- Spectra of graphs
Cited in
(3)
This page was built for publication: Error analysis for denoising smooth modulo signals on a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2075004)