Computer Vision and Image Understanding
Norm-product belief propagation: primal-dual message-passing for approximate inference
IEEE Transactions on Information Theory
Collective Inference for Extraction MRFs Coupled with Symmetric Clique Potentials
The Journal of Machine Learning Research
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
Computer Vision and Image Understanding
Global Interactions in Random Field Models: A Potential Function Ensuring Connectedness
SIAM Journal on Imaging Sciences
Structured Learning and Prediction in Computer Vision
Foundations and Trends® in Computer Graphics and Vision
Computer Vision and Image Understanding
| Hi-index | 0.07 |
This paper presents a new MRF optimization algorithm, which is derived from Linear Programming and manages to go beyond current state-of-the-art techniques (such as those based on graph-cuts or belief propagation). It does so by relying on a much tighter class of LP-relaxations, called cycle-relaxations. With the help of this class of relaxations, our algorithm tries to deal with a difficulty lying at the heart of MRF optimization: the existence of inconsistent cycles. To this end, it uses an operation called cycle-repairing. The goal of that operation is to fix any inconsistent cycles that may appear during optimization, instead of simply ignoring them as usually done up to now. The more the repaired cycles, the tighter the underlying LP relaxation becomes. As a result of this procedure, our algorithm is capable of providing almost optimal solutions even for very general MRFs with arbitrary potentials. Experimental results verify its effectiveness on difficult MRF problems, as well as its better performance compared to the state of the art.