An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision.¶
Boykov, Y., & Kolmogorov, V. (2004). An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(9), 1124-1137.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Network Flow Models
- In image processing and computer vision, network-flow (particularly max-flow / graph cuts) supports image segmentation and stereo-vision, with the canonical Boykov and Kolmogorov (2004) algorithm enabling efficient graph-cut-based vision algorithms.
This sourceCanonical max-flow / graph-cut algorithm widely used for image segmentation and stereo vision.
- In image processing and computer vision, network-flow (particularly max-flow / graph cuts) supports image segmentation and stereo-vision, with the canonical Boykov and Kolmogorov (2004) algorithm enabling efficient graph-cut-based vision algorithms.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:323f279dda14 · see in the full table