Submodularity beyond submodular energies: Coupling edges in graph cuts

No abstract is available for this paper.

• Publication year

  2011

• Venue

  Computer Vision and Pattern Recognition

• Publication date

  2011-06-20

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/CVPR.2011.5995589
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Fast Approximate Energy Minimization with Label Costs

  2010cited by this paper
• Maximizing the Spread of Cascades Using Network Design

  2010cited by this paper
• Cooperative Cuts: Graph Cuts with Submodular Edge Weights

  2010cited by this paper
• Energy minimization for linear envelope MRFs

  2010cited by this paper
• Fast global optimization of curvature

  2010cited by this paper
• Graph Cut Based Inference with Co-occurrence Statistics

  2010influential reference
• P³ & Beyond: Move Making Algorithms for Solving Higher Order Functions

  2009influential reference
• Global connectivity potentials for random field models

  2009cited by this paper
• Higher-order clique reduction in binary graph cut

  2009cited by this paper
• Beyond pairwise energies: Efficient optimization for higher-order MRFs

  2009cited by this paper
• Curvature regularity for region-based image segmentation and inpainting: A linear programming relaxation

  2009cited by this paper
• Submodular Function Minimization under Covering Constraints

  2009cited by this paper
• An efficient algorithm for Co-segmentation

  2009cited by this paper
• Approximation and hardness results for label cut and related problems

  2009cited by this paper
• Graph cut based image segmentation with connectivity priors

  2008cited by this paper
• Classes of submodular constraints expressible by graph cuts

  2008cited by this paper
• Robust Higher Order Potentials for Enforcing Label Consistency

  2008cited by this paper
• Applications of parametric maxflow in computer vision

  2007cited by this paper
• A Seeded Image Segmentation Framework Unifying Graph Cuts And Random Walker Which Yields A New Algorithm

  2007influential reference
• Minimizing Nonsubmodular Functions with Graph Cuts-A Review

  2007cited by this paper
• P3 & Beyond: Solving Energies with Higher Order Cliques

  2007influential reference
• Random Walks for Image Segmentation

  2006cited by this paper
• Energy minimization via graph cuts: settling what is possible

  2005cited by this paper
• Interactive Image Segmentation Using an Adaptive GMMRF Model

  2004cited by this paper
• "GrabCut": interactive foreground extraction using iterated graph cuts

  2004cited by this paper
• Exact Optimization for Markov Random Fields with Convex Priors

  2003cited by this paper
• What energy functions can be minimized via graph cuts?

  2002cited by this paper
• Fast approximate energy minimization via graph cuts

  2001cited by this paper
• Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images

  2001cited by this paper
• Realization of set functions as cut functions of graphs and hypergraphs

  2001cited by this paper
• An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision

  2001cited by this paper
• Combinatorial optimization

  1997cited by this paper
• Approximating Probabilistic Inference in Bayesian Belief Networks is NP-Hard

  1993cited by this paper
• Combinatorial Optimization

  1992cited by this paper
• Submodular functions and optimization

  1991cited by this paper
• Exact Maximum A Posteriori Estimation for Binary Images

  1989influential reference
• Layered Augmenting Path Algorithms

  1986cited by this paper
• An analysis of approximations for maximizing submodular set functions—I

  1978cited by this paper
• Cores of convex games

  1971influential reference

• Adversarial Perturbations Maximization in Online Social Networks

  2026cites this paper
• SHaSaM: Submodular Hard Sample Mining for Fair Facial Attribute Recognition

  2026cites this paper
• Looking Beyond the Known: Towards a Data Discovery Guided Open-World Object Detection

  2025influential citation
• InSQuaD: In-Context Learning for Efficient Retrieval via Submodular Mutual Information to Enforce Quality and Diversity

  2025cites this paper
• Detecting changes without comparing images: Rules induced change detection in heterogeneous remote sensing images

  2025cites this paper
• Approximation algorithm of maximizing non-submodular functions under non-submodular constraint

  2025cites this paper
• Sum of Squares Submodularity

  2025cites this paper
• On Sparsest Cut and Conductance in Directed Polymatroidal Networks

  2024cites this paper
• Deep Submodular Peripteral Networks

  2024cites this paper
• SLIM: a Scalable and Interpretable Light-weight Fault Localization Algorithm for Imbalanced Data in Microservice

  2024cites this paper
