Skip to main navigation Skip to search Skip to main content

Homography estimation in omnidirectional vision under the L ∞-norm

  • Liwei Zhang
  • , Youfu Li*
  • , Jianwei Zhang
  • , Ying Hu
  • *Corresponding author for this work

    Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

    Abstract

    Solving the vision problem using convex optimization theory is now a focus in computer vision and robot communities. Second Order Cone Programming (SOCP) is especially effective in these methods. This paper discusses homography estimation in omnidirectional vision under the L-norm, which provides a theoretical guarantee of global optimality and a wide field of view. We give three different kinds of frameworks in this paper. This approach provides a theoretical guarantee of global optimality. A robot with this algorithm, which provides global optimality and a wide field of view demonstrated by good performance in experiments for synthetic and real data, has a more exact location and 3D reconstruction ability, which cannot be provided by traditional homography estimate method under traditional vision system. © 2010 IEEE.
    Original languageEnglish
    Title of host publication2010 IEEE International Conference on Robotics and Biomimetics, ROBIO 2010
    Pages1468-1473
    DOIs
    Publication statusPublished - 2010
    Event2010 IEEE International Conference on Robotics and Biomimetics, ROBIO 2010 - Tianjin, China
    Duration: 14 Dec 201018 Dec 2010

    Conference

    Conference2010 IEEE International Conference on Robotics and Biomimetics, ROBIO 2010
    PlaceChina
    CityTianjin
    Period14/12/1018/12/10

    Fingerprint

    Dive into the research topics of 'Homography estimation in omnidirectional vision under the L ∞-norm'. Together they form a unique fingerprint.

    Cite this