摘要
In this paper, a new algorithm based on graph cuts to solve stereo matching problem is proposed. In the algorithm, the constructed graph for minimizing the energy function does not use any auxiliary nodes, therefore smaller graph can be constructed efficiently and the minimum cut can be computed faster. Experimental results demonstrated that satisfactory results can be computed efficiently by the proposed method.
| 源语言 | 英语 |
|---|---|
| 页（从-至） | 229-232 |
| 页数 | 4 |
| 期刊 | Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology |
| 卷 | 29 |
| 期 | 3 |
| 出版状态 | 已出版 - 3月 2009 |
指纹
探究 'A fast stereo matching method based on graph cuts' 的科研主题。它们共同构成独一无二的指纹。引用此
Pei, M. T., & Liu, P. (2009). A fast stereo matching method based on graph cuts. Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology, 29(3), 229-232.