Smith Paul, Drummond Tom, Cipolla Roberto
Department of Engineering, University of Cambridge, Cambridge CB2 1PZ, UK.
IEEE Trans Pattern Anal Mach Intell. 2004 Apr;26(4):479-94. doi: 10.1109/TPAMI.2004.1265863.
This paper presents a new Bayesian framework for motion segmentation--dividing a frame from an image sequence into layers representing different moving objects--by tracking edges between frames. Edges are found using the Canny edge detector, and the Expectation-Maximization algorithm is then used to fit motion models to these edges and also to calculate the probabilities of the edges obeying each motion model. The edges are also used to segment the image into regions of similar color. The most likely labeling for these regions is then calculated by using the edge probabilities, in association with a Markov Random Field-style prior. The identification of the relative depth ordering of the different motion layers is also determined, as an integral part of the process. An efficient implementation of this framework is presented for segmenting two motions (foreground and background) using two frames. It is then demonstrated how, by tracking the edges into further frames, the probabilities may be accumulated to provide an even more accurate and robust estimate, and segment an entire sequence. Further extensions are then presented to address the segmentation of more than two motions. Here, a hierarchical method of initializing the Expectation-Maximization algorithm is described, and it is demonstrated that the Minimum Description Length principle may be used to automatically select the best number of motion layers. The results from over 30 sequences (demonstrating both two and three motions) are presented and discussed.
本文提出了一种用于运动分割的新贝叶斯框架——通过跟踪帧间边缘将图像序列中的一帧划分为代表不同运动物体的层。使用Canny边缘检测器来查找边缘,然后使用期望最大化算法将运动模型拟合到这些边缘,并计算边缘服从每个运动模型的概率。边缘还用于将图像分割成颜色相似的区域。然后,通过使用边缘概率并结合马尔可夫随机场风格的先验,计算这些区域最可能的标记。作为该过程的一个组成部分,还确定了不同运动层的相对深度顺序。本文给出了使用两帧分割两种运动(前景和背景)的该框架的高效实现。然后说明了如何通过跟踪边缘到更多帧中,累积概率以提供更准确和鲁棒的估计,并分割整个序列。接着给出了进一步的扩展,以解决多于两种运动的分割问题。这里描述了一种初始化期望最大化算法的分层方法,并证明了最小描述长度原则可用于自动选择最佳运动层数。给出并讨论了来自30多个序列(展示了两种和三种运动)的结果。