• SLIM: A Scalable Light-Weight Root Cause Analysis for Imbalanced Data in Microservice

  2024cites this paper
• Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization

  2024cites this paper
• Locality Preservation for Unsupervised Multimodal Change Detection in Remote Sensing Imagery

  2024cites this paper
• SMILe: Leveraging Submodular Mutual Information For Robust Few-Shot Object Detection

  2024cites this paper
• COBRA: COmBinatorial Retrieval Augmentation for Few-Shot Adaptation

  2024influential citation
• Monotonic Decompositions of Submodular Set Functions

  2024cites this paper
• COBRA: COmBinatorial Retrieval Augmentation for Few-Shot Learning

  2024influential citation
• SCoRe: Submodular Combinatorial Representation Learning

  2023cites this paper
• Mixed-Integer Programming Approaches to Generalized Submodular Optimization and its Applications

  2023cites this paper
• Toward Highly Efficient and Private Submodular Maximization via Matrix-Based Acceleration

  2023cites this paper
• Maximizing submodular functions under submodular constraints

  2023cites this paper
• High Probability Bounds for Stochastic Continuous Submodular Maximization

  2023cites this paper
• Augmented Sparsifiers for Generalized Hypergraph Cuts

  2023cites this paper
• Parallel Submodular Function Minimization

  2023influential citation
• Mixed-Integer Programming for a Class of Robust Submodular Maximization Problems

  2023cites this paper
• Maximizing the Ratio of Monotone DR-Submodular Functions on Integer Lattice

  2023cites this paper
• Constrained Submodular Maximization via New Bounds for DR-Submodular Functions

  2023cites this paper
• Techniques and Algorithms for Hepatic Vessel Skeletonization in Medical Images: A Survey

  2022cites this paper
• Local search and swapping strategies. Challenging the greedy maximization of a polymatroid subject to a cardinality constraint

  2022cites this paper
• On Constrained Mixed-Integer DR-Submodular Minimization

  2022cites this paper
• Neural Estimation of Submodular Functions with Applications to Differentiable Subset Selection

  2022cites this paper
• Revisiting Online Submodular Minimization: Gap-Dependent Regret Bounds, Best of Both Worlds and Adversarial Robustness

  2022cites this paper
• A new performance bound for submodular maximization problems and its application to multi-agent optimal coverage problems

  2022cites this paper
• Learning Interpretable Decision Rule Sets: A Submodular Optimization Approach

  2022cites this paper
• Submodlib: A Submodular Optimization Library

  2022cites this paper
• On Maximizing Sums of Non-monotone Submodular and Linear Functions

  2022cites this paper
• RCD-SGD: Resource-Constrained Distributed SGD in Heterogeneous Environment Via Submodular Partitioning

  2022cites this paper
• Scalable Projection-Free Optimization

  2021cites this paper
• Approximate Decomposable Submodular Function Minimization for Cardinality-Based Components

  2021cites this paper
• Stochastic L (cid:92) -convex Function Minimization

  2021cites this paper
• Constrained Robust Submodular Partitioning

  2021cites this paper
• Local search and swapping strategies. Challenging the greedy outcome for the maximization of a polymatroid subject to a cardinality constraint

  2021cites this paper
• Streaming Algorithm for Submodular Cover Problem Under Noise

  2021cites this paper
• Accelerated Message Passing for Entropy-Regularized MAP Inference

  2020cites this paper
• Augmented Sparsifiers for Generalized Hypergraph Cuts

  2020cites this paper
• Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint

  2020cites this paper
• Maximizing Submodular or Monotone Functions under Partition Matroid Constraints by Multi-objective Evolutionary Algorithms

  2020cites this paper
• A Parameterized Family of Meta-Submodular Functions

  2020cites this paper
• Submodular Combinatorial Information Measures with Applications in Machine Learning

  2020cites this paper
• A survey of recent interactive image segmentation methods

  2020cites this paper
• A general method of active friending in different diffusion models in social networks

  2020cites this paper
• Batch greedy maximization of non-submodular functions: Guarantees and applications to experimental design

  2020influential citation
• Variational Optimization for the Submodular Maximum Coverage Problem

  2020cites this paper
• Submodular Maximization in Clean Linear Time

  2020cites this paper
• TEASER: Fast and Certifiable Point Cloud Registration

  2020cites this paper
