Learning layered motion segmentations of video

被引:66
作者
Kumar, M. Pawan [2 ]
Torr, P. H. S. [2 ]
Zisserman, A. [1 ]
机构
[1] Univ Oxford, Dept Engn Sci, Oxford OX1 2JD, England
[2] Oxford Brookes Univ, Dept Comp, Oxford OX3 0BP, England
基金
英国工程与自然科学研究理事会;
关键词
motion segmentation; layered representation; coarse-to-fine belief propagation; graph cuts;
D O I
10.1007/s11263-007-0064-x
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We present an unsupervised approach for learning a layered representation of a scene from a video for motion segmentation. Our method is applicable to any video containing piecewise parametric motion. The learnt model is a composition of layers, which consist of one or more segments. The shape of each segment is represented using a binary matte and its appearance is given by the RGB value for each point belonging to the matte. Included in the model are the effects of image projection, lighting, and motion blur. Furthermore, spatial continuity is explicitly modeled resulting in contiguous segments. Unlike previous approaches, our method does not use reference frame(s) for initialization. The two main contributions of our method are: (i) A novel algorithm for obtaining the initial estimate of the model by dividing the scene into rigidly moving components using efficient loopy belief propagation; and (ii) Refining the initial estimate using alpha beta-swap and alpha-expansion algorithms, which guarantee a strong local minima. Results are presented on several classes of objects with different types of camera motion, e. g. videos of a human walking shot with static or translating cameras. We compare our method with the state of the art and demonstrate significant improvements.
引用
收藏
页码:301 / 319
页数:19
相关论文
共 25 条
[1]  
AGARWAL A, 2004, EUR C COMP VIS, V3, P54
[2]   Probabilistic detection and tracking of motion boundaries [J].
Black, MJ ;
Fleet, DJ .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 2000, 38 (03) :231-245
[3]  
BLAKE A, 2004, ECCV, V1, P428
[4]   Fast approximate energy minimization via graph cuts [J].
Boykov, Y ;
Veksler, O ;
Zabih, R .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2001, 23 (11) :1222-1239
[5]  
Boykov Y.Y., 2001, ICCV, V1, P105, DOI DOI 10.1109/ICCV.2001.937505
[6]  
Cremers D, 2003, NINTH IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION, VOLS I AND II, PROCEEDINGS, P886
[7]  
FELZENSZWALB PF, 2003, NIPS
[8]  
Jojic N, 2001, PROC CVPR IEEE, P199
[9]   What energy functions can be minimized via graph cuts? [J].
Kolmogorov, V ;
Zabih, R .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2004, 26 (02) :147-159
[10]  
Kumar MP, 2005, IEEE I CONF COMP VIS, P33