Parallel and Distributed Graph Cuts by Dual Decomposition

Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve the maximum flow/mi