2014 IEEE Conference on Computer Vision and Pattern Recognition Workshops 2014
DOI: 10.1109/cvprw.2014.45
|View full text |Cite
|
Sign up to set email alerts
|

Non-rigid Point Set Registration with Global-Local Topology Preservation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
58
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 65 publications
(58 citation statements)
references
References 19 publications
0
58
0
Order By: Relevance
“…Chui and Rangarajan [56] established a general framework for estimating correspondence and transformation, where in a nonrigid case, the transformation is modeled as a TPS function. Alternatively, the coherence point drift (CPD) algorithm [57] uses Gaussian radial basis functions instead of TPS, and it was later improved by using global-local topology constraints [58], [59]. In these formulations, both the rigid and nonrigid cases can be dealt with, but these methods usually throw out the similarity information (e.g., a descriptor) and use only the spatial position of each feature point; hence, the matching performance may probably be degraded.…”
Section: B Feature-based Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Chui and Rangarajan [56] established a general framework for estimating correspondence and transformation, where in a nonrigid case, the transformation is modeled as a TPS function. Alternatively, the coherence point drift (CPD) algorithm [57] uses Gaussian radial basis functions instead of TPS, and it was later improved by using global-local topology constraints [58], [59]. In these formulations, both the rigid and nonrigid cases can be dealt with, but these methods usually throw out the similarity information (e.g., a descriptor) and use only the spatial position of each feature point; hence, the matching performance may probably be degraded.…”
Section: B Feature-based Methodsmentioning
confidence: 99%
“…To this end, we introduce an efficient scheme similar to the LLE algorithm [6], [58], which is proposed as a nonlinear dimensionality reduction method to preserve the local neighborhood structure in a low-dimensional manifold. First, search the K nearest neighbors for each point in X. Denote by W an N × N weight matrix, and enforce W ij = 0 if x j does not belong to the set of neighbors of x i .…”
Section: B Local Geometrical Constraintmentioning
confidence: 99%
“…Ma proposed his vector field consensus algorithm in [23]. Ge [24] presented the global-local topology preservation (GLTP) algorithm for non-rigid point set registration.…”
Section: Model Registrationmentioning
confidence: 99%
“…Ge et al [26] presented a similar approach to the previous one, called Global-Local Topology Preservation (GLTP). The main motivation of this work is to handle non-rigid articulated deformations such as those of human movements.…”
Section: Coherent Point Drift Variantsmentioning
confidence: 99%