The Implementation of Parallel Speed up Stereo Matching Based on Reduced Graph Cuts

Abstract:

The Many stereo matching problems can be converted to energy minimization problem, by establishment of special network graph to obtain the minimum graph cut, and then obtaining the optimal solution. For graph cuts algorithm, complete network graph include all vertices and disparity edges, the computation of time and space is huge. In this paper, we put forward a method by combing local and global stereo matching, set up a reduced network graph by the possible disparities values for each pixel, and then global optimization, to slove the maximum flow polynomial through CUDA parallel computing, greatly reduced the consumption of time and space.

• Periodical: Applied Mechanics and Materials (Volumes 631-632)
• Pages: 486-489
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.631-632.486
• Online since: September 2014
• Authors: Ping Zhou*, Mei Liu
• Keywords: CUDA, Disparity Map, Graph Cuts, Stereo Matching

References

[1] Scharstein D, Szeliski R. A taxonomy and evaluation of dense two-frame stereo correspondence algorithms[J]. International Journal of Computer Vision, 2002, 47(1/2/3) 7-42.

DOI: 10.1109/smbv.2001.988771

[2] Boykov Y, Veksler O, Zabih R. Fast approximate energy mininization via graph cuts[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2001, 23(11): 1222-1239.

DOI: 10.1109/34.969114

[3] Kolmogorov V, Zabih R. Computing visual correspondence with occlusions using graph cuts[C]. 8th InternationalConference on Computer Vision. Washington, DC: IEEE Computer Society, 2001: 508-515.

DOI: 10.1109/iccv.2001.937668

[4] Szeliski R, Zabih R, Scharstein D, et al. A comparative study of energy minimization methods for Markov random fields with smoothness based priors[ J]. IEEE Transact ion s on Pattern Analysis and M ach in e Intelligence, 2008, 30 (6): 1068- 1080.

DOI: 10.1109/tpami.2007.70844

[5] Boykov Y, Kolmogorov V. An experimental comparison of min-cut/max-how algorithms for energy minimization in vision[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2004, 26(9) 1124-1137.

DOI: 10.1109/tpami.2004.60

[6] Hong L, Chen G. Segment-based stereo matching using graph cuts[C]/IEEE Computer Society Conference on Computer Vision and Pattern Recognition. Piscataway, NJ, USA IEEE, 2004 74-81.

DOI: 10.1109/cvpr.2004.1315016

[7] Deng Y, Yang G, Lin X Y, et al. Stereo correspondence with occlusion handling in a symmetric patch-based graph-cuts model[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2007, 29(6) 1068-1079.

DOI: 10.1109/tpami.2007.1043

[8] Middlebury stereo website [ EB /OL ]. [ 2010 - 02 - 20 ] . http: / /www. middlebury. edu / stereo.

[9] Greig D, Porteous B, Seheult A. Exact maximum a-posteriori estimation for binary images[J]. Journal of the Royal Statistical Society, Series B, 1989, 51(2) 271-279.

DOI: 10.1111/j.2517-6161.1989.tb01764.x

[10] Roy S, Cox I J. A maximum f low formulation of the n-camera stereo correspondence problem [C ] / / 6th International Conference on Computer Vision. Washington, DC: IEEE Computer Society, 1998: 492.

DOI: 10.1109/iccv.1998.710763

[11] Vineet V, Narayanan P J．Cuda Cuts: Fast Graph Cuts on the GPU[C]∥CVPR Workshop on Visual Computer Vision on GPUs．2008).

DOI: 10.1109/cvprw.2008.4563095