2016 International Conference on Digital Image Computing: Techniques and Applications (DICTA) 2016
DOI: 10.1109/dicta.2016.7796986
|View full text |Cite
|
Sign up to set email alerts
|

A Coarse-to-Fine Algorithm for Registration in 3D Street-View Cross-Source Point Clouds

Abstract: With the development of numerous 3D sensing technologies, object registration on cross-source point cloud has aroused researchers' interests. When the point clouds are captured from different kinds of sensors, there are large and different kinds of variations. In this study, we address an even more challenging case in which the differently-source point clouds are acquired from a real street view. One is produced directly by the LiDAR system and the other is generated by using VSFM software on image sequence ca… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
18
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
3
2
2

Relationship

2
5

Authors

Journals

citations
Cited by 22 publications
(18 citation statements)
references
References 10 publications
0
18
0
Order By: Relevance
“…The registration is solved by using ICP. Following the coarseto-fine strategy, CSGMM [42] applies GMM-based algorithm to estimate the transformation. GM-CSPC [43] assumes the cross-source point clouds are coming from the same Gaussian mixture models and the two input point clouds are two samples from the Gaussian mixture.…”
Section: A Optimization-based Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…The registration is solved by using ICP. Following the coarseto-fine strategy, CSGMM [42] applies GMM-based algorithm to estimate the transformation. GM-CSPC [43] assumes the cross-source point clouds are coming from the same Gaussian mixture models and the two input point clouds are two samples from the Gaussian mixture.…”
Section: A Optimization-based Methodsmentioning
confidence: 99%
“…According to [77], [41], cross-source point cloud registration is much more challenging because of the combination of considerable noise and outliers, density difference, partial overlap and scale difference. Several algorithms [42], [41], [43], [39] use sophisticated optimization strategies to solve the crosssource point cloud registration problem by overcoming the cross-source challenges. For example, CSGM [41] transforms the registration problem into a graph matching problem and leverage the graph matching theory to overcome these challenges.…”
Section: Cross-source Registrationmentioning
confidence: 99%
See 1 more Smart Citation
“…They have not designed for scale variation. To compare fairly, we conduct an automatically scale normalization for all the other methods by following [14], which is assuming the size of the point cloud's 3D containing voxel is the same. Because JR-MPC becomes not practical when the point number increases significantly, we uniformly down-sample the point cloud to approximately 2000 points for JR-MPC.…”
Section: Experiments Setupmentioning
confidence: 99%
“…Ampatzidis et al, 2017;Ermacora et al, 2016;Foina et al, 2016;Huang et al, 2016;Salmerón-García et al, 2017), Building Information Modelling (e.g. Chuang et al, 2011;Edenhofer et al, 2016;Feng et al, 2015;Lundeen et al, 2017;Rausch et al, 2017;Schlette and Roßmann, 2017;Vähä et al, 2013), Big Data or the Internet of Things (e.g.…”
Section: Visionmentioning
confidence: 99%