2012
DOI: 10.1364/ao.51.000936
|View full text |Cite
|
Sign up to set email alerts
|

Robust camera pose estimation from unknown or known line correspondences

Abstract: We address the model-to-image registration problem with line features in the following two ways. (a) We present a robust solution to simultaneously recover the camera pose and the three-dimensional-to-two-dimensional line correspondences. With weak pose priors, our approach progressively verifies the pose guesses with a Kalman filter by using a subset of recursively found match hypotheses. Experiments show our method is robust to occlusions and clutter. (b) We propose a new line feature based pose estimation a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
16
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 32 publications
(16 citation statements)
references
References 34 publications
(66 reference statements)
0
16
0
Order By: Relevance
“…We can obtain n p easily from l through the known intrinsic matrix of the camera. For each pair of corresponding lines, we have one equation for t [50]: Figure 6. Geometry of camera projection model.…”
Section: Solve Translation Vectormentioning
confidence: 99%
“…We can obtain n p easily from l through the known intrinsic matrix of the camera. For each pair of corresponding lines, we have one equation for t [50]: Figure 6. Geometry of camera projection model.…”
Section: Solve Translation Vectormentioning
confidence: 99%
“…[15] proposed more recently a PnL solution using a minimum of 3 linecorrespondences, more robust to noise, but that spans 23 solutions. [16] presented the RLPnL algorithm, requiring at least 4 line correspondences. This algorithm uses subsets of 3 line correspondences and identifies a solution in the derivatives of a 16 th order polynomial.…”
Section: Related Workmentioning
confidence: 99%
“…Using 3 line-correspondences, [13] present a PnL method spanning 23 solutions, but more robust to noise, and operating with a minimum of 3 lines. [14] introduce a P4L algorithm operating on 3-line subsets. They recover solutions from the derivatives of a 16 th order cost function.…”
Section: Related Workmentioning
confidence: 99%
“…[15] extend the work from [14] with ASPnL (Accurate Subset based PnL), which is outlier-sensitive, but is more accurate with a small dataset. ASPnL includes a Gauss-Newton pose refinement.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation