Two-View Motion Segmentation from Linear Programming Relaxation

This paper studies the problem of multibody motion segmentation, which is an important, but challenging problem due to its well-known chicken-and-egg-type recursive character. We propose a new Mixture-of-Fundamental-matrices model to describe the multibody motions from two views. Based on the maximum likelihood estimation, in conjunction with a random sampling scheme, we show that the problem can be naturally formulated as a Linear Programming (LP) problem. Consequently, the motion segmentation problem can be solved efficiently by linear program relaxation. Experiments demonstrate that: without assuming the actual number of motions our method produces accurate segmentation result. This LP formulation has also other advantages, such as easy to handle outliers and easy to enforce prior knowledge etc.

• Type: Conference
• Year: 2007
• Where: CVPR
• Authors: Hongdong Li
• Keywords: Challenging Problem, Computer Vision, CVPR 2007, Maximum Likelihood Estimation, Motion Segmentation Problem, Multibody Motion Segmentation, Multibody Motions