View source for Publications/darbon.08.iwcia

{{Publication
| published = true
| date = 2008-01-03
| authors = Jérôme Darbon
| title = Global Optimization for First Order Markov Random Fields with Submodular Priors
| booktitle = Proceedings of the twelfth International Workshop on Combinatorial Image Analysis (IWCIA'08)
| address = Buffalo, New York, USA
| lrdeprojects = Image
| abstract = This paper copes with the optimization of Markov Random Fields with pairwise interactions defined on arbitrary graphs. The set of labels is assumed to be linearly ordered and the priors are supposed to be submodular. Under these assumptions we propose an algorithm which computes an exact minimizer of the Markovian energy. Our approach relies on mapping the original into a combinatorial one which involves only binary variables. The latter is shown to be exactly solvable via computing a maximum flow. The restatement into a binary combinatorial problem is done by considering the level-sets of the labels instead of the label values themselves. The submodularity of the priors is shown to be a necessary and sufficient condition for the applicability of the proposed approach.
| lrdepaper = http://www.lrde.epita.fr/dload/papers/darbon.08.iwcia.pdf
| lrdekeywords = Image
| lrdenewsdate = 2008-01-03
| type = inproceedings
| id = darbon.08.iwcia
| bibtex = 
@InProceedings<nowiki>{</nowiki>	  darbon.08.iwcia,
  author	= <nowiki>{</nowiki>J\'er\^ome Darbon<nowiki>}</nowiki>,
  title		= <nowiki>{</nowiki>Global Optimization for First Order <nowiki>{</nowiki>Markov<nowiki>}</nowiki> Random Fields
		  with Submodular Priors<nowiki>}</nowiki>,
  booktitle	= <nowiki>{</nowiki>Proceedings of the twelfth International Workshop on
		  Combinatorial Image Analysis (IWCIA'08) <nowiki>}</nowiki>,
  year		= 2008,
  address	= <nowiki>{</nowiki>Buffalo, New York, USA<nowiki>}</nowiki>,
  month		= apr,
  abstract	= <nowiki>{</nowiki>This paper copes with the optimization of Markov Random
		  Fields with pairwise interactions defined on arbitrary
		  graphs. The set of labels is assumed to be linearly ordered
		  and the priors are supposed to be submodular. Under these
		  assumptions we propose an algorithm which computes an exact
		  minimizer of the Markovian energy. Our approach relies on
		  mapping the original into a combinatorial one which
		  involves only binary variables. The latter is shown to be
		  exactly solvable via computing a maximum flow. The
		  restatement into a binary combinatorial problem is done by
		  considering the level-sets of the labels instead of the
		  label values themselves. The submodularity of the priors is
		  shown to be a necessary and sufficient condition for the
		  applicability of the proposed approach.<nowiki>}</nowiki>
<nowiki>}</nowiki>

}}