图 书 馆
双重分解的并行和分布式图切割Parallel and Distributed Graph Cuts by Dual Decomposition |
|
| 课程网址: | http://videolectures.net/cvpr2010_strandmark_pdgc/ |
| 主讲教师: | Petter Strandmark |
| 开课单位: | 隆德大学 |
| 开课时间: | 2010-07-19 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | 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/minimum cut problem in parallel by splitting the graph into multiple parts and hence, further increase the computational efficacy of graph cuts. Optimality of the solution is guaranteed by dual decomposition, or more specifically, the solutions to the subproblems are constrained to be equal on the overlap with dual variables. We demonstrate that our approach both allows (i) faster processing on multi-core computers and (ii) the capability to handle larger problems by splitting the graph across multiple computers on a distributed network. Even though our approach does not give a theoretical guarantee of speedup, an extensive empirical evaluation on several applications with many different data sets consistently shows good performance. An open source implementation of the dual decomposition method is also made publicly available. |
| 关 键 词: | 图形切割方法; 计算机视觉; 双重分解 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2019-03-13：lxf |
| 阅读次数: | 48 |