Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
SIAM Journal on Numerical Analysis
Markov Random Fields with Efficient Approximations
CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Efficient graph-based energy minimization methods in computer vision
Efficient graph-based energy minimization methods in computer vision
Comparison of Graph Cuts with Belief Propagation for Stereo, using Identical MRF Parameters
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
What Energy Functions Can Be Minimizedvia Graph Cuts?
IEEE Transactions on Pattern Analysis and Machine Intelligence
On Steepest Descent Algorithms for Discrete Convex Functions
SIAM Journal on Optimization
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
Motion Layer Extraction in the Presence of Occlusion Using Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Convergent Tree-Reweighted Message Passing for Energy Minimization
IEEE Transactions on Pattern Analysis and Machine Intelligence
Journal of Mathematical Imaging and Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
MAP estimation of semi-metric MRFs via hierarchical graph cuts
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Fusion Moves for Markov Random Field Optimization
IEEE Transactions on Pattern Analysis and Machine Intelligence
Comparison of energy minimization algorithms for highly connected graphs
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part II
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
New algorithms for convex cost tension problem with application to computer vision
Discrete Optimization
Hi-index | 0.00 |
This paper addresses the problem of minimizing multilabel energies with truncated convex priors. Such priors are known to be useful but difficult and slow to optimize because they are not convex. We propose two novel classes of binary Graph-Cuts (GC) moves, namely the convex move and the quantized move. The moves are complementary. To significantly improve efficiency, the label range is divided into even intervals. The quantized move tends to efficiently put pixel labels into the correct intervals for the energy with truncated convex prior. Then the convex move assigns the labels more precisely within these intervals for the same energy. The quantized move is a modified a-expansion move, adapted to handle a generalized Potts prior, which assigns a constant penalty to arguments above some threshold. Our convex move is a GC representation of the efficient Murota's algorithm. We assume that the data terms are convex, since this is a requirement for Murota's algorithm. We introduce Quantized-Convex Split Moves algorithm which minimizes energies with truncated priors by alternating both moves. This algorithm is a fast solver for labeling problems with a high number of labels and convex data terms. We illustrate its performance on image restoration.