A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
This paper copes with the global optimization of Markovian energies. Energies are defined on an arbitrary graph and pairwise interactions are considered. The label set is assumed to be linearly ordered and of finite cardinality, while each interaction term (prior) shall be a submodular function. We propose an algorithm that computes a global optimizer under these assumptions. The approach consists of mapping the original problem into a combinatorial one that is shown to be globally solvabledoi:10.1016/j.dam.2009.02.026 fatcat:jaav5cy3grab7elupjztqhuqmq