Efficient Decomposition of Image and Mesh Graphs by Lifted Multicuts


Formulations of the Image Decomposition Problem [18] as a Multicut Problem (MP) w.r.t. a superpixel graph have received considerable attention. In contrast, instances of the MP w.r.t. a pixel grid graph have received little attention, firstly, because the MP is NP-hard and instances w.r.t. a pixel grid graph are hard to solve in practice, and, secondly, due to the lack of long-range terms in the objective function of the MP. We propose a generalization of the MP with long-range terms (LMP). We design and implement two efficient algorithms (primal feasible heuristics) for the MP and LMP which allow us to study instances of both problems w.r.t. the pixel grid graphs of the images in the BSDS-500 benchmark. The decompositions we obtain do not differ significantly from the state of the art, suggesting that the LMP is a competitive formulation of the Image Decomposition Problem. To demonstrate the generality of the LMP, we apply it also to the Mesh Decomposition Problem posed by the Princeton benchmark [16], obtaining state-of-the-art decompositions.

DOI: 10.1109/ICCV.2015.204

Extracted Key Phrases

8 Figures and Tables

Citations per Year

Citation Velocity: 11

Averaging 11 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@article{Keuper2015EfficientDO, title={Efficient Decomposition of Image and Mesh Graphs by Lifted Multicuts}, author={Margret Keuper and Evgeny Levinkov and Nicolas Bonneel and Guillaume Lavou{\'e} and Thomas Brox and Bjoern Andres}, journal={2015 IEEE International Conference on Computer Vision (ICCV)}, year={2015}, pages={1751-1759} }