TY - GEN
T1 - Estimating motion and structure from line matches
T2 - Proceedings of the 10th International Conference on Pattern Recognition
AU - Weng, Juyang
AU - Huang, Thomas S.
AU - Ahuja, Narendra
PY - 1990
Y1 - 1990
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0025545699&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0025545699&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0025545699
SN - 0818620625
T3 - Proceedings - International Conference on Pattern Recognition
SP - 168
EP - 172
BT - Proceedings - International Conference on Pattern Recognition
PB - Publ by IEEE
Y2 - 16 June 1990 through 21 June 1990
ER -