Research map / Learning theory and algorithms / Combinatorial and search optimization
Review of Serial and Parallel Min-Cut/Max-Flow Algorithms for Computer Vision
Patrick M. Jensen, Niels Jeppesen, Anders Bjorholm Dahl, Vedrana Andersen Dahl
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use HPF or EIBFS instead of BK | BK · 4Dpipe_small | total time: over 6 hours -> less than 30 seconds | Improved |
| use EIBFS-I instead of HI-PR | HI-PR · vessel.orimrf.900 | total time: 1774.65 s -> 88.09 s | Improved |
| use GridCut instead of EIBFS-I-NR on grid graphs | EIBFS-I-NR · vessel.orimrf.900 | total time: 88.09 s -> 44.70 s | Improved |
| use HPF instead of EIBFS | EIBFS · oriented MRF and U-Net cleaning | total time: clean.orimrf.900: 64.22 s -> 280.73 s | Hurt |
| use HPF instead of EIBFS | EIBFS · graph_1 (s) (ALE) | total time: 0.79 s -> 1.60 s | Hurt |
| use HPF instead of EIBFS-I | EIBFS-I · NT32_tomo3_.raw_100 | total time: 627.08 s -> 583.76 s | Improved |
| use EIBFS-I instead of MBK-R | MBK-R · BL06-camel-lrg | total time: 111.42 s -> 31.54 s | Improved |
| compare EIBFS and HPF on median relative times | EIBFS vs HPF · all datasets | relative solve and total time | Mixed |
| use HI-PR instead of other serial algorithms | HI-PR · all datasets | relative total time | Hurt |
Closest papers by meaning
- Filter Flow Made Practical: Massively Parallel and Lock-Free (CVPR 2017 · similarity 0.86)
- Faster Multi-Object Segmentation Using Parallel Quadratic Pseudo-Boolean Optimization (ICCV 2021 · similarity 0.85)
- A Comparative Study of Graph Matching Algorithms in Computer Vision (ECCV 2022 · similarity 0.85)
- RAMA: A Rapid Multicut Algorithm on GPU (CVPR 2022 · similarity 0.85)
- A Stream Algebra for Performance Optimization of Large Scale Computer Vision Pipelines (TPAMI 2020 · similarity 0.85)
- Accelerating Non-Maximum Suppression: A Graph Theory Perspective (NeurIPS 2024 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
