Minimal Basis Subspace Representation: A Unified Framework for Rigid and Non-rigid Motion Segmentation

详细信息    查看全文

• 作者：Choon-Meng Lee ; Loong-Fah Cheong
• 关键词：Motion segmentation ; Subspace segmentation ; Non ; rigid structure from motion ; Minimal basis representation ; Shape basis ; Joint sparse representation ; Factor graph with global cost
• 刊名：International Journal of Computer Vision
• 出版年：2017
• 出版时间：January 2017
• 年：2017
• 卷：121
• 期：2
• 页码：209-233
• 全文大小：
• 刊物类别：Computer Science
• 刊物主题：Computer Imaging, Vision, Pattern Recognition and Graphics; Artificial Intelligence (incl. Robotics); Image Processing and Computer Vision; Pattern Recognition;
• 出版者：Springer US
• ISSN：1573-1405
• 卷排序：121

文摘

Motion segmentation and non-rigid structure from motion are two challenging computer vision problems that have attracted numerous research interests. While the previous works handle these two problems separately, we present a general motion segmentation framework in this paper for solving these two seemingly different problems in a unified manner. At the heart of our general motion segmentation framework is a model selection mechanism based on finding the minimal basis subspace representation, by seeking the joint sparse representation of the data matrix. However, such formulation is NP-hard and we solve the convex proxy instead. Unlike other compressive sensing related works, this convex proxy solution is insufficient for our problem. The convex relaxation artefacts and noise yield multiple subspace representations, making identification of the exact number of motion subspaces challenging. We solve for the right number of subspaces by transforming this problem into a Facility Location problem with global cost and solve the factor graph formulation using max product belief propagation message passing.