An FPGA-oriented Graph Cut Algorithm for Accelerating Stereo Vision
暂无分享,去创建一个
[1] Tsutomu Maruyama,et al. An acceleration of a graph cut segmentation with FPGA , 2012, 22nd International Conference on Field Programmable Logic and Applications (FPL).
[2] Hailin Jin,et al. Stereo matching with nonparametric smoothness priors in feature space , 2009, CVPR.
[3] Andrew W. Fitzgibbon,et al. Global stereo reconstruction under second order smoothness priors , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.
[4] Vladimir Kolmogorov,et al. An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision , 2004, IEEE Trans. Pattern Anal. Mach. Intell..
[5] Peter Elias,et al. A note on the maximum flow through a network , 1956, IRE Trans. Inf. Theory.
[6] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.
[7] P. J. Narayanan,et al. CUDA cuts: Fast graph cuts on the GPU , 2008, 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops.
[8] Yuichiro Shibata,et al. FPGA Implementation of A Graph Cut Algorithm For Stereo Vision , 2017, HEART.
[9] Yuichiro Shibata,et al. A new stereo formulation not using pixel and disparity models , 2018, ArXiv.