On the public citation graph

A Message Passing Algorithm for the Minimum Cost Multicut Problem

0 signed · 56 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-319-17876-9_4openalex-snapshot
Parallel Multicut Segmentation via Dual Decomposition
inferredcites →https://doi.org/10.1007/978-3-642-04295-9openalex-snapshot
Geometry of Cuts and Metrics
inferredcites →https://doi.org/10.1007/978-3-642-23094-3_3openalex-snapshot
Globally Optimal Image Partitioning by Multicuts
inferredcites →https://doi.org/10.1007/978-3-642-33712-3_56openalex-snapshot
Globally Optimal Closed-Surface Segmentation for Connectomics
inferredcites →https://doi.org/10.1007/978-3-642-33783-3_41openalex-snapshot
Fast Planar Correlation Clustering for Image Segmentation
inferredcites →https://doi.org/10.1007/978-3-642-39140-8_9openalex-snapshot
Break and Conquer: Efficient Correlation Clustering for Image Segmentation
inferredcites →https://doi.org/10.1007/978-3-642-40395-8_20openalex-snapshot
Segmenting Planar Superpixel Adjacency Graphs w.r.t. Non-planar Superpixel Affinity Graphs
inferredcites →https://doi.org/10.1007/bf01581239openalex-snapshot
The partition problem
inferredcites →https://doi.org/10.1007/s11263-015-0809-xopenalex-snapshot
A Comparative Study of Modern Inference Techniques for Structured Discrete Energy Minimization Problems
inferredcites →https://doi.org/10.1016/j.cviu.2015.11.005openalex-snapshot
Higher-order segmentation via multicuts
inferredcites →https://doi.org/10.1016/j.tcs.2006.05.008openalex-snapshot
Correlation clustering in general weighted graphs
inferredcites →https://doi.org/10.1023/b:mach.0000033116.57574.95openalex-snapshot
Correlation Clustering
inferredcites →https://doi.org/10.1038/nmeth.4151openalex-snapshot
Multicut brings automated neurite segmentation closer to human performance
inferredcites →https://doi.org/10.1051/ro/1987210403071openalex-snapshot
Lagrangean decomposition for integer programming : theory and applications
inferredcites →https://doi.org/10.1109/cvpr.2014.17openalex-snapshot
Cut, Glue, & Cut: A Fast, Approximate Solver for Multicut Partitioning
inferredcites →https://doi.org/10.1109/cvpr.2015.7298973openalex-snapshot
Fusion moves for correlation clustering
inferredcites →https://doi.org/10.1109/cvpr.2016.638openalex-snapshot
Moral Lineage Tracing
inferredcites →https://doi.org/10.1109/cvpr.2017.526openalex-snapshot
A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems
inferredcites →https://doi.org/10.1109/cvpr.2017.774openalex-snapshot
InstanceCut: From Edges to Instances with MultiCut
inferredcites →https://doi.org/10.1109/iccv.2001.937655openalex-snapshot
A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics
inferredcites →https://doi.org/10.1109/iccv.2011.6126550openalex-snapshot
Probabilistic image segmentation with closedness constraints
inferredcites →https://doi.org/10.1109/iccv.2015.204openalex-snapshot
Efficient Decomposition of Image and Mesh Graphs by Lifted Multicuts
inferredcites →https://doi.org/10.1109/icde.2009.43openalex-snapshot
Large-Scale Deduplication with Constraints Using Dedupalog
inferredcites →https://doi.org/10.1109/tpami.2006.200openalex-snapshot
Convergent Tree-Reweighted Message Passing for Energy Minimization
inferredcites →https://doi.org/10.1109/tpami.2014.2363465openalex-snapshot
A New Look at Reweighted Message Passing
inferredcites →https://doi.org/10.1145/1217299.1217303openalex-snapshot
Clustering aggregation
inferredcites →https://doi.org/10.1145/1553374.1553473openalex-snapshot
Solution stability in linear programming relaxations
inferredcites →https://doi.org/10.1145/1772690.1772776openalex-snapshot
Clustering query refinements by user intent
inferredcites →https://doi.org/10.1145/2623330.2623743openalex-snapshot
Correlation clustering in MapReduce
inferredcites →https://doi.org/10.1162/089120101753342653openalex-snapshot
A Machine Learning Approach to Coreference Resolution of Noun Phrases
inferredcites →https://doi.org/10.1561/2200000001openalex-snapshot
Graphical Models, Exponential Families, and Variational Inference
inferredcites →https://doi.org/10.1561/9781601981851openalex-snapshot
Graphical Models, Exponential Families, and Variational Inference
inferredcites →https://doi.org/10.1609/aaai.v27i1.8653openalex-snapshot
Optimal Coalition Structure Generation in Cooperative Graph Games
inferredcites →https://doi.org/10.3115/1073083.1073102openalex-snapshot
Improving machine learning approaches to coreference resolution
inferredcites →https://doi.org/10.3115/1611638.1611641openalex-snapshot
Bounding and comparing methods for correlation clustering beyond ILP
inferredcites →https://doi.org/10.48550/arxiv.1210.4902openalex-snapshot
Efficiently Searching for Frustrated Cycles in MAP Inference
inferredcites →https://doi.org/10.48550/arxiv.1210.7070openalex-snapshot
A Multiscale Framework for Challenging Discrete Optimization

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-031-16788-1_12openalex-snapshot
Optimizing Edge Detection for Image Segmentation with Multicut Penalties
inferred← citeshttps://doi.org/10.1007/978-3-031-26390-3_28openalex-snapshot
Learning to Solve Minimum Cost Multicuts Efficiently Using Edge-Weighted Graph Convolutional Neural Networks
inferred← citeshttps://doi.org/10.1080/0951192x.2024.2387767openalex-snapshot
A data-driven approach for volume feature recognition based on cell graph
inferred← citeshttps://doi.org/10.1109/cvpr.2017.526openalex-snapshot
A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems
inferred← citeshttps://doi.org/10.1109/cvpr.2018.00174openalex-snapshot
Discrete-Continuous ADMM for Transductive Inference in Higher-Order MRFs
inferred← citeshttps://doi.org/10.1109/cvpr52688.2022.00053openalex-snapshot
FastDOG: Fast Discrete Optimization on GPU
inferred← citeshttps://doi.org/10.1109/cvpr52688.2022.00802openalex-snapshot
RAMA: A Rapid Multicut Algorithm on GPU
inferred← citeshttps://doi.org/10.1109/iccv.2019.01019openalex-snapshot
End-to-End Learning for Graph Decomposition
inferred← citeshttps://doi.org/10.1109/iccvw.2017.7openalex-snapshot
Solving Large Multicut Problems for Connectomics via Domain Decomposition
inferred← citeshttps://doi.org/10.1109/ismar-adjunct.2017.64openalex-snapshot
[POSTER] Position Estimation of a Strongly Occluded Object by Using an Auxiliary Point Cloud in Occluded Space
inferred← citeshttps://doi.org/10.1109/mlhpcai4s51975.2020.00009openalex-snapshot
A Benders Decomposition Approach to Correlation Clustering
inferred← citeshttps://doi.org/10.1109/tnnls.2024.3443413openalex-snapshot
Deep Graph Reinforcement Learning for Solving Multicut Problem
inferred← citeshttps://doi.org/10.1109/tpami.2018.2876253openalex-snapshot
Motion Segmentation & Multiple Object Tracking by Correlation Co-Clustering
inferred← citeshttps://doi.org/10.1137/18m1217152openalex-snapshot
Metric-Constrained Optimization for Graph Clustering Algorithms
inferred← citeshttps://doi.org/10.1145/3711896.3737114openalex-snapshot
S3GA: Towards Scalable Self-Supervised Learning for Large Scale Graph Alignment
inferred← citeshttps://doi.org/10.3929/ethz-b-000384576openalex-snapshot
End-to-end Learning for Graph Decomposition
inferred← citeshttps://doi.org/10.48550/arxiv.1902.05659openalex-snapshot
Massively Parallel Benders Decomposition for Correlation Clustering
inferred← citeshttps://doi.org/10.48550/arxiv.2009.00481openalex-snapshot
Efficient Message Passing for 0-1 ILPs with Binary Decision Diagrams
inferred← citeshttps://doi.org/10.48550/arxiv.2105.07469openalex-snapshot
Uncertainty in Minimum Cost Multicuts for Image and Motion Segmentation
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.