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 language | English |
|---|---|
| Title of host publication | 2010 IEEE International Conference on Robotics and Biomimetics, ROBIO 2010 |
| Pages | 1468-1473 |
| DOIs | |
| Publication status | Published - 2010 |
| Event | 2010 IEEE International Conference on Robotics and Biomimetics, ROBIO 2010 - Tianjin, China Duration: 14 Dec 2010 → 18 Dec 2010 |
Conference
| Conference | 2010 IEEE International Conference on Robotics and Biomimetics, ROBIO 2010 |
|---|---|
| Place | China |
| City | Tianjin |
| Period | 14/12/10 → 18/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
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver