Parameter Estimates for a Pencil of Lines: Bounds and Estimators
Abstract
Estimating the parameters of a pencil of lines is addressed. A statistical model for the measurements is developed, from which the Cramer Rao lower bound is determined. An estimator is derived, and its performance is simulated and compared to the bound. The estimator is shown to be asymptotically efficient, and superior to the classical least squares algorithm.
Cite
Text
Speyer and Werman. "Parameter Estimates for a Pencil of Lines: Bounds and Estimators." European Conference on Computer Vision, 2002. doi:10.1007/3-540-47969-4_29Markdown
[Speyer and Werman. "Parameter Estimates for a Pencil of Lines: Bounds and Estimators." European Conference on Computer Vision, 2002.](https://mlanthology.org/eccv/2002/speyer2002eccv-parameter/) doi:10.1007/3-540-47969-4_29BibTeX
@inproceedings{speyer2002eccv-parameter,
title = {{Parameter Estimates for a Pencil of Lines: Bounds and Estimators}},
author = {Speyer, Gavriel and Werman, Michael},
booktitle = {European Conference on Computer Vision},
year = {2002},
pages = {432-446},
doi = {10.1007/3-540-47969-4_29},
url = {https://mlanthology.org/eccv/2002/speyer2002eccv-parameter/}
}