End-to-End Learning for Graph Decomposition

Jie Song, Bjoern Andres, Michael J. Black, Otmar Hilliges, Siyu Tang; The IEEE International Conference on Computer Vision (ICCV), 2019, pp. 10093-10102

Abstract


Deep neural networks provide powerful tools for pattern recognition, while classical graph algorithms are widely used to solve combinatorial problems. In computer vision, many tasks combine elements of both pattern recognition and graph reasoning. In this paper, we study how to connect deep networks with graph decomposition into an end-to-end trainable framework. More specifically, the minimum cost multicut problem is first converted to an unconstrained binary cubic formulation where cycle consistency constraints are incorporated into the objective function. The new optimization problem can be viewed as a Conditional Random Field (CRF) in which the random variables are associated with the binary edge labels. Cycle constraints are introduced into the CRF as high-order potentials. A standard Convolutional Neural Network (CNN) provides the front-end features for the fully differentiable CRF. The parameters of both parts are optimized in an end-to-end manner. The efficacy of the proposed learning algorithm is demonstrated via experiments on clustering MNIST images and on the challenging task of real-world multi-people pose estimation.

Related Material


[pdf]
[bibtex]
@InProceedings{Song_2019_ICCV,
author = {Song, Jie and Andres, Bjoern and Black, Michael J. and Hilliges, Otmar and Tang, Siyu},
title = {End-to-End Learning for Graph Decomposition},
booktitle = {The IEEE International Conference on Computer Vision (ICCV)},
month = {October},
year = {2019}
}