Higher-order Segmentation via Multicuts
Multicuts enable to conveniently represent discrete graphical models for unsupervised and supervised image segmentation, in the case of local energy functions that exhibit symmetries. The basic Potts model and natural extensions thereof to higher-order models provide a prominent class of such objectives, that cover a broad range of segmentation problems relevant to image analysis and computer vision. We exhibit a way to systematically take into account such higher-order terms for computational inference. Furthermore, we present results of a comprehensive and competitive numerical evaluation of a variety of dedicated cutting-plane algorithms. Our approach enables the globally optimal evaluation of a significant subset of these models, without compromising runtime. Polynomially solvable relaxations are studied as well, along with advanced rounding schemes for post-processing.
Code (0)
등록된 구현이 없습니다.
Tasks
Image SegmentationSegmentationSemantic SegmentationSimilar Papers 제목 키워드 기반
Higher-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 SegmentationSegmentationNext Generation Multicuts for Semi-Planar Graphs
We study the problem of multicut segmentation. We introduce modified versions of the Semi-PlanarCC based on bounding Lagrange multipliers. We apply our work to natural image segmentation.
Image SegmentationSegmentationSemantic SegmentationUncertainty 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 TrackingSegmentationAnalysis 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…
A Polyhedral Study of Lifted Multicuts
Fundamental to many applications in data analysis are the decompositions of a graph, i.e. partitions of the node set into component-inducing subsets. One way of encoding decompositions is by multicuts, the subsets of tho…