Global relabeling for continuous optimization in binary image segmentation

Authors:
Markus Unger;Thomas Pock;Horst Bischof
Affiliations:
Institute for Computer Graphics and Vision, Graz University of Technology, Austria;Institute for Computer Graphics and Vision, Graz University of Technology, Austria;Institute for Computer Graphics and Vision, Graz University of Technology, Austria
Venue:
EMMCVPR'11 Proceedings of the 8th international conference on Energy minimization methods in computer vision and pattern recognition
Year:
2011

Citing 15
Cited 0

Geodesic Active Contours

International Journal of Computer Vision
Computing Geodesics and Minimal Surfaces via Graph Cuts

ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
"GrabCut": interactive foreground extraction using iterated graph cuts

ACM SIGGRAPH 2004 Papers
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision

IEEE Transactions on Pattern Analysis and Machine Intelligence
Globally Minimal Surfaces by Continuous Maximal Flows

IEEE Transactions on Pattern Analysis and Machine Intelligence
Random Walks for Image Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast Global Minimization of the Active Contour/Snake Model

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
Graph Cuts via $\ell_1$ Norm Minimization

IEEE Transactions on Pattern Analysis and Machine Intelligence
An Experimental Comparison of Discrete and Continuous Shape Optimization Methods

ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part I
Maximum flows and minimum cuts in the plane

Journal of Global Optimization
A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging

Journal of Mathematical Imaging and Vision
Power Watershed: A Unifying Graph-Based Optimization Framework

IEEE Transactions on Pattern Analysis and Machine Intelligence
Total variation minimization and a class of binary MRF models

EMMCVPR'05 Proceedings of the 5th international conference on Energy Minimization Methods in Computer Vision and Pattern Recognition
Global minimization of the active contour model with TV-Inpainting and two-phase denoising

VLSM'05 Proceedings of the Third international conference on Variational, Geometric, and Level Set Methods in Computer Vision

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, continuous optimization methods have become quite popular since they can deal with a variety of non-smooth convex problems. They are inherently parallel and therefore well suited for GPU implementations. Most of the continuous optimization approaches have in common that they are very fast in the beginning, but tend to get very slow as the solution gets close to the optimum. We therefore propose to apply global relabeling steps to speed up the convergence close to the optimum. The resulting primal-dual algorithm with global relabeling is applied to graph cut problems as well as to Total Variation (TV) based image segmentation. Numerical results show that the global relabeling steps significantly speed up convergence of the segmentation algorithm.