The DOI matches its Crossref record; 63 of the 64 references it cites were found in a registry or an index.
Efficient reconstruction of nonrigid shape and motion from real-time 3D scanner data
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.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“[6] that can register 4D surfaces and produce an urshape template”
From Registration of 3D Point Clouds and Meshes: A Survey from Rigid to Nonrigid (2013) · cites this paper as [6]
In the citing paper
“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.”
From Registration of 3D Point Clouds and Meshes: A Survey from Rigid to Nonrigid (2013) · cites this paper as [6]
In the citing paper
“[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.”
From Registration of 3D Point Clouds and Meshes: A Survey from Rigid to Nonrigid (2013) · cites this paper as [6]
In the citing paper
“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.”
From Registration of 3D Point Clouds and Meshes: A Survey from Rigid to Nonrigid (2013) · cites this paper as [6]
Citations
Cites
A Method for Registration of 3-D Shapes
Besl, P., & Mckay, N. D. (1992) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.121791 · Cited by 22,163
2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
(2017) · doi:10.1109/cvpr35066.2017 · Cited by 7,284
An Introduction to the Conjugate Gradient Method Without the Agonizing Pain
Shewchuk, J. R. (1994) · Cited by 2,193
2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition
(2001) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2001.990916 · Cited by 1,884
Terzopoulos, D., Platt, J. C., Barr, A. H., & Fleischer, K. (1987) · ACM SIGGRAPH Conference (SIGGRAPH) · doi:10.1145/37401.37427 · Cited by 1,716
SCAPE: shape completion and animation of people
Anguelov, D., Srinivasan, P., Koller, D., Thrun, S., Rodgers, J., & Davis, J. (2005) · ACM Transactions on Graphics · doi:10.1145/1073204.1073207 · Cited by 1,489
High-quality video view interpolation using a layered representation
Zitnick, C. L., Kang, S. B., Uyttendaele, M., Winder, S. A. J., & Szeliski, R. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015766 · Cited by 1,386
Nonlinear Programming: Analysis and Methods
Avriel, M. (1976) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,339
Nonlinear Programming Analysis and Methods
Rodin, E. Y. (1977) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(77)90071-2 · Cited by 1,300
The space of human body shapes: reconstruction and parameterization from range scans
Allen, B., Curless, B., & Popović, Z. (2003) · ACM SIGGRAPH 2003 Papers · doi:10.1145/1201775.882311 · Cited by 913
Cited by
Sorted by citations
DynamicFusion: Reconstruction and tracking of non-rigid scenes in real-time
Newcombe, R. A., Fox, D., & Seitz, S. M. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7298631 · Cited by 951
Industry 4.0 technologies and their applications in fighting COVID-19 pandemic
Javaid, M., Haleem, A., Vaishya, R., Bahl, S., Suman, R., & Vaish, A. (2020) · Diabetes & Metabolic Syndrome: Clinical Research & Reviews · doi:10.1016/j.dsx.2020.04.032 · Cited by 758
Registration of 3D Point Clouds and Meshes: A Survey from Rigid to Nonrigid
Tam, G. K. L., Cheng, Z.-Q., Lai, Y.-K., Langbein, F. C., Liu, Y., Marshall, D., Martin, R. R., Sun, X.-F., & Rosin, P. L. (2013) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2012.310 · Cited by 679
“Template DC, D [6], [23], [28], [34]”
BackgroundMethodInfluentialA Survey on Shape Correspondence
van Kaick, O. M., Zhang, H., Hamarneh, G., & Cohen‐Or, D. (2011) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2011.01884.x · Cited by 606
High-quality streamable free-viewpoint video
Collet, A., Chuang, M., Sweeney, P., Gillett, D., Evseev, D., Calabrese, D., Hoppe, H., Kirk, A. G., & Sullivan, S. (2015) · ACM Transactions on Graphics · doi:10.1145/2766945 · Cited by 577
Metadata
- 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 › Computer Science › Computer Graphics and Computer-Aided Design › 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
