What Energy Functions Can Be Minimized via Graph Cuts?
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
Unifying Registration and Segmentation for Multi-sensor Images
Proceedings of the 24th DAGM Symposium on Pattern Recognition
Segmentation by Grouping Junctions
CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Binary Partitioning, Perceptual Grouping, and Restoration with Semidefinite Programming
IEEE Transactions on Pattern Analysis and Machine Intelligence
Convergent Tree-Reweighted Message Passing for Energy Minimization
IEEE Transactions on Pattern Analysis and Machine Intelligence
Exact optimization for Markov random fields with convex priors
IEEE Transactions on Pattern Analysis and Machine Intelligence
On partial optimality in multi-label MRFs
Proceedings of the 25th international conference on Machine learning
Virtual Arc consistency for weighted CSP
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Soft arc consistency revisited
Artificial Intelligence
Proceedings of the 32nd DAGM conference on Pattern recognition
Diffusion algorithms and structural recognition optimization problems
Cybernetics and Systems Analysis
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
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
| Hi-index | 0.00 |
In this work we show, that for each permuted submodular MinSum problem (Energy Minimization Task) the corresponding submodular MinSum problem can be found in polynomial time. It follows, that permuted submodular MinSum problems are exactly solvable by transforming them into corresponding submodular tasks followed by applying standart approaches (e.g. using MinCut-MaxFlow based techniques).