StretchDenoise: Parametric Curve Reconstruction with Guarantees by Separating Connectivity from Residual Uncertainty of Samples

by   Stefan Ohrhallinger, et al.

We reconstruct a closed denoised curve from an unstructured and highly noisy 2D point cloud. Our proposed method uses a two- pass approach: Previously recovered manifold connectivity is used for ordering noisy samples along this manifold and express these as residuals in order to enable parametric denoising. This separates recovering low-frequency features from denoising high frequencies, which avoids over-smoothing. The noise probability density functions (PDFs) at samples are either taken from sensor noise models or from estimates of the connectivity recovered in the first pass. The output curve balances the signed distances (inside/outside) to the samples. Additionally, the angles between edges of the polygon representing the connectivity become minimized in the least-square sense. The movement of the polygon's vertices is restricted to their noise extent, i.e., a cut-off distance corresponding to a maximum variance of the PDFs. We approximate the resulting optimization model, which consists of higher-order functions, by a linear model with good correspondence. Our algorithm is parameter-free and operates fast on the local neighborhoods determined by the connectivity. We augment a least-squares solver constrained by a linear system to also handle bounds. This enables us to guarantee stochastic error bounds for sampled curves corrupted by noise, e.g., silhouettes from sensed data, and we improve on the reconstruction error from ground truth. Open source to reproduce figures and tables in this paper is available at:


page 6

page 10


Tighter Bounds for Reconstruction from ε-samples

We show that reconstructing a curve in ℝ^d for d≥ 2 from a 0.66-sample i...

Approximate Curve-Restricted Simplification of Polygonal Curves

In this paper we study curve-restricted min-# simplification of polygona...

Curve Reconstruction in Riemannian Manifolds: Ordering Motion Frames

In this article we extend the computational geometric curve reconstructi...

Unsupervised 3D Human Mesh Recovery from Noisy Point Clouds

This paper presents a novel unsupervised approach to reconstruct human s...

Recovering Hölder smooth functions from noisy modulo samples

In signal processing, several applications involve the recovery of a fun...

Error analysis for denoising smooth modulo signals on a graph

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

CLMB: deep contrastive learning for robust metagenomic binning

The reconstruction of microbial genomes from large metagenomic datasets ...

Please sign up or login with your details

Forgot password? Click here to reset