Inextensible Non-Rigid Structure-from-Motion by Second-Order Cone Programming.

Abstract

We present a global and convex formulation for the templateless 3D reconstruction of a deforming object with the perspective camera. We show for the first time how to construct a Second-Order Cone Programming (SOCP) problem for Non-Rigid Structure-from-Motion (NRSfM) using the Maximum-Depth Heuristic (MDH). In this regard, we deviate strongly from the general trend of using affine cameras and factorization-based methods to solve NRSfM, which do not perform well with complex nonlinear deformations. In MDH, the points' depths are maximized so that the distance between neighbouring points in camera space are upper bounded by the geodesic distance. In NRSfM both geodesic and camera space distances are unknown. We show that, nonetheless, given point correspondences and the camera's intrinsics the whole problem can be solved with SOCP. This is the first convex formulation for NRSfM with physical constraints. We further present how robustness and temporal continuity can be included in the formulation to handle outliers and decrease the problem size, respectively. We show with extensive experiments that our methods accurately reconstruct quasi-isometric objects from partial views under articulated and strong deformations. Compared to the previous methods, our approach gives better or similar accuracy. It naturally handles missing correspondences, non-smooth objects and is very simple to implement compared to previous methods, with only one free parameter (the neighbourhood size).

DOI: 10.1109/TPAMI.2017.2762669

Cite this paper

@article{Chhatkuli2017InextensibleNS, title={Inextensible Non-Rigid Structure-from-Motion by Second-Order Cone Programming.}, author={Ajad Chhatkuli and Daniel Pizarro and Toby Collins and Adrien Bartoli}, journal={IEEE transactions on pattern analysis and machine intelligence}, year={2017} }