Exact optimization for Markov random fields with convex priors

Authors:
H. Ishikawa
Affiliations:
Courant Inst. of Math. Sci., New York Univ., NY, USA
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
2003

Citing 0
Cited 96

What Energy Functions Can Be Minimizedvia Graph Cuts?

IEEE Transactions on Pattern Analysis and Machine Intelligence
Segmentation Given Partial Grouping Constraints

IEEE Transactions on Pattern Analysis and Machine Intelligence
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Surface Reconstruction Method Using Global Graph Cut Optimization

International Journal of Computer Vision
Graph Cuts and Efficient N-D Image Segmentation

International Journal of Computer Vision
Convergent Tree-Reweighted Message Passing for Energy Minimization

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
Image Restoration with Discrete Constrained Total Variation Part I: Fast and Exact Optimization

Journal of Mathematical Imaging and Vision
Accurate and Scalable Surface Representation and Reconstruction from Images

IEEE Transactions on Pattern Analysis and Machine Intelligence
Seeing stars: exploiting class relationships for sentiment categorization with respect to rating scales

ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Graph-cut-based stereo matching using image segmentation with symmetrical treatment of occlusions

Image Communication
A Linear Programming Approach to Max-Sum Problem: A Review

IEEE Transactions on Pattern Analysis and Machine Intelligence
Minimizing Nonsubmodular Functions with Graph Cuts-A Review

IEEE Transactions on Pattern Analysis and Machine Intelligence
Dynamic Graph Cuts for Efficient Inference in Markov Random Fields

IEEE Transactions on Pattern Analysis and Machine Intelligence
On partial optimality in multi-label MRFs

Proceedings of the 25th international conference on Machine learning
Performance vs computational efficiency for optimizing single and dynamic MRFs: Setting the state of the art with primal-dual strategies

Computer Vision and Image Understanding
Measuring uncertainty in graph cut solutions

Computer Vision and Image Understanding
Robust Higher Order Potentials for Enforcing Label Consistency

International Journal of Computer Vision
Graph Cut Optimization for the Piecewise Constant Level Set Method Applied to Multiphase Image Segmentation

SSVM '09 Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision
Convex Multi-class Image Labeling by Simplex-Constrained Total Variation

SSVM '09 Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision
L0-Norm and Total Variation for Wavelet Inpainting

SSVM '09 Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision
Implicit Active-Contouring with MRF

ICIAR '09 Proceedings of the 6th International Conference on Image Analysis and Recognition
Multi-label Moves for MRFs with Truncated Convex Priors

EMMCVPR '09 Proceedings of the 7th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition
Discrete Driver Assistance

ISMM '09 Proceedings of the 9th International Symposium on Mathematical Morphology and Its Application to Signal and Image Processing
Global optimization for first order Markov Random Fields with submodular priors

Discrete Applied Mathematics
Iterated conditional modes for inverse dithering

Signal Processing
SAR image regularization with fast approximate discrete minimization

IEEE Transactions on Image Processing
Multi-label MRF Optimization via a Least Squares s - t Cut

ISVC '09 Proceedings of the 5th International Symposium on Advances in Visual Computing: Part I
Total absolute Gaussian curvature for stereo prior

ACCV'07 Proceedings of the 8th Asian conference on Computer vision - Volume Part II
Exact solution of permuted submodular minsum problems

EMMCVPR'07 Proceedings of the 6th international conference on Energy minimization methods in computer vision and pattern recognition
Efficient shape matching via graph cuts

EMMCVPR'07 Proceedings of the 6th international conference on Energy minimization methods in computer vision and pattern recognition
Global optimization for first order Markov random fields with submodular priors

IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
A graph-cut based algorithm for approximate MRF optimization

ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Interactively multiphase image segmentation based on variational formulation and graph cuts

Pattern Recognition
Multi-label Depth Estimation for Graph Cuts Stereo Problems

Journal of Mathematical Imaging and Vision
Stereo depth estimation using synchronous optimization with segment based regularization

Pattern Recognition Letters
Reliability-driven, spatially-adaptive regularization for deformable registration

WBIR'10 Proceedings of the 4th international conference on Biomedical image registration
Fast and exact primal-dual iterations for variational problems in computer vision

ECCV'10 Proceedings of the 11th European conference on Computer vision: Part II
Convex relaxation for multilabel problems with product label spaces

ECCV'10 Proceedings of the 11th European conference on Computer vision: Part V
Minimization of monotonically levelable higher order MRF energies via graph cuts

IEEE Transactions on Image Processing
Graph search with appearance and shape information for 3-D prostate and bladder segmentation

MICCAI'10 Proceedings of the 13th international conference on Medical image computing and computer-assisted intervention: Part III
An efficient graph cut algorithm for computer vision problems

ECCV'10 Proceedings of the 11th European conference on computer vision conference on Computer vision: Part III
Improved Moves for Truncated Convex Models

The Journal of Machine Learning Research
Global Minimization for Continuous Multiphase Partitioning Problems Using a Dual Approach

International Journal of Computer Vision
3D Graph cut with new edge weights for cerebral white matter segmentation

Pattern Recognition Letters
Image segmentation by iterative optimization of multiphase multiple piecewise constant model and Four-Color relabeling

Pattern Recognition
Optimal graph based segmentation using flow lines with application to airway wall segmentation

IPMI'11 Proceedings of the 22nd international conference on Information processing in medical imaging
A fast solver for truncated-convex priors: quantized-convex split moves

EMMCVPR'11 Proceedings of the 8th international conference on Energy minimization methods in computer vision and pattern recognition
Discrete optimization of the multiphase piecewise constant mumford-shah functional

