2020
DOI: 10.1016/j.isprsjprs.2019.12.008
|View full text |Cite
|
Sign up to set email alerts
|

Robust point cloud registration based on topological graph and Cauchy weighted lq-norm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 33 publications
(18 citation statements)
references
References 57 publications
0
12
0
Order By: Relevance
“…Therefore, the outlier rates of the initial 3D correspondences are very high (> 96% in these scan pairs). We first use an edge voting strategy (Li et al, 2020b) to filter some outliers before applying the proposed method for rigid model estimation. The 3D matching results are shown in Figure 10.…”
Section: Point Cloud Registration Experimentsmentioning
confidence: 99%
See 1 more Smart Citation
“…Therefore, the outlier rates of the initial 3D correspondences are very high (> 96% in these scan pairs). We first use an edge voting strategy (Li et al, 2020b) to filter some outliers before applying the proposed method for rigid model estimation. The 3D matching results are shown in Figure 10.…”
Section: Point Cloud Registration Experimentsmentioning
confidence: 99%
“…For example, generalized pbMestimator (GpbM-estimator) (Mittal et al, 2012) proposes a robust errors-in-variables model. Q-norm estimator (Li et al, 2016) and weighted q-norm estimator (Li et al, 2020b) further improve the robustness by introducing a lq-norm (0 < q < 1) model. These methods are robust to more than 70% outliers.…”
Section: Introductionmentioning
confidence: 99%
“…Li et al first carried out a rough registration of point clouds using a weighted l q -norm and then completed the process of fine registration by using topology diagram theory. This algorithm is considered to have good stability [19]. Based on the registration algorithm of the fast point feature histogram, Wu optimized the neighborhood density of points to complete the coarse registration process and ultimately carried out fine registration with ICP to improve the registration accuracy of the point cloud [20].…”
Section: Preprocessing Of Point Cloudsmentioning
confidence: 99%
“…Segment the point cloud data p i (x i , y i , z i , i, j, k, MC i , ρ i ) by FCM as Equations ( 13) to (19); Simplify point cloud data as bounding box algorithm and Equation (20); Output the simplified point cloud data.…”
Section: Endmentioning
confidence: 99%
“…The Iterative Closest Point (ICP) (Besl and McKay 1992) is often used, which offers several advantages. However, the input point clouds need to have a good initial registration, as the algorithm can become trapped in local minima (Attia and Slama 2017;Li et al 2020). To address this issue, several ICP variants have been developed over the years in order to enhance registration performance (e.g., Bae and Lichti 2008;Wujanz et al 2018;Kromer et al 2019;Li et al 2020).…”
Section: Introductionmentioning
confidence: 99%