Cited by 2793D Shape Modeling and AnalysisMedical Image Segmentation TechniquesComputer Graphics and Visualization Techniques

Non‐Rigid Registration Under Isometric Deformations

Open access
Huang, Qi‐Xing, Adams, Bart, Wicke, Martin, Guibas, Leonidas J.·2008·Computer Graphics Forum

Abstract

We present a robust and efficient algorithm for the pairwise non‐rigid registration of partially overlapping 3D surfaces. Our approach treats non‐rigid registration as an optimization problem and solves it by alternating between correspondence and deformation optimization. Assuming approximately isometric deformations, robust correspondences are generated using a pruning mechanism based on geodesic consistency. We iteratively learn an appropriate deformation discretization from the current set of correspondences and use it to update the correspondences in the next iteration. Our algorithm is able to register partially similar point clouds that undergo large deformations, in just a few seconds. We demonstrate the potential of our algorithm in various applications such as example based articulated segmentation, and shape interpolation.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1111/j.1467-8659.2008.01285.x

Cites

48 of 48 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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?

  • 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.”
  • Some constraints have been adopted by non-rigid registration; for example, an isometry constraint based on Euclidean distance in [46] is replaced by geodesic distance in [2].

    “Some constraints have been adopted by non-rigid registration, e.g., [46] defines an isometry constraint based on Euclidean distance, which is replaced by geodesic distance in [2].”
  • Many challenges posed by rigid registration have been addressed [2].

    “Many challenges posed by rigid registration have been addressed [2].”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 2

  1. MITRA N. J., FLORY S., OVSJANIKOV M., GELFAND N., GUIBAS L., POTTMANN H.: Dynamic ge- ometry registration. In Proc. SGP (2007), pp. 173-182.
  2. SCHAEFER S., YUKSEL C.: Example-based skeleton ex- traction. In Proc. SGP (2007), pp. 153-162.

Cited by

Sorted by citations

Authors
Huang, Q., Adams, B., Wicke, M., & Guibas, L. J.
Affiliations
  • Stanford University (US)
  • Max Planck Center for Visual Computing and Communication (DE)
Venue
Computer Graphics Forum
Publisher
Wiley
Published
2008-07
Volume
27
Issue
5
Pages
1449-1457
ISSN
  • 0167-7055 (ISSN-L)
  • 1467-8659
OpenAlex
W2123487031
Cited by
279
References
48
Citations by year
2026: 5 · 2025: 9 · 2024: 13 · 2023: 10 · 2022: 12 · 2021: 15 · 2020: 9 · 2019: 14 · 2018: 15 · 2017: 20 · 2016: 26 · 2015: 14 · 2014: 26 · 2013: 24 · 2012: 20
FWCI
16.07
Type
journal article
Language
en
Open access
Locations
  • Computer Graphics Forum (publishedVersion)
  • Lirias (KU Leuven) (submittedVersion, other-oa)
Funders
  • National Science Foundation (0354543, 0205671)
  • University of Washington
  • Vlaamse regering
  • National Institutes of Health
  • Defense Advanced Research Projects Agency (HR0011, HR0011-05-1-0007)
Topics
  • Physical Sciences › Engineering › Computational Mechanics › 3D Shape Modeling and Analysis
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Medical Image Segmentation Techniques
  • Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computer Graphics and Visualization Techniques
Keywords
non-rigid registration, isometric deformations, 3D surface registration, point clouds, alternating optimization, shape interpolation

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