ML Anthology

A Fast Method to Minimize L Error Norm for Geometric Vision Problems

Yongduek Seo, Richard I. Hartley
ICCV 2007 pp. 1-8
doi:10.1109/ICCV.2007.4408913 /iccv/2007/seo2007iccv-fast/

Abstract

Minimizing L∞ error norm for some geometric vision problems provides global optimization using the well-developed algorithm called SOCP (second order cone programming). Because the error norm belongs to quasi-convex functions, bisection method is utiliz

ICCV Semantic Scholar

Cite

Text

Seo and Hartley. "A Fast Method to Minimize L Error Norm for Geometric Vision Problems." IEEE/CVF International Conference on Computer Vision, 2007. doi:10.1109/ICCV.2007.4408913

Markdown

[Seo and Hartley. "A Fast Method to Minimize L Error Norm for Geometric Vision Problems." IEEE/CVF International Conference on Computer Vision, 2007.](https://mlanthology.org/iccv/2007/seo2007iccv-fast/) doi:10.1109/ICCV.2007.4408913

BibTeX

@inproceedings{seo2007iccv-fast,
  title     = {{A Fast Method to Minimize L Error Norm for Geometric Vision Problems}},
  author    = {Seo, Yongduek and Hartley, Richard I.},
  booktitle = {IEEE/CVF International Conference on Computer Vision},
  year      = {2007},
  pages     = {1-8},
  doi       = {10.1109/ICCV.2007.4408913},
  url       = {https://mlanthology.org/iccv/2007/seo2007iccv-fast/}
}