The Robotics Institute

Carnegie Mellon Robotics Institute

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Abstract

Geometric reconstruction problems in computer vision are often solved by minimizing a cost function that combines the reprojection errors in the 2D images. In this paper, we show that, for various geometric reconstruction problems, their reprojection error functions share a common and quasiconvex formulation. Based on the quasiconvexity, we present a novel quasiconvex optimization framework in which the geometric reconstruction problems are formulated as a small number of small-scale convex programs that are ready to solve. Our final reconstruction algorithm is simple and has intuitive geometric interpretation. In contrast to existing random sampling or local minimization approaches, our algorithm is deterministic and guarantees a predefined accuracy of the minimization result. We demonstrate the effectiveness of our algorithm by experiments on both synthetic and real data.

Notes

Associated Center(s) / Consortia: Vision and Autonomous Systems Center

Number of pages: 8

Text Reference

Qifa Ke and Takeo Kanade, "Quasiconvex Optimization for Robust Geometric Reconstruction," IEEE International Conference on Computer Vision (ICCV 2005), October, 2005, pp. 986 - 993.

BibTeX Reference

@inproceedings{Ke_2005_5235,
   author = "Qifa Ke and Takeo Kanade",
   title = "Quasiconvex Optimization for Robust Geometric Reconstruction",
   booktitle = "IEEE International Conference on Computer Vision (ICCV 2005)",
   pages = "986 - 993",
   month = "October",
   year = "2005",
   volume = "2",
}

The Robotics Institute

Menu