A Graph-cut Based Algorithm For Approximate Mrf Optimization

This paper copes with the approximate minimization of Markovian energy with pairwise interactions. We extend previous approaches that rely on graph-cuts and move making techniques. For this purpose, a new move is introduced that permits us to perform better approximate optimizations. Some experiments show that very good local minima are obtained while keeping the memory usage low.

• Type: Conference
• Year: 2009
• Where: ICIP
• Keywords: Approximate Mrf Optimization, ICIP 2009, Image Processing