Planar Scene Modeling from Quasiconvex Subproblems

In this paper, we propose a convex optimization based approach for piecewise planar reconstruction. We show that the task of reconstructing a piecewise planar environment can be set in an L∞ based Homographic framework that iteratively computes scene plane and camera pose parameters. Instead of image points, the algorithm optimizes over inter-image homographies. The resultant objective functions are minimized using Second Order Cone Programming algorithms. Apart from showing the convergence of the algorithm, we also empirically verify its robustness to error in initialization through various experiments on synthetic and real data. We intend this algorithm to be in between initialization approaches like decomposition methods and iterative non-linear minimization methods like Bundle Adjustment.

• Type: Conference
• Year: 2009
• Where: ACCV
• Authors: Visesh Chari, Anil Kumar Nelakanti, Chetan Jakkoju, C. V. Jawahar
• Keywords: ACCV 2009, Computer Vision, Piecewise Planar, Piecewise Planar Environment, Piecewise Planar Reconstruction