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

August 23, 2018 Β· Entered Twilight Β· πŸ› Pacific Conference on Computer Graphics and Applications

πŸŒ… TWILIGHT: Old Age
Predates the code-sharing era β€” a pioneer of its time

"Last commit was 7.0 years ago (β‰₯5 year threshold)"

Evidence collected by the PWNC Scanner

Repo contents: BUILD.txt, LICENSE, Makefile, README.txt, allfigstabs.sh, crop.sh, data, fig1.sh, fig10.sh, fig11.sh, fig4.sh, fig5.sh, fig6.sh, fig7.sh, fig8.sh, fig9.sh, gpl.txt, install.sh, src, tab1.sh, tab2.sh

Authors Stefan Ohrhallinger, Michael Wimmer arXiv ID 1808.07778 Category cs.GR: Graphics Citations 9 Venue Pacific Conference on Computer Graphics and Applications Repository https://github.com/stefango74/stretchdenoise ⭐ 3 Last Checked 1 month ago
Abstract
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: https://github.com/stefango74/stretchdenoise
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Graphics

R.I.P. πŸ‘» Ghosted

Everybody Dance Now

Caroline Chan, Shiry Ginosar, ... (+2 more)

cs.GR πŸ› ICCV πŸ“š 820 cites 7 years ago
R.I.P. πŸ‘» Ghosted

Animating Human Athletics

Jessica K. Hodgins, Wayne L. Wooten, ... (+2 more)

cs.GR πŸ› SIGGRAPH πŸ“š 765 cites 3 years ago