.png){kind=icon}
Return
Stereo matching algorithm with guided filter and modified dynamic programming
.png){kind=icon}
PRE
AI
DOI：10.1007/s11042-015-3023-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Dense stereo correspondence is a challenging research problem in computer vision field. To address the poor accuracy behavior of stereo matching, we propose a novel stereo matching algorithm based on guided image filter and modified dynamic programming. Firstly, we suggest a combined matching cost by incorporating the absolute difference and improved color census transform (ICCT). Secondly, we use the guided image filter to filter the cost volume, which can aggregate the costs fast and efficiently. Then, in the disparity computing step, we design a modified dynamic programming algorithm, which can weaken the scanning line effect. At last, final disparity maps are gained after post-processing. The experimental results are evaluated on Middlebury Stereo Datasets, showing that our approach can achieve good results both in low texture and depth discontinuity areas with an average error rate of 5.14 % and strong robustness.
Keywords:
Stereo matching
Census transform
Guided image filter
Dynamic programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3
Papers:
1.9W
Citations:
3.2W
Organization
Cited Papers
The Influence of Deforestation on Land Surface Temperature—A Case Study of Perak and Kedah, Malaysia.png)
Forests
OAAI
ForestsIF0
OAAIShareSave
ShareSaveGraph-cut-based stereo matching using image segmentation with symmetrical treatment of occlusions
PREAI
ShareSave
View more