Monocular 3D Tracking of Deformable Surfaces Using Linear Programming

We present a method for 3D shape reconstruction of inextensible deformable surfaces from monocular image sequences. The key of our approach is to represent the surface as 3D triangulated mesh and formulate the reconstruction problem as a sequence of Linear Programming (LP) problems which can be effectively solved. The LP problem consists of data constraints which are 3D-to-2D keypoint correspondences and shape constraints which prevent large changes of the edge orientation between consecutive frames. Furthermore, we use a refined bisection algorithm to accelerate the computing speed. The robustness and efficiency of our approach are validated on both synthetic and real data.