Graph Rigidity for Near-Coplanar Structure from Motion - Robotics Institute Carnegie Mellon University

Graph Rigidity for Near-Coplanar Structure from Motion

J. Valmadre, B. Upcroft, S. Sridharan, and S. Lucey
Conference Paper, Proceedings of International Conference on Digital Image Computing: Techniques and Applications (DICTA '11), pp. 480 - 486, December, 2011

Abstract

Recent algorithms for monocular motion capture (MoCap) estimate weak-perspective camera matrices between images using a small subset of approximately-rigid points on the human body (i.e. the torso and hip). A problem with this approach, however, is that these points are often close to coplanar, causing canonical linear factorisation algorithms for rigid structure from motion (SFM) to become extremely sensitive to noise. In this paper, we propose an alternative solution to weak-perspective SFM based on a convex relaxation of graph rigidity. We demonstrate the success of our algorithm on both synthetic and real world data, allowing for much improved solutions to marker less MoCap problems on human bodies. Finally, we propose an approach to solve the two-fold ambiguity over bone direction using a k-nearest neighbour kernel density estimator.

BibTeX

@conference{Valmadre-2011-121068,
author = {J. Valmadre and B. Upcroft and S. Sridharan and S. Lucey},
title = {Graph Rigidity for Near-Coplanar Structure from Motion},
booktitle = {Proceedings of International Conference on Digital Image Computing: Techniques and Applications (DICTA '11)},
year = {2011},
month = {December},
pages = {480 - 486},
}