2010 IEEE International Conference on Image Processing 2010
DOI: 10.1109/icip.2010.5652449
|View full text |Cite
|
Sign up to set email alerts
|

Robust range image registration using 3D lines

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2014
2014
2015
2015

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 9 publications
0
2
0
Order By: Relevance
“…Due to the near-certain presence of erroneous pairs in the preliminary matching A ini , none of optimization methods can be applied directly. Referring to [ 7 ], only K = 3 pairs of matched lines from A ini should be chosen to compute an initial transformation via the robust algorithm FMII 2 . The RANSAC algorithm randomly selects K data items, which are used to estimate the parameters.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Due to the near-certain presence of erroneous pairs in the preliminary matching A ini , none of optimization methods can be applied directly. Referring to [ 7 ], only K = 3 pairs of matched lines from A ini should be chosen to compute an initial transformation via the robust algorithm FMII 2 . The RANSAC algorithm randomly selects K data items, which are used to estimate the parameters.…”
Section: Methodsmentioning
confidence: 99%
“…A wide variety of research has focused on automating the coarse registration and reduction of matching time. A current trend is two-step approach [ 6 , 7 ]. At first, a feature-based coarse registration provides an initial estimate, which is then passed to an ICP-like method for accurate and robust fine registration.…”
Section: Introductionmentioning
confidence: 99%