Parallel and Distributed Graph Cuts by Dual Decomposition thumbnail
Pause
Mute
Subtitles not available
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Parallel and Distributed Graph Cuts by Dual Decomposition

Published on Jul 19, 20105386 Views

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

Related categories