Abstract dynamic programming models under commutativity conditions
SIAM Journal on Control and Optimization
Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Perspectives of Monge properties in optimization
Discrete Applied Mathematics
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
A combinatorial algorithm minimizing submodular functions in strongly polynomial time
Journal of Combinatorial Theory Series B
Approximation algorithms for the metric labeling problem via a new linear programming formulation
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A combinatorial strongly polynomial algorithm for minimizing submodular functions
Journal of the ACM (JACM)
Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
What Energy Functions Can Be Minimized via Graph Cuts?
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
Discrete Applied Mathematics
Segmentation by Grouping Junctions
CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Tree consistency and bounds on the performance of the max-product algorithm and its generalizations
Statistics and Computing
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
A New Framework for Approximate Labeling via Graph Cuts
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision - Volume 2
Supermodular functions and the complexity of MAX CSP
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Quadratic programming relaxations for metric labeling and Markov random field MAP estimation
ICML '06 Proceedings of the 23rd international conference on Machine learning
Convergent Tree-Reweighted Message Passing for Energy Minimization
IEEE Transactions on Pattern Analysis and Machine Intelligence
Linear Programming Relaxations and Belief Propagation -- An Empirical Study
The Journal of Machine Learning Research
What is decreased by the max-sum arc consistency algorithm?
Proceedings of the 24th international conference on Machine learning
Domain filtering consistencies
Journal of Artificial Intelligence Research
A maximal tractable class of soft constraints
Journal of Artificial Intelligence Research
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
The generalized distributive law
IEEE Transactions on Information Theory
Tree-based reparameterization framework for analysis of sum-product and related algorithms
IEEE Transactions on Information Theory
Constructing free-energy approximations and generalized belief propagation algorithms
IEEE Transactions on Information Theory
A new class of upper bounds on the log partition function
IEEE Transactions on Information Theory
MAP estimation via agreement on trees: message-passing and linear programming
IEEE Transactions on Information Theory
Exact optimization for Markov random fields with convex priors
IEEE Transactions on Pattern Analysis and Machine Intelligence
The partial constraint satisfaction problem: Facets and lifting theorems
Operations Research Letters
What is decreased by the max-sum arc consistency algorithm?
Proceedings of the 24th international conference on Machine learning
On partial optimality in multi-label MRFs
Proceedings of the 25th international conference on Machine learning
Discriminative Learning of Max-Sum Classifiers
The Journal of Machine Learning Research
Efficient MRF deformation model for non-rigid image matching
Computer Vision and Image Understanding
Computer Vision and Image Understanding
MAP-Inference for Highly-Connected Graphs with DC-Programming
Proceedings of the 30th DAGM symposium on Pattern Recognition
Graphical Models, Exponential Families, and Variational Inference
Foundations and Trends® in Machine Learning
Note: The expressive power of binary submodular functions
Discrete Applied Mathematics
Virtual Arc consistency for weighted CSP
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Iterated conditional modes for inverse dithering
Signal Processing
A Study of Parts-Based Object Class Detection Using Complete Graphs
International Journal of Computer Vision
Generalized sparse MRF appearance models
Image and Vision Computing
Soft arc consistency revisited
Artificial Intelligence
Multi-view Superpixel Stereo in Urban Environments
International Journal of Computer Vision
Convergent message passing algorithms: a unifying view
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Variational segmentation algorithms with label frequency constraints
Pattern Recognition and Image Analysis
Towards more efficient and effective LP-based algorithms for MRF optimization
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part II
Energy minimization under constraints on label counts
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part II
Optimizing complex loss functions in structured prediction
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part II
Review article: Edge and line oriented contour detection: State of the art
Image and Vision Computing
Norm-product belief propagation: primal-dual message-passing for approximate inference
IEEE Transactions on Information Theory
Egocentric visual event classification with location-based priors
ISVC'10 Proceedings of the 6th international conference on Advances in visual computing - Volume Part II
Computer Vision and Image Understanding
Diffusion algorithms and structural recognition optimization problems
Cybernetics and Systems Analysis
Evaluation of a first-order primal-dual algorithm for MRF energy minimization
EMMCVPR'11 Proceedings of the 8th international conference on Energy minimization methods in computer vision and pattern recognition
An alternating direction method for dual MAP LP relaxation
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part II
Image comparison on the base of a combinatorial matching algorithm
DAGM'11 Proceedings of the 33rd international conference on Pattern recognition
Higher order Markov networks for model estimation
ISVC'11 Proceedings of the 7th international conference on Advances in visual computing - Volume Part I
Global Interactions in Random Field Models: A Potential Function Ensuring Connectedness
SIAM Journal on Imaging Sciences
Mitigating FPGA interconnect soft errors by in-place LUT inversion
Proceedings of the International Conference on Computer-Aided Design
Semantic parsing of street scenes from video
International Journal of Robotics Research
Structured Learning and Prediction in Computer Vision
Foundations and Trends® in Computer Graphics and Vision
Tractable triangles and cross-free convexity in discrete optimisation
Journal of Artificial Intelligence Research
Diverse M-best solutions in markov random fields
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part V
A convex discrete-continuous approach for Markov random fields
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part VI
Approximate envelope minimization for curvature regularity
ECCV'12 Proceedings of the 12th international conference on Computer Vision - Volume Part III
Detecting changes in images of street scenes
ACCV'12 Proceedings of the 11th Asian conference on Computer Vision - Volume Part IV
Inference Methods for CRFs with Co-occurrence Statistics
International Journal of Computer Vision
The power of linear programming for finite-valued CSPs: a constructive characterization
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Computer Vision and Image Understanding
Energy distribution view for monotonic dual decomposition
International Journal of Approximate Reasoning
Message-passing algorithms for quadratic minimization
The Journal of Machine Learning Research
Variational algorithms for marginal MAP
The Journal of Machine Learning Research
| Hi-index | 0.20 |
The max-sum labeling problem, defined as maximizing a sum of binary (i.e., pairwise) functions of discrete variables, is a general NP-hard optimization problem with many applications, such as computing the MAP configuration of a Markov random field. We review a not widely known approach to the problem, developed by Ukrainian researchers Schlesinger et al. in 1976, and show how it contributes to recent results, most importantly, those on the convex combination of trees and tree-reweighted max-product. In particular, we review Schlesinger et al.'s upper bound on the max-sum criterion, its minimization by equivalent transformations, its relation to the constraint satisfaction problem, the fact that this minimization is dual to a linear programming relaxation of the original problem, and the three kinds of consistency necessary for optimality of the upper bound. We revisit problems with Boolean variables and supermodular problems. We describe two algorithms for decreasing the upper bound. We present an example application for structural image analysis.