Motion Segmentation in the Presence of Outlying, Incomplete, or Corrupted Trajectories

被引:261
作者
Rao, Shankar [1 ]
Tron, Roberto [2 ]
Vidal, Rene [2 ]
Ma, Yi [3 ,4 ]
机构
[1] HRL Labs LLC, Malibu, CA 90265 USA
[2] Johns Hopkins Univ, Dept Biomed Engn, Ctr Imaging Sci, Baltimore, MD 21218 USA
[3] Microsoft Res Asia, Beijing Sigma Ctr, Beijing 100190, Peoples R China
[4] Univ Illinois, Dept Elect & Comp Engn, Coordinated Sci Lab, Urbana, IL 61801 USA
基金
美国国家科学基金会;
关键词
Motion segmentation; subspace separation; lossy compression; incomplete data; error correction; sparse representation; matrix rank minimization; FACTORIZATION;
D O I
10.1109/TPAMI.2009.191
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we study the problem of segmenting tracked feature point trajectories of multiple moving objects in an image sequence. Using the affine camera model, this problem can be cast as the problem of segmenting samples drawn from multiple linear subspaces. In practice, due to limitations of the tracker, occlusions, and the presence of nonrigid objects in the scene, the obtained motion trajectories may contain grossly mistracked features, missing entries, or corrupted entries. In this paper, we develop a robust subspace separation scheme that deals with these practical issues in a unified mathematical framework. Our methods draw strong connections between lossy compression, rank minimization, and sparse representation. We test our methods extensively on the Hopkins155 motion segmentation database and other motion sequences with outliers and missing data. We compare the performance of our methods to state-of-the-art motion segmentation methods based on expectation-maximization and spectral clustering. For data without outliers or missing information, the results of our methods are on par with the state-of-the-art results and, in many cases, exceed them. In addition, our methods give surprisingly good performance in the presence of the three types of pathological trajectories mentioned above. All code and results are publicly available at http://perception.csl.uiuc.edu/coding/motion/.
引用
收藏
页码:1832 / 1845
页数:14
相关论文
共 33 条
[1]  
[Anonymous], FDN COMPUTATIONAL MA
[2]  
[Anonymous], P AUSTR JAP ADV WORK
[3]   The minimum description length principle in coding and modeling [J].
Barron, A ;
Rissanen, J ;
Yu, B .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (06) :2743-2760
[4]  
Candes E, 2005, ANN IEEE SYMP FOUND, P295
[5]   Decoding by linear programming [J].
Candes, EJ ;
Tao, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (12) :4203-4215
[6]   A multibody factorization method for independently moving objects [J].
Costeira, JP ;
Kanade, T .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 1998, 29 (03) :159-179
[7]  
Datar M., 2004, P ACM S COMP GEOM
[8]  
De la Torre F, 2001, EIGHTH IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION, VOL I, PROCEEDINGS, P362, DOI 10.1109/ICCV.2001.937541
[9]  
Donoho DL, 2009, J AM MATH SOC, V22, P1
[10]   For most large underdetermined systems of linear equations the minimal l1-norm solution is also the sparsest solution [J].
Donoho, DL .
COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 2006, 59 (06) :797-829