2012 Second International Conference on 3D Imaging, Modeling, Processing, Visualization &Amp; Transmission 2012
DOI: 10.1109/3dimpvt.2012.63
|View full text |Cite
|
Sign up to set email alerts
|

Accurate and Automatic Alignment of Range Surfaces

Abstract: This paper describes an automatic pipeline that is able to take a set of unordered range images and align them into a full 3D model. A global voting scheme is employed for view matching, inspired by 2D techniques for image mosaicing. Then a multiple view registration approach is introduced, which aims at optimizing the alignment error simultaneously for all the views. Experiments demonstrate the effectiveness of the method.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
31
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
5
3
1

Relationship

2
7

Authors

Journals

citations
Cited by 43 publications
(31 citation statements)
references
References 26 publications
0
31
0
Order By: Relevance
“…This property eases the implementation and reduces errors, that are to be encountered in usual heuristics. Due to the accuracy requirements, unlike [14], we omit using distance transforms at this stage. We rather use speeded up KD-Trees to achieve exact nearest neighbors [30].…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…This property eases the implementation and reduces errors, that are to be encountered in usual heuristics. Due to the accuracy requirements, unlike [14], we omit using distance transforms at this stage. We rather use speeded up KD-Trees to achieve exact nearest neighbors [30].…”
Section: Methodsmentioning
confidence: 99%
“…[28] proposed a tensor feature and a hashing framework operating on meshes. Fantoni et al [14] uses 3D keypoint matching as an initial stage of multiview alignment to bring the scans to a rough alignment. Zhu et.…”
Section: Prior Artmentioning
confidence: 99%
“…Global registration can be solved in point (correspondences) space or in frame space. In the first case, all the rigid transformations are simultaneously optimized with respect to a cost function that includes the distance between corresponding points (Pennec, 1996;Benjemaa and Schmitt, 1998;Krishnan et al, 2007;Toldo et al, 2010;Bonarrigo and Signoroni, 2011;Fantoni et al, 2012;Chaudhury et al, 2015).…”
Section: Multiple 3d Point-set Registrationmentioning
confidence: 99%
“…However, this method is computationally expensive, especially in the big data case. Guo et al [15] and Fantoni et al [16] propose approaches for the registration of point cloud data by extracting the vertex features. However, the registration failure occurs in the case that insufficient features are obtained.…”
Section: Introductionmentioning
confidence: 99%