Motion Trajectory Segmentation via Minimum Cost Multicuts
For the segmentation of moving objects in videos, the analysis of long-term point trajectories has been very popular recently. In this paper, we formulate the segmentation of a video sequence based on point trajectories as a minimum cost multicut problem. Unlike the commonly used spectral clustering formulation, the minimum cost multicut formulation gives natural rise to optimize not only for a cluster assignment but also for the number of clusters while allowing for varying cluster sizes. In this setup, we provide a method to create a long-term point trajectory graph with attractive and repulsive binary terms and outperform state-of-the-art methods based on spectral clustering on the FBMS-59 dataset and on the motion subtask of the VSB100 dataset.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringSegmentationUnsupervised Video Object SegmentationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Uncertainty in Minimum Cost Multicuts for Image and Motion Segmentation
The minimum cost lifted multicut approach has proven practically good performance in a wide range of applications such as image decomposition, mesh segmentation, multiple object tracking, and motion segmentation. It addr…
Motion SegmentationMultiple Object TrackingObject TrackingSegmentationHigher-Order Minimum Cost Lifted Multicuts for Motion Segmentation
Most state-of-the-art motion segmentation algorithms draw their potential from modeling motion differences of local entities such as point trajectories in terms of pairwise potentials in graphical models. Inference in in…
Motion SegmentationSegmentationA Multi-cut Formulation for Joint Segmentation and Tracking of Multiple Objects
Recently, Minimum Cost Multicut Formulations have been proposed and proven to be successful in both motion trajectory segmentation and multi-target tracking scenarios. Both tasks benefit from decomposing a graphical mode…
Motion Segmentationobject-detectionObject DetectionSegmentationAnalysis and Optimization of Graph Decompositions by Lifted Multicuts
We study the set of all decompositions (clusterings) of a graph through its characterization as a set of lifted multicuts. This leads us to practically relevant insights related to the definition of classes of decom…
Temporal Wasserstein non-negative matrix factorization for non-rigid motion segmentation and spatiotemporal deconvolution
Motion segmentation for natural images commonly relies on dense optic flow to yield point trajectories which can be grouped into clusters through various means including spectral clustering or minimum cost multicuts. How…
ClusteringMotion SegmentationOptical Flow EstimationSegmentation