Efficient MAP approximation for dense energy functions
ICML '06 Proceedings of the 23rd international conference on Machine learning
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
Robust message-passing for statistical inference in sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
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
What is decreased by the max-sum arc consistency algorithm?
Proceedings of the 24th international conference on Machine learning
Probabilistic analysis of linear programming decoding
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic Graph Cuts for Efficient Inference in Markov Random Fields
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficiently solving convex relaxations for MAP estimation
Proceedings of the 25th international conference on Machine learning
Proceedings of the 25th international conference on Machine learning
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
Nonrigid Image Registration Using Dynamic Higher-Order MRF Model
ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part I
Graphical Models, Exponential Families, and Variational Inference
Foundations and Trends® in Machine Learning
Robust Higher Order Potentials for Enforcing Label Consistency
International Journal of Computer Vision
Image Segmentation Using Graph Representations and Local Appearance and Shape Models
GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
Global optimization for first order Markov Random Fields with submodular priors
Discrete Applied Mathematics
Iterated conditional modes for inverse dithering
Signal Processing
Large margin Boltzmann machines
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Guessing facets: polytope structure and improved LP decoder
IEEE Transactions on Information Theory
A Study of Parts-Based Object Class Detection Using Complete Graphs
International Journal of Computer Vision
Message passing for maximum weight independent set
IEEE Transactions on Information Theory
Soft arc consistency revisited
Artificial Intelligence
Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes
The Journal of Machine Learning Research
Minimizing and learning energy functions for side-chain prediction
RECOMB'07 Proceedings of the 11th annual international conference on Research in computational molecular biology
Reparameterization based consistent graph-structured linear programs
Proceedings of the 2010 ACM Symposium on Applied Computing
An occupancy-depth generative model of multi-view images
ACCV'07 Proceedings of the 8th Asian conference on Computer vision - Volume Part II
Scale selection for anisotropic diffusion filter by Markov random field model
Pattern Recognition
MAP estimation, message passing, and perfect graphs
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
MAP estimation of semi-metric MRFs via hierarchical graph cuts
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Convergent message passing algorithms: a unifying view
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
DAS '10 Proceedings of the 9th IAPR International Workshop on Document Analysis Systems
Understanding the scalability of Bayesian network inference using clique tree growth curves
Artificial Intelligence
A message-passing approach to distributed resource allocation in uplink DFT-spread-OFDMA systems
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
On dual decomposition and linear programming relaxations for natural language processing
EMNLP '10 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
Dual decomposition for parsing with non-projective head automata
EMNLP '10 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
Cosegmentation revisited: models and optimization
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part II
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
Convex relaxation for multilabel problems with product label spaces
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part V
A continuous max-flow approach to potts model
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part VI
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
Rolled fingerprint construction using MRF-based nonrigid image registration
IEEE Transactions on Image Processing
Classification and Semantic Mapping of Urban Environments
International Journal of Robotics Research
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
Solving MRFs with higher-order smoothness priors using hierarchical gradient nodes
ACCV'10 Proceedings of the 10th Asian conference on Computer vision - Volume Part I
Global optimization of wavelet-domain hidden Markov tree for image segmentation
Pattern Recognition
Exact decoding of syntactic translation models through Lagrangian relaxation
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Learning online discussion structures by conditional random fields
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
Joint shape segmentation with linear programming
Proceedings of the 2011 SIGGRAPH Asia Conference
Minimizing count-based high order terms in markov random fields
EMMCVPR'11 Proceedings of the 8th international conference on Energy minimization methods in computer vision and pattern recognition
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
Stop condition for subgradient minimization in dual relaxed (max,+) problem
EMMCVPR'11 Proceedings of the 8th international conference on Energy minimization methods in computer vision and pattern recognition
Discriminative Models for Multi-Class Object Layout
International Journal of Computer Vision
Automated cephalometric landmark localization using sparse shape and appearance models
MLMI'11 Proceedings of the Second international conference on Machine learning in medical imaging
Computer Vision and Image Understanding
Adaptive Exact Inference in Graphical Models
The Journal of Machine Learning Research
Global Interactions in Random Field Models: A Potential Function Ensuring Connectedness
SIAM Journal on Imaging Sciences
Global Solutions of Variational Models with Convex Regularization
SIAM Journal on Imaging Sciences
Pattern Recognition Letters
Oriented visibility for multiview reconstruction
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part III
Fast convergence of natural bargaining dynamics in exchange networks
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Exact decoding of phrase-based translation models through Lagrangian relaxation
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
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
Learning 3D geological structure from drill-rig sensors for automated mining
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
SimpleFlow: A Non-iterative, Sublinear Optical Flow Algorithm
Computer Graphics Forum
On Learning Conditional Random Fields for Stereo
International Journal of Computer Vision
Fast Structured Prediction Using Large Margin Sigmoid Belief Networks
International Journal of Computer Vision
Improved parsing and POS tagging using inter-sentence consistency constraints
EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
Patch based synthesis for single depth image super-resolution
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part III
Fast planar correlation clustering for image segmentation
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part VI
The lazy flipper: efficient depth-limited exhaustive search in discrete graphical models
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part VII
Applying piecewise approximation in perceptron training of conditional random fields
IDA'12 Proceedings of the 11th international conference on Advances in Intelligent Data Analysis
Window annealing for pixel-labeling problems
Computer Vision and Image Understanding
Proceedings of the ACM/SIGDA international symposium on Field programmable gate arrays
Journal of Artificial Intelligence Research
Proceedings of the 2nd International Workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications
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
Distributed data association in smart camera networks using belief propagation
ACM Transactions on Sensor Networks (TOSN)
Energy distribution view for monotonic dual decomposition
International Journal of Approximate Reasoning
Detecting, segmenting and tracking unknown objects using multi-label MRF inference
Computer Vision and Image Understanding
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 | 755.02 |
We develop and analyze methods for computing provably optimal maximum a posteriori probability (MAP) configurations for a subclass of Markov random fields defined on graphs with cycles. By decomposing the original distribution into a convex combination of tree-structured distributions, we obtain an upper bound on the optimal value of the original problem (i.e., the log probability of the MAP assignment) in terms of the combined optimal values of the tree problems. We prove that this upper bound is tight if and only if all the tree distributions share an optimal configuration in common. An important implication is that any such shared configuration must also be a MAP configuration for the original distribution. Next we develop two approaches to attempting to obtain tight upper bounds: a) a tree-relaxed linear program (LP), which is derived from the Lagrangian dual of the upper bounds; and b) a tree-reweighted max-product message-passing algorithm that is related to but distinct from the max-product algorithm. In this way, we establish a connection between a certain LP relaxation of the mode-finding problem and a reweighted form of the max-product (min-sum) message-passing algorithm.