Classes of Submodular Constraints Expressible by Graph Cuts

Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the theory of combinatorial optimisation, that instances of VCSPs with submodular constraints can be minimised in polynomial time. However, the general algorithm is of order O(n6 ) and hence rather impractical. In this paper, by using results from the theory of pseudo-Boolean optimisation, we identify several broad classes of submodular constraints over a Boolean domain which are expressible using binary submodular constraints, and hence can be minimised in cubic time. Furthermore, we describe how our results translate to certain optimisation problems arising in computer vision.

• Type: Conference
• Year: 2008
• Where: CP
• Authors: Stanislav Zivný, Peter Jeavons
• Keywords: Artificial Intelligence, Binary Submodular Constraints, Constraint Satisfaction Problems, CP 2008, Submodular Constraints