Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
 
 
DownloadE-Mail
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  Reconstruction of Deforming Geometry from Time-Varying Point Clouds

Wand, M., Jenke, P., Huang, Q.-X., Bokeloh, M., Guibas, L., & Schilling, A. (2007). Reconstruction of Deforming Geometry from Time-Varying Point Clouds. In D. Fellner, & S. Spencer (Eds.), SGP 2007: Fifth Eurographics Symposium on Geometry Processing (pp. 49-58). Aire-la-Ville, Switzerland: Eurographics Association.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-207A-D Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-207B-B
Genre: Konferenzbeitrag

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Wand, Michael1, Autor           
Jenke, Philipp1, Autor           
Huang, Qi-Xing, Autor
Bokeloh, Martin1, 2, Autor           
Guibas, Leonidas, Autor
Schilling, Andreas, Autor
Affiliations:
1Computer Graphics, MPI for Informatics, Max Planck Society, ou_40047              
2International Max Planck Research School, MPI for Informatics, Max Planck Society, ou_1116551              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: In this paper, we describe a system for the reconstruction of deforming geometry from a time sequence of unstructured, noisy point clouds, as produced by recent real-time range scanning devices. Our technique reconstructs both the geometry and dense correspondences over time. Using the correspondences, holes due to occlusion are filled in from other frames. Our reconstruction technique is based on a statistical framework: The reconstruction should both match the measured data points and maximize prior probability densities that prefer smoothness, rigid deformation and smooth movements over time. The optimization procedure consists of an inner loop that optimizes the 4D shape using continuous numerical optimization and an outer loop that infers the discrete 4D topology of the data set using an iterative model assembly algorithm. We apply the technique to a variety of data sets, demonstrating that the new approach is capable of robustly retrieving animated models with correspondences from data sets suffering from significant noise, outliers and acquisition holes.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2008-03-182007
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: Aire-la-Ville, Switzerland : Eurographics Association
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 356518
DOI: 10.2312/SGP/SGP07/049-058
Anderer: Local-ID: C12573CC004A8E26-58B0A709B2869207C12573B0003A74D5-WJH-RDGTVPC-2007
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: Untitled Event
Veranstaltungsort: Barcelona, Spain
Start-/Enddatum: 2007-07-04 - 2007-07-06

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: SGP 2007 : Fifth Eurographics Symposium on Geometry Processing
Genre der Quelle: Konferenzband
 Urheber:
Fellner, Dieter, Herausgeber
Spencer, Stephen, Herausgeber
Affiliations:
-
Ort, Verlag, Ausgabe: Aire-la-Ville, Switzerland : Eurographics Association
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 49 - 58 Identifikator: ISBN: 978-3-905673-46-3