Cited by 1363D Shape Modeling and AnalysisComputer Graphics and Visualization TechniquesAdvanced Vision and Imaging

Efficient reconstruction of nonrigid shape and motion from real-time 3D scanner data

Wand, Michael, Adams, Bart, Ovsjanikov, Maksim, Berner, Alexander, Bokeloh, Martin, Jenke, Philipp, Guibas, Leonidas, Seidel, Hans-Peter +1 more·2009·ACM Transactions on Graphics

Abstract

We present a new technique for reconstructing a single shape and its nonrigid motion from 3D scanning data. Our algorithm takes a set of time-varying unstructured sample points that capture partial views of a deforming object as input and reconstructs a single shape and a deformation field that fit the data. This representation yields dense correspondences for the whole sequence, as well as a completed 3D shape in every frame. In addition, the algorithm automatically removes spatial and temporal noise artifacts and outliers from the raw input data. Unlike previous methods, the algorithm does not require any shape template but computes a fitting shape automatically from the input data. Our reconstruction framework is based upon a novel topology-aware adaptive subspace deformation technique that allows handling long sequences with complex geometry efficiently. The algorithm accesses data in multiple sequential passes, so that long sequences can be streamed from hard disk, not being limited by main memory. We apply the technique to several benchmark datasets, significantly increasing the complexity of the data that can be handled efficiently in comparison to previous work.

Integrity signals

Registry

Crossref · 10.1145/1516522.1516526

Cites

63 of 63 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • [6] can register 4D surfaces and produce an urshape template.

    “[6] that can register 4D surfaces and produce an urshape template”
  • To alleviate overfitting, [2], [6], [32] reduce the DoF explicitly by computing local transformations with respect to clusters or nodes, and most non-rigid registration methods use regularization to further constrain the solutions.

    “To alleviate it, [2], [6], [32] reduce the DoF explicitly by computing local transformations with respect to clusters or nodes, and most non-rigid registration methods use regularization to further constrain the solutions.”
  • [6], [28], [79] constructs a template, an urshape, by accumulating and filling in missing data from other scans in the same sequence. They have been used extensively in non-rigid registration to constrain dense correspondences. This works for objects with well defined forms, such as the human face and body.

    “[6], [28], [79] constructs a template, an urshape, by accumulating and filling in missing data from other scans in the same sequence.They have been used extensively in non-rigid registration to constrain dense correspondences [23], [29], [32], [34], [80].This works for objects with well defined forms, such as the human face and body.”
  • Given only two surfaces and a high-dimensional deformation model (like [6], [32]), the solution can only be regularized by other prior knowledge-mostly in the form of regularizations to ensure smoothness.

    “Yet, given only two surfaces and a high-dimensional deformation model (like [6], [32]), the solution can only be regularized by other prior knowledge-mostly in the form of regularizations to ensure smoothness.”

Cites

Flagged first, then by citations

1 of the 64 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Authors
Wand, M., Adams, B., Ovsjanikov, M., Berner, A., Bokeloh, M., Jenke, P., Guibas, L., Seidel, H.-P., & Schilling, A.
Affiliations
  • Max Planck Institute for Informatics (DE)
  • Stanford University (US)
  • University of Tübingen (DE)
Venue
ACM Transactions on Graphics
Published
2009-04
Volume
28
Issue
2
Pages
1-15
ISSN
  • 0730-0301 (ISSN-L)
  • 1557-7368
OpenAlex
W2065270678
Cited by
136
References
64
Citations by year
2026: 1 · 2025: 1 · 2024: 3 · 2023: 5 · 2022: 3 · 2021: 5 · 2020: 4 · 2019: 6 · 2018: 15 · 2017: 6 · 2016: 12 · 2015: 10 · 2014: 14 · 2013: 15 · 2012: 14
FWCI
11.79
Type
journal article
Language
en
Open access
closed
Locations
  • ACM Transactions on Graphics (publishedVersion)
  • Max Planck Institute for Plasma Physics (submittedVersion)
  • MPG.PuRe (Max Planck Society) (submittedVersion)
Funders
  • Defense Advanced Research Projects Agency (HR0011-05-1-0007)
  • National Science Foundation (ITR 0205671FRG 0354543)
  • National Institutes of Health (GM -072970)
Topics
  • Physical Sciences › Engineering › Computational Mechanics › 3D Shape Modeling and Analysis
  • Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computer Graphics and Visualization Techniques
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Vision and Imaging
Keywords
deformation field estimation, 3D scanning, unstructured point clouds, shape fitting, noise and outlier removal, dense correspondence, real-time 3D scanning

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review