An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision
After [15], [31], [19], [8], [25], [5], minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision. The combinatorial optimization literature provides many min-cut/max-flow algorithms with different polynomial...
| Veröffentlicht in: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 26(2004), 9 vom: 15. Sept., Seite 1124-37 |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | |
| Format: | Aufsatz |
| Sprache: | English |
| Veröffentlicht: |
2004
|
| Zugriff auf das übergeordnete Werk: | IEEE transactions on pattern analysis and machine intelligence |
| Schlagworte: | Evaluation Study Journal Article |