• Robust random walk for leaf segmentation

  2020cites this paper
• Contour Integration using Graph-Cut and Non-Classical Receptive Field

  2020cites this paper
• Concave Aspects of Submodular Functions

  2020cites this paper
• A lower bound for parallel submodular minimization

  2020cites this paper
• Robust Submodular Minimization with Applications to Cooperative Modeling

  2020cites this paper
• Parallelized Maximization of Nonsubmodular Function Subject to a Cardinality Constraint

  2020cites this paper
• VesselNet: A deep convolutional neural network with multi pathways for robust hepatic vessel segmentation

  2019cites this paper
• Submodular Optimization-based Diverse Paraphrasing and its Effectiveness in Data Augmentation

  2019cites this paper
• Black Box Submodular Maximization: Discrete and Continuous Settings

  2019cites this paper
• A Unified Framework of Robust Submodular Optimization

  2019influential citation
• Submodular Generalized Matching for Peptide Identification in Tandem Mass Spectrometry

  2019cites this paper
• Multivariate Submodular Optimization (paper full version)

  2019cites this paper
• Beyond Submodular Maximization

  2019cites this paper
• Submodular Maximization Beyond Non-negativity: Guarantees, Fast Algorithms, and Applications

  2019cites this paper
• 09 21 6 v 1 [ cs . D S ] 1 9 A pr 2 01 9 Beyond Submodular Maximization

  2019cites this paper
• Tensor-cut: A tensor-based graph-cut blood vessel segmentation method and its application to renal artery segmentation

  2019cites this paper
• Multiobjective Evolutionary Algorithms Are Still Good: Maximizing Monotone Approximately Submodular Minus Modular Functions

  2019cites this paper
• Resurrecting Submodularity in Neural Abstractive Summarization

  2019cites this paper
• A Review of Recent Advances in Image Co-Segmentation Techniques

  2019cites this paper
• Resurrecting Submodularity for Neural Text Generation

  2019cites this paper
• Batched Stochastic Bayesian Optimization via Combinatorial Constraints Design

  2019cites this paper
• Fixing Mini-batch Sequences with Hierarchical Robust Partitioning

  2019cites this paper
• Subadditive Load Balancing

  2019cites this paper
• Differentially Private Online Submodular Minimization

  2019cites this paper
• Data Sampling for Graph Based Unsupervised Learning: Convex and Greedy Optimization

  2019cites this paper
• Submodular Function Minimization with Noisy Evaluation Oracle

  2019cites this paper
• Coresets for Estimating Means and Mean Square Error with Limited Greedy Samples

  2019cites this paper
• Approximating Robust Parameterized Submodular Function Maximization in Large-Scales

  2019cites this paper
• Near Optimal Algorithms for Hard Submodular Programs with Discounted Cooperative Costs

  2019influential citation
• Joint Radio Resource Allocation and SIC Ordering in NOMA-Based Networks Using Submodularity and Matching Theory

  2019cites this paper
• A Memoization Framework for Scaling Submodular Optimization to Large Scale Problems

  2019influential citation
• Discrete Sampling using Semigradient-based Product Mixtures

  2018cites this paper
• EACHING WITH D ESIRABLE D IFFICULTIES AND S CHEDULED D IVERSITY

  2018cites this paper
• SCHEDULED DIVERSITY

  2018cites this paper
• Greed is Still Good: Maximizing Monotone Submodular+Supermodular Functions

  2018cites this paper
• Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints

  2018cites this paper
• Submodular Maximization via Gradient Ascent: The Case of Deep Submodular Functions

  2018cites this paper
• Multi-pathways CNN for robust vascular segmentation

  2018cites this paper
• Dissimilarity-constrained node attribute coverage diversification for novelty-enhanced top-k search in large attributed networks

  2018cites this paper
• A Simple and Effective Approach for Transmit Antenna Selection in Multiuser Massive MIMO Leveraging Submodularity

  2018cites this paper
• Optimization for Approximate Submodularity

  2018cites this paper
• Differentially Private Online Submodular Optimization

  2018cites this paper
• Accelerated Inference in Markov Random Fields via Smooth Riemannian Optimization

  2018cites this paper
• Submodular Sparse Sensing for Gaussian Detection With Correlated Observations

  2017cites this paper
• A Nearly-linear Time Algorithm for Submodular Maximization with a Knapsack Constraint

  2017cites this paper