Noise-Adaptive Shape Reconstruction from Raw Point Sets

We propose a noise‐adaptive shape reconstruction method specialized to smooth, closed shapes. Our algorithm takes as input a defect‐laden point set with variable noise and outliers, and comprises three main steps. First, we compute a novel noise‐adaptive distance function to the inferred shape, whic...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computer graphics forum Jg. 32; H. 5; S. 229 - 238
Hauptverfasser: Giraudot, Simon, Cohen-Steiner, David, Alliez, Pierre
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Oxford, UK Blackwell Publishing Ltd 01.08.2013
Wiley
Schlagworte:
Algebraic Geometry
Algorithms
Computer graphics
Computer science
Confidence
Graphs
I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling-Boundary representations
Mathematical analysis
Mathematical models
Mathematics
Noise
Reconstruction
Seeds
Studies
United States > US
ISSN:0167-7055, 1467-8659
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We propose a noise‐adaptive shape reconstruction method specialized to smooth, closed shapes. Our algorithm takes as input a defect‐laden point set with variable noise and outliers, and comprises three main steps. First, we compute a novel noise‐adaptive distance function to the inferred shape, which relies on the assumption that the inferred shape is a smooth submanifold of known dimension. Second, we estimate the sign and confidence of the function at a set of seed points, through minimizing a quadratic energy expressed on the edges of a uniform random graph. Third, we compute a signed implicit function through a random walker approach with soft constraints chosen as the most confident seed points computed in previous step.
Bibliographie:ArticleID:CGF12189
istex:9DFB51DF4EB30C98B5A5C0802DD6AE1CCE070429
ark:/67375/WNG-CRPC15Z4-0
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0167-7055
1467-8659
DOI:10.1111/cgf.12189