[2] NGUYEN H T.Image-based rendering with depth Information using the propagation algorithm[C].Proceedings of Acoustics,Speech,and Signal Processing,2005,2(3):589-592

[6] 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

[7] HONG L,CHEN G.Segment-based stereo matching using graph cuts[C].IEEE Computer Society Conference on Computer Vision and Pattern Recognition,2004,(1):74-81

[8] BLEYER M,GELAUTZ M.Graph-cut-based stereo matching using Image segmentation with symmetrical treatment of occlusions[J].Signal Processing:Image Communication,Special Issue on Three-Dimensional Video and Television,2007,22(2):127-143

[9] FORSTMANN S,OHYA J,KANOU Y.Real-time stereo by using dynamic programming[J].CVPR,2004,3(7):29-37

[10] KOLMOGOROV V,ZABIN R.Multi-camera scene reconstruction via graph cuts[C].European Conference on Computer Vision,2002,(3):82-96

[11] KOLMOGOROV V,ZABIH R.Computing visual correspondence with occlusions using graph cuts[C].International Conference on Computer Vision,2001,(2):508-515

[12] BOYKOV Y,KOLMOGOROV V.An experimental comparison of min-cut/max-flow algorithms for energy minimization in computer vision[J].Third International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition,2004,26(9):1124-1137

[13] BOYKOV Y,VEKSLER O,ZABIH R.Fast approximate energy minimization via graph cuts[J].PAMI,2001,23(11):1222-1239