EMMCVPR'11 Proceedings of the 8th international conference on Energy minimization methods in computer vision and pattern recognition
Probabilistic atlas based segmentation using affine moment descriptors and graph-cuts

CAIP'11 Proceedings of the 14th international conference on Computer analysis of images and patterns - Volume Part I
A Spatial Regularization Approach for Vector Quantization

Journal of Mathematical Imaging and Vision
Compression and denoising using l0-norm

Computational Optimization and Applications
Optimization by Stochastic Continuation

SIAM Journal on Imaging Sciences
Global Solutions of Variational Models with Convex Regularization

SIAM Journal on Imaging Sciences
How Accurate Can Block Matches Be in Stereo Vision?

SIAM Journal on Imaging Sciences
Combinatorial Continuous Maximum Flow

SIAM Journal on Imaging Sciences
A multiple graph cut based approach for stereo analysis

DAGM'06 Proceedings of the 28th conference on Pattern Recognition
A new stereo matching model using visibility constraint based on disparity consistency

ACIVS'06 Proceedings of the 8th international conference on Advanced Concepts For Intelligent Vision Systems
Exact optimization of discrete constrained total variation minimization problems

IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
Statistical priors for efficient combinatorial optimization via graph cuts

ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part III
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
Discontinuity preserving phase unwrapping using graph cuts

EMMCVPR'05 Proceedings of the 5th international conference on Energy Minimization Methods in Computer Vision and Pattern Recognition
Domain decomposition methods with graph cuts algorithms for total variation minimization

Advances in Computational Mathematics
Trimap segmentation for fast and user-friendly alpha matting

VLSM'05 Proceedings of the Third international conference on Variational, Geometric, and Level Set Methods in Computer Vision
Interactive shadow removal from a single image using hierarchical graph cut

ACCV'09 Proceedings of the 9th Asian conference on Computer Vision - Volume Part I
Comparison of energy minimization algorithms for highly connected graphs

ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part II
A comparative study of energy minimization methods for markov random fields

ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part II
Measuring uncertainty in graph cut solutions – efficiently computing min-marginal energies using dynamic graph cuts

ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part II
A fast and exact algorithm for total variation minimization

IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part I
A study on convex optimization approaches to image fusion

SSVM'11 Proceedings of the Third international conference on Scale Space and Variational Methods in Computer Vision
Efficient minimization of the non-local potts model

SSVM'11 Proceedings of the Third international conference on Scale Space and Variational Methods in Computer Vision
Structured Learning and Prediction in Computer Vision

Foundations and Trends® in Computer Graphics and Vision
Multi-label Moves for MRFs with Truncated Convex Priors

International Journal of Computer Vision
Completely Convex Formulation of the Chan-Vese Image Segmentation Model

International Journal of Computer Vision
Segmentation of images with separating layers by fuzzy c-means and convex optimization

Journal of Visual Communication and Image Representation
Conditional random fields and supervised learning in automated skin lesion diagnosis

Journal of Biomedical Imaging - Special issue on Machine Learning in Medical Imaging
Image warping for face recognition: From local optimality towards global optimization

Pattern Recognition
New algorithms for convex cost tension problem with application to computer vision

Discrete Optimization
How to Compare Noisy Patches? Patch Similarity Beyond Gaussian Noise

International Journal of Computer Vision
Continuous Multiclass Labeling Approaches and Algorithms

SIAM Journal on Imaging Sciences
A convex relaxation method for computing exact global solutions for multiplicative noise removal

Journal of Computational and Applied Mathematics
Hausdorff distance constraint for multi-surface segmentation

ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part I
Dynamic programming for approximate expansion algorithm

ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part III
A convex discrete-continuous approach for Markov random fields

ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part VI
Generalized roof duality for multi-label optimization: optimal lower bounds and persistency

ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part VI
Nonmetric priors for continuous multilabel optimization

ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part VII
Fast tiered labeling with topological priors

ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part IV
Approximate envelope minimization for curvature regularity

ECCV'12 Proceedings of the 12th international conference on Computer Vision - Volume Part III
Multilayer graph cuts based unsupervised color-texture image segmentation using multivariate mixed student's t-distribution and regional credibility merging

Pattern Recognition
Review article: Multilabel partition moves for MRF optimization

Image and Vision Computing
GC-ASM: Synergistic integration of graph-cut and active shape model strategies for medical image segmentation

Computer Vision and Image Understanding
Remote sensing image object extraction using convex geometric active contour model

Proceedings of the Fifth International Conference on Internet Multimedia Computing and Service
Bayesian segmentation of atrium wall using globally-optimal graph cuts on 3D meshes

IPMI'13 Proceedings of the 23rd international conference on Information Processing in Medical Imaging
Markov Random Field modeling, inference & learning in computer vision & image understanding: A survey

Computer Vision and Image Understanding
Comparison of multi-label graph cuts method and Monte Carlo simulation with block-spin transformation for the piecewise constant Mumford-Shah segmentation model

Computer Vision and Image Understanding
Unsupervised multiphase color-texture image segmentation based on variational formulation and multilayer graph

Image and Vision Computing

Quantified Score

Hi-index	0.15

Visualization

Abstract

We introduce a method to solve exactly a first order Markov random field optimization problem in more generality than was previously possible. The MRF has a prior term that is convex in terms of a linearly ordered label set. The method maps the problem into a minimum-cut problem for a directed graph, for which a globally optimal solution can be found in polynomial time. The convexity of the prior function in the energy is shown to be necessary and sufficient for the applicability of the method.