.png){kind=icon}
返回
Robust stereo matching using adaptive random walk with restart algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.imavis.2015.01.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we propose a robust dense stereo reconstruction algorithm using a random walk with restart. The pixel-wise matching costs are aggregated into superpixels and the modified random walk with restart algorithm updates the matching cost for all possible disparities between the superpixels. In comparison to the majority of existing stereo methods using the graph cut, belief propagation, or semi-global matching, our proposed method computes the final reconstruction through the determination of the best disparity at each pixel in the matching cost update. In addition, our method also considers occlusion and depth discontinuities through the visibility and fidelity terms. These terms assist in the cost update procedure in the calculation of the standard smoothness constraint. The method results in minimal computational costs while achieving high accuracy in the reconstruction. We test our method on standard benchmark datasets and challenging real-world sequences. We also show that the processing time increases linearly in relation to an increase in the disparity search range. (C) 2015 Elsevier B.V. All rights reserved.
Keyword:
Global optimization
Random walk with restart
Stereo matching
Superpixels
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.2
论文数:
4.1K
被引数:
6.7K
机构
引用论文
分享收藏分享收藏The effect of spin dilution on magnetism of the linear chain system β-Cu2−x Zn x V2O7自旋稀释对线性链体系 β-cu2-x Zn x V2O7磁性的影响.png)
Pramana
PramanaIF0
PREAI
分享收藏
没有更多内容
没有更多内容