Joint Graph Decomposition & Node Labeling: Problem, Algorithms, Applications

@article{Levinkov2017JointGD,
  title={Joint Graph Decomposition & Node Labeling: Problem, Algorithms, Applications},
  author={Evgeny Levinkov and Jonas Uhrig and Siyu Tang and Mohamed Omran and Eldar Insafutdinov and Alexander Kirillov and Carsten Rother and Thomas Brox and Bernt Schiele and Bjoern Andres},
  journal={2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)},
  year={2017},
  pages={1904-1912}
}
We state a combinatorial optimization problem whose feasible solutions define both a decomposition and a node labeling of a given graph. This problem offers a common mathematical abstraction of seemingly unrelated computer vision tasks, including instance-separating semantic segmentation, articulated human body pose estimation and multiple object tracking. Conceptually, it generalizes the unconstrained integer quadratic program and the minimum cost lifted multicut problem, both of which are NP… CONTINUE READING
Highly Cited
This paper has 45 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 11 times over the past 90 days. VIEW TWEETS