An Improved Stereo Matching Algorithm with Robustness to Noise Based on Adaptive Support Weight
2
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
An active research area in computer vision, stereo matching is aimed at obtaining three-dimensional (3D) information from a stereo image pair captured by a stereo camera. To extract accurate 3D information, a number of studies have examined stereo matching algorithms that employ adaptive support weight. Among them, the adaptive census transform (ACT) algorithm has yielded a relatively strong matching capability. The drawbacks of the ACT, however, are that it produces low matching accuracy at the border of an object and is vulnerable to noise. To mitigate these drawbacks, this paper proposes and analyzes the features of an improved stereo matching algorithm that not only enhances matching accuracy but also is also robust to noise. The proposed algorithm, based on the ACT, adopts the truncated absolute difference and the multiple sparse windows method. The experimental results show that compared to the ACT, the proposed algorithm reduces the average error rate of depth maps on Middlebury dataset images by as much as 2% and that is has a strong robustness to noise.
Abstract
An active research area in computer vision, stereo matching is aimed at obtaining three-dimensional (3D) information from a stereo image pair captured by a stereo camera. To extract accurate 3D information, a number of studies have examined stereo matching algorithms that employ adaptive support weight. Among them, the adaptive census transform (ACT) algorithm has yielded a relatively strong matching capability. The drawbacks of the ACT, however, are that it produces low matching accuracy at the border of an object and is vulnerable to noise. To mitigate these drawbacks, this paper proposes and analyzes the features of an improved stereo matching algorithm that not only enhances matching accuracy but also is also robust to noise. The proposed algorithm, based on the ACT, adopts the truncated absolute difference and the multiple sparse windows method. The experimental results show that compared to the ACT, the proposed algorithm reduces the average error rate of depth maps on Middlebury dataset images by as much as 2% and that is has a strong robustness to noise.
참고문헌 (16)
- K. Sabe, "Obstacle avoidance and path planning for humanoid robots using stereo vision", Proceedings of the 2004 IEEE International Conference on Robotics & Automation, pp.592~597 (2004)
- K. Huh, "A stereo vision-based obstacle detection system in vehicles", Optics and Lasers in Engineering, 46(2), pp.168~178 (2008)
- Chilian, "Stereo camera based navigation of mobile robots on rough terrain", Proceedings of the 2009 IEEE, 2009, 4571~4576
- D. Scharstein, "A taxonomy and evaluation of dense two-frame stereo correspondence algorithms", International Journal of Computer Vision, 47(1), pp.7~42 (2002)
- N. Lazaros, "Review of stereo vision algorithms : from software to hardware", International Journal of Optomechatronics, 2(4), pp.435~462 (2008)
- R. Zabih, "Non-parametric local transforms for computing visual correspondence", Proceedings of 3rd European Conference on Computer Vision, pp.151~158 (1994)
- X. Luan, "A robust Local Census-based Stereo matching insensitive to Illumination changes", Proceedings of the 2012 International Conference on Information and Automation, pp.801~805 (2012)
- K. J. Yoon, "Adaptive support-weight approach for correspondence search", IEEE Transactions on Pattern Analysis and Machine Intelligence, 28(4), pp.650~656 (2006)
- Hosni, M. Bleyer, "Secrets of adaptive support weight techniques for local stereo matching", Computer Vision and Image Understanding, 117(6), pp.620~632 (2013)
- S. Perri, "Adaptive census transform: a novel hardware-oriented stereovision algorithm", Computer Vision and Image Understanding, 117(1), pp.29~41 (2013)
- K. J. Yoon, "Locally adaptive support-weight approach for visual correspondence search", Proceedings of 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp.924~931 (2005)
- Lee, "Stereo matching algorithm using TAD-adaptive census transform based on multi sparse windows", Proceedings of the 2015 Fall Conference of the Korea Information Processing Society, pp.1559~1562 (2015)
- R. Bae, "A census-based stereo matching algorithm with multiple sparse windows", Proceedings of the 7th International Conference on Ubiquitous and Future Networks, pp.240~245 (2015)
- G. Wyszecki, "Color Science: Concepts and Methods Quantitative Data and Formulae" (1982), Wiley
- C. Rhemann, "Fast cost-volume filtering for visual correspondence and beyond", Proceedings of 2011 IEEE Conference on Computer Vision and Pattern Recognition, pp.3017~3024 (2011)
- "Middlebury Stereo Vision"[URL]