Abstract
The current mainstream method for stereo vision is to find corresponding points of two-dimensional images obtained from multiple cameras and restore three-dimensional information using the principle of triangulation. However, the occlusion problem often makes it difficult to search for corresponding points. Therefore, a new approach has been proposed in which the three-dimensional space is directly considered as a three-dimensional graph instead of searching for corresponding points of two images. In this approach, a 3D grid graph is constructed based on luminance values obtained from the left and right cameras, and a highly likely object surface is obtained by cutting this graph. This paper proposes a pipelined architecture for 3D grid graph cut, aiming at a real-time stereo vision system. The system uses Wave-Front-Fetch algorithm, which is oriented for parallel processing. We achieved processing time of about 21 ms for a graph of \(129 \times 129 \times 16\) nodes, resulting in a frame rate of about 49 fps. Our approach was about 19 times faster than a well-known graph cut software library.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Trans. Pattern Anal. Mach. Intell. 26(9), 1124–1137 (2004)
Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM (JACM) 35(4), 921–940 (1988)
Kamasaka, R., Shibata, Y., Oguri, K.: FPGA implementation of a graph cut algorithm for stereo vision. In: Proceedings of International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies (HEART), pp. 14:1–14:6 (2017)
Kamasaka, R., Shibata, Y., Oguri, K.: An FPGA-oriented graph cut algorithm for accelerating stereo vision. In: Proceedings of International Conference on Reconfigurable Computing and FPGAs (ReConFig) (2018)
Kobori, D., Maruyama, T.: An acceleration of a graph cut segmentation with FPGA. In: Proceedings of International Conference on Field Programmable Logic and Applications (FPL), pp. 407–413 (2012)
Oguri, K., Shibata, Y.: A new stereo formulation not using pixel and disparity models. arXiv:1803.01516 [cs.CV] (2018)
Smith, B.M., Zhang, L., Jin, H.: Stereo matching with nonparametric smoothness priors in feature space. In: Proceedings of IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 485–492 (2009)
Woodford, O., Torr, P., Reid, I., Fitzgibbon, A.: Global stereo reconstruction under second-order smoothness priors. IEEE Trans. Pattern Anal. Mach. Intell. 31(12), 2115–2128 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Yoshinaga, N., Kamasaka, R., Shibata, Y., Oguri, K. (2020). Pipelined FPGA Implementation of a Wave-Front-Fetch Graph Cut System. In: Barolli, L., Hussain, F., Ikeda, M. (eds) Complex, Intelligent, and Software Intensive Systems. CISIS 2019. Advances in Intelligent Systems and Computing, vol 993. Springer, Cham. https://doi.org/10.1007/978-3-030-22354-0_38
Download citation
DOI: https://doi.org/10.1007/978-3-030-22354-0_38
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-22353-3
Online ISBN: 978-3-030-22354-0
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)