Roof duality for polynomial 0-1 optimization
Mathematical Programming: Series A and B
Greedy algorithm and symmetric matroids
Mathematical Programming: Series A and B
Directed submodularity, ditroids and directed submodular flows
Mathematical Programming: Series A and B
Discrete Mathematics
On totally dual integral systems
Discrete Applied Mathematics
Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
SIAM Journal on Discrete Mathematics
A characterization of bisubmodular functions
Discrete Mathematics
Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Instant Recognition of Half Integrality and 2-Approximations
APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
Discrete Applied Mathematics
Bisubmodular Function Minimization
SIAM Journal on Discrete Mathematics
MRF's forMRI's: Bayesian Reconstruction of MR Images via Graph Cuts
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1
Optimizing Binary MRFs with Higher Order Cliques
ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part III
International Journal of Computer Vision
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
Mathematical Programming: Series A and B
Submodular Function Minimization under Covering Constraints
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Fusion Moves for Markov Random Field Optimization
IEEE Transactions on Pattern Analysis and Machine Intelligence
Submodularity on a tree: unifying L-convex and bisubmodular functions
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Discrete Applied Mathematics
Generic cuts: an efficient algorithm for optimal inference in higher order MRF-MAP
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part V
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
Hi-index | 0.05 |
Consider a convex relaxation f@? of a pseudo-Boolean function f. We say that the relaxation is totally half-integral if f@?(x) is a polyhedral function with half-integral extreme points x, and this property is preserved after adding an arbitrary combination of constraints of the form x"i=x"j, x"i=1-x"j, and x"i=@c where @c@?{0,1,12} is a constant. A well-known example is the roof duality relaxation for quadratic pseudo-Boolean functions f. We argue that total half-integrality is a natural requirement for generalizations of roof duality to arbitrary pseudo-Boolean functions. Our contributions are as follows. First, we provide a complete characterization of totally half-integral relaxations f@? by establishing a one-to-one correspondence with bisubmodular functions. Second, we give a new characterization of bisubmodular functions. Finally, we show some relationships between general totally half-integral relaxations and relaxations based on the roof duality. On the conceptual level, our results show that bisubmodular functions provide a natural generalization of the roof duality approach to higher-order terms. This can be viewed as a non-submodular analogue of the fact that submodular functions generalize the s-t minimum cut problem with non-negative weights to higher-order terms.