Personal tools
You are here: Home Publications A distributed mincut/maxflow algorithm combining path augmentation and push-relabel
About NIFTi
NIFTi is about human-robot cooperation. About teams of robots and humans doing tasks together, interacting together to try and reach a shared goal. NIFTi looks at how the robot could bear the human in mind. Literally. When determining what to do or say next in human-robot interaction; when, and how. NIFTi puts the human factor into cognitive robots, and human-robot team interaction in particular.   Each year, NIFTi evaluates its systems together with several USAR organizations. Rescue personnel teams up with NIFTi robots to carry out realistic missions, in real-life training areas. 
Impressum

This site uses Google Analytics to record statistics on site visits - see Legal information.

 

A. Shekhovtsov and V. Hlavac (2011)

A distributed mincut/maxflow algorithm combining path augmentation and push-relabel

In: Proceedings of the 8th In- ternational Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition (EMMCVPR), vol. 6819, pp. 1-16, Springer Verlag. LNCS.

We present a novel distributed algorithm for the minimum s-t cut problem, suitable for solving large sparse instances. Assuming vertices of the graph are partitioned into several regions, the algorithm performs path augmentations inside the regions and updates of the push- relabel style between the regions. The interaction between regions is considered expensive (regions are loaded into the memory one-by-one or located on separate machines in a network). The algorithm works in sweeps, which are passes over all regions. Let B be the set of ver- tices incident to inter-region edges of the graph. We present a sequen- tial and parallel versions of the algorithm which terminate in at most 2|B|2 + 1 sweeps. The competing algorithm by Delong and Boykov uses push-relabel updates inside regions. In the case of a fixed partition we prove that this algorithm has a tight O(n2) bound on the number of sweeps, where n is the number of vertices. We tested sequential versions of the algorithms on instances of maxflow problems in computer vision. Experimentally, the number of sweeps required by the new algorithm is much lower than for the Delong and Boykov’s variant. Large problems (up to 108 vertices and 6 · 108 edges) are solved using under 1GB of memory in about 10 sweeps.
Document Actions