A graph-cut based algorithm for approximate MRF optimization

Authors:
Aymen Shabou;Florence Tupin;Jérôme Darbon
Affiliations:
Institut TELECOM, TELECOM ParisTech, CNRS, LTCI, France;Institut TELECOM, TELECOM ParisTech, CNRS, LTCI, France;Department of Mathematics, UCLA, Los Angeles
Venue:
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Year:
2009

Citing 7
Cited 2

Fast Approximate Energy Minimization via Graph Cuts

IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient graph-based energy minimization methods in computer vision

Efficient graph-based energy minimization methods in computer vision
What Energy Functions Can Be Minimizedvia Graph Cuts?

IEEE Transactions on Pattern Analysis and Machine Intelligence
Image Restoration with Discrete Constrained Total Variation Part II: Levelable Functions, Convex Priors and Non-Convex Cases

Journal of Mathematical Imaging and Vision
A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors

IEEE Transactions on Pattern Analysis and Machine Intelligence
Global optimization for first order Markov random fields with submodular priors

IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Exact optimization for Markov random fields with convex priors

IEEE Transactions on Pattern Analysis and Machine Intelligence

Nugget-cut: a segmentation scheme for spherically- and elliptically-shaped 3D objects

Proceedings of the 32nd DAGM conference on Pattern recognition
Review article: Multilabel partition moves for MRF optimization

Image and Vision Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.