The performance issues of estimating motion and structure from line correspondences are studied. An approach to optimal estimation of motion and structure using line correspondences is presented. To minimize the expected errors in the estimated parameters, it is necessary to minimize the matrix-weighted discrepancy between the computed lines and the observed lines. In order to reliably reach the global minimum solution, a closed-form solution is computed and then used as the initial starting condition for an iterative optimal estimation algorithm. Simulation results show that, in the presence of noise, the accuracy of the optimal solution is not only considerably better than that of the closed-form solutions, but it has also reached a level that it is comparable with that of point-based optimal algorithms. Simulations also show that the error of the optimal solution is close to a theoretical lower error bound, the Cramer-Rao bound, which implies that there exists little room for accuracy improvement beyond the performance obtained.<<ETX>>
[1]
D. Luenberger.
Optimization by Vector Space Methods
,
1968
.
[2]
Narendra Ahuja,et al.
Estimating motion/structure from line correspondences: a robust linear algorithm and uniqueness theorems
,
1988,
Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition.
[3]
Thomas S. Huang,et al.
A linear algorithm for motion estimation using straight line correspondences
,
1988,
Comput. Vis. Graph. Image Process..
[4]
Narendra Ahuja,et al.
Optimal motion and structure estimation
,
1989,
Proceedings CVPR '89: IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[5]
Minas E. Spetsakis,et al.
Closed Form Solution to the Structure from Motion Problem from Line Correspondences
,
1987,
AAAI.
[6]
James H. McIntosh,et al.
Matching straight lines
,
1988,
Comput. Vis. Graph. Image Process..