An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision
Pourquoi ce travail est-il dans la base ?
Une base qui oublie comment elle a trouvé un travail ne peut pas être vérifiée. Voici les voies qui ont admis celui-ci.
Résumé
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 time complexity. Their practical efficiency, however, has to date been studied mainly outside the scope of computer vision. The goal of this paper is to provide an experimental comparison of the efficiency of min-cut/max flow algorithms for applications in vision. We compare the running times of several standard algorithms, as well as a new algorithm that we have recently developed. The algorithms we study include both Goldberg-Tarjan style "push-relabel" methods and algorithms based on Ford-Fulkerson style "augmenting paths." We benchmark these algorithms on a number of typical graphs in the contexts of image restoration, stereo, and segmentation. In many cases, our new algorithm works several times faster than any of the other methods, making near real-time performance possible. An implementation of our max-flow/min-cut algorithm is available upon request for research purposes.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
La notice
- Revue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Thématique
- Advanced Neural Network Applications
- Domaine
- Computer Science
- Établissements canadiens
- Western University
- Organismes subventionnaires
- University of Tsukuba
- Mots-clés
- AlgorithmComputer scienceMaximum flow problemMinimum cutBenchmark (surveying)Maximum cutMinificationTime complexityImage segmentationSegmentationRunning timeCutEnergy minimizationArtificial intelligenceGraphMathematicsTheoretical computer scienceMathematical optimization
- Résumé présent dans OpenAlex
- oui