Incorporating higher order models for occlusion resilient motion segmentation in streaming videos

• Each video is divided in sub-sequences.
• Motion models are extracted for each video sub-sequence.
• The model error distribution and the model ranking for each trajectory are used to correlate different trajectories.
• Occlusions cause segmentation leakages when sub-sequences are merged.
• To avoid this effect we model segmentation as a graph coloring problem.

Video segmentation is a fundamental problem in computer vision and aims to extract meaningful entities from a video. One of the most useful cues in this quest is motion as is described by the trajectories of tracked points. In this paper we present a motion segmentation method attempting to address some of the major issues in the area. Namely, we propose an efficient framework where more complex motion models can be seamlessly integrated both maintaining computational tractability and not penalizing non translational motion. Moreover, we expose in depth the problem of object leakage due to occlusion and highlight that motion segmentation could be treated as a graph coloring problem. Our algorithm uses an approach based on graph theory and resolves occlusion cases in a robust manner. To endow our method with scalability, we follow the previously presented subsequence architecture and test it in a streaming setup. Extensive experiments demonstrate the flexibility and robustness of the method. The segmentation results are competitive compared to the state of the art.

Figure optionsDownload high-quality image (337 K)Download as PowerPoint slide