2017
DOI: 10.1049/iet-cvi.2017.0130
|View full text |Cite
|
Sign up to set email alerts
|

Effective outlier matches pruning algorithm for rigid pairwise point cloud registration using distance disparity matrix

Abstract: This study focuses on fast and robust outlier matches removal strategy to improve the efficiency and precision of initial alignment and further the quality of pairwise registration. Starts from the point matches obtained via feature detecting and matching, the distance disparity matrix derived from Euclidean invariants of rigid transformation is introduced, based on which a fast and effective pruning method is proposed to eliminate the outlier correspondences, especially the sharp ones. Then, the remaining mat… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 9 publications
(3 citation statements)
references
References 44 publications
0
3
0
Order By: Relevance
“…Distance transformation based method [25], [26] is a popular method to extract the center line. This method determines the centerline by locating the group of points farthest from the coronary artery boundary.…”
Section: ) Methods Based On Distance Transformationmentioning
confidence: 99%
“…Distance transformation based method [25], [26] is a popular method to extract the center line. This method determines the centerline by locating the group of points farthest from the coronary artery boundary.…”
Section: ) Methods Based On Distance Transformationmentioning
confidence: 99%
“…Then repeat the above steps till convergence, and select the model that has the largest number of inliers. Detailed implementation of the algorithm can be referred to literature (Luo and Wang 2018).…”
Section: Feature Point Matchingmentioning
confidence: 99%
“…Zeng [2] presents a weighted structural local sparse appearance model to further improve the robustness of tracking. Luo [3] proposes a fast and effective pruning method to eliminate the outlier correspondences, especially the sharp ones. However, artificial neural networks require a great deal of specialized knowledge and repetitive experiments.…”
Section: Introductionmentioning
confidence: 99%