2008
DOI: 10.1111/j.1467-8659.2008.01285.x
|View full text |Cite
|
Sign up to set email alerts
|

Non‐Rigid Registration Under Isometric Deformations

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
306
0

Year Published

2010
2010
2021
2021

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 237 publications
(315 citation statements)
references
References 42 publications
(55 reference statements)
1
306
0
Order By: Relevance
“…When canonical forms are aligned directly, there is no guarantee that close-by points in one shape match close-by points in the other shape. Huang et al [18] proceed by iteratively alternating between a correspondence optimization and a deformation optimization. The approach can be viewed as an extension of the Iterative Closest Point algorithm (ICP) [8] that is often used to solve the rigid correspondence problem.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…When canonical forms are aligned directly, there is no guarantee that close-by points in one shape match close-by points in the other shape. Huang et al [18] proceed by iteratively alternating between a correspondence optimization and a deformation optimization. The approach can be viewed as an extension of the Iterative Closest Point algorithm (ICP) [8] that is often used to solve the rigid correspondence problem.…”
Section: Related Workmentioning
confidence: 99%
“…To improve the efficiency of the algorithm, the tree of all matching features is pruned if the features are too dissimilar. Nonetheless, the algorithm is not as efficient as the algorithm of Huang et al [18]. Once the feature correspondences are computed, the full correspondence is found by deforming the full mesh based on the feature points.…”
Section: Related Workmentioning
confidence: 99%
“…Huang et al [18] proceeds by iteratively alternating between a correspondence optimization and a deformation optimization. The approach can be viewed as an extension of the Iterative Closest Point algorithm (ICP) [8] that is often used to solve the rigid correspondence problem.…”
Section: Related Workmentioning
confidence: 99%
“…Computing the correspondence among a set of human shapes is further complicated by the intrinsic symmetry of the human body shape and by the shape variation across a population. Hence, fully-automatic correspondence methods that exploit the intrinsic geometry of the shape [18,33] may fail when corresponding humans that differ in shape.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation