Robust stereo matching using adaptive random walk with restart algorithm

Title
Robust stereo matching using adaptive random walk with restart algorithm
Authors
임종우
Keywords
Global optimization; Random walk with restart; Stereo matching; Superpixels
Issue Date
2015-05
Publisher
ELSEVIER SCIENCE BV
Citation
IMAGE AND VISION COMPUTING, v. 37, Page. 1-11
Abstract
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.
URI
http://www.sciencedirect.com/science/article/pii/S0262885615000104http://hdl.handle.net/20.500.11754/24752
ISSN
0262-8856; 1872-8138
DOI
http://dx.doi.org/10.1016/j.imavis.2015.01.003
Appears in Collections:
COLLEGE OF ENGINEERING[S](공과대학) > COMPUTER SCIENCE AND ENGINEERING(컴퓨터공학부) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE