Segment-Tree Stereo Matching Algorithm Based on Improved Matching Costs.
Gespeichert in:
| Titel: | Segment-Tree Stereo Matching Algorithm Based on Improved Matching Costs. |
|---|---|
| Autoren: | Cheng Han1 hancheng@cust.edu.cn, Shiyu Lu1 rain20500@126.com, Longbin Jin1 785120668@qq.com, Shan Jiang, Hua Li |
| Quelle: | IAENG International Journal of Computer Science. Sep2020, Vol. 47 Issue 3, p550-556. 7p. |
| Schlagwörter: | Algorithms, Stereo vision (Computer science), Computational complexity, Cost, Parallax |
| Abstract: | Matching cost aggregation is one of the oldest and still popular methods for stereo correspondence. While effective and efficient, cost aggregation methods typically aggregate the matching cost by summing/averaging over a user-specified, local support region. This is obviously only locally-optimal, and the computational complexity of the full-kernel implementation usually depends on the region size. In order to improve aggregation accuracy, we propose a segment-tree stereo matching method with improved matching costs. A reasonable weight for the matching process is assigned by introducing color and gradient multi-dimensional information components in order to overcome inaccuracies of weak texture regions. Next, similar regions are merged, whereby pixel points belonging to the same parallax consistency are merged with the corresponding generation tree. Finally, depth and color information are used for the tree reconstruction, while a color-depth weight is adopted in order to enhance the structure of the tree. Performance evaluation on 19 Middlebury data sets shows that the proposed method is comparable to previous state-of-the-art aggregation methods in disparity accuracy and processing speed. [ABSTRACT FROM AUTHOR] |
| Datenbank: | Supplemental Index |
Full Text Finder 
Nájsť tento článok vo Web of Science Schreiben Sie den ersten Kommentar!