[1] Ma R H, Zhu F, Wu Q X et al. Dense stereo matching based on image segmentation[J]. Acta Optica Sinica, 39, 0315001(2019).

[2] Bleyer M, Rhemann C, Rother C. PatchMatch stereo-stereo matching with slanted support windows[C]∥Procedings of the British Machine Vision Conference 2011, August 29-September 1, 2011, Dundee., 14(2011).

[3] Barnes C, Shechtman E, Finkelstein A et al. PatchMatch: a randomized correspondence algorithm for structural image editing[J]. ACM Transactions on Graphics, 28, 24(2009). http://dl.acm.org/citation.cfm?id=1531330

[4] Luus R. Jaakola T H I. Optimization by direct search and systematic reduction of the size of search region[J]. AIChE Journal, 19, 760-766(1973). http://onlinelibrary.wiley.com/doi/10.1002/aic.690190413/full

[5] Besse F, Rother C, Fitzgibbon A et al. PMBP: PatchMatch belief propagation for correspondence field estimation[J]. International Journal of Computer Vision, 110, 2-13(2014). http://link.springer.com/article/10.1007/s11263-013-0653-9

[6] Lu J B, Yang H S, Min D B et al. Patch match filter: efficient edge-aware filtering meets randomized search for fast correspondence field estimation. [C]∥2013 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), June 23-28, 2013, Portland, OR, USA. New York: IEEE, 1854-1861(2013).

[7] Heise P, Klose S, Jensen B et al. PM-huber: PatchMatch with huber regularization for stereo matching. [C]∥2013 IEEE International Conference on Computer Vision (ICCV), December 1-8, 2013, Sydney, NSW, Australia. New York: IEEE, 2360-2367(2013).

[8] Li L C, Zhang S L, Yu X et al. PMSC: PatchMatch-based superpixel cut for accurate stereo matching[J]. IEEE Transactions on Circuits and Systems for Video Technology, 28, 679-692(2018). http://ieeexplore.ieee.org/document/7744590

[9] Žbontar J. LeCun Y. Stereo matching by training a convolutional neural network to compare image patches[J]. Journal of Machine Learning Research, 17, 1-32(2016). http://dl.acm.org/citation.cfm?id=2946710

[10] Boykov Y, Kolmogorov V. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 26, 1124-1137(2004). http://ieeexplore.ieee.org/document/1316848/

[11] Li L C, Yu X, Zhang S L et al. 3D cost aggregation with multiple minimum spanning trees for stereo matching[J]. Applied Optics, 56, 3411-3420(2017). http://europepmc.org/abstract/MED/28430267

[12] Felzenszwalb P F, Huttenlocher D P. Efficient graph-based image segmentation[J]. International Journal of Computer Vision, 59, 167-181(2004). http://link.springer.com/article/10.1023/B%3AVISI.0000022288.19776.77

[13] Yang Q X. A non-local cost aggregation method for stereo matching. [C]∥2012 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), June 16-21, 2012, Providence, RI, USA. New York: IEEE, 1402-1409(2012).

[14] Taniai T, Matsushita Y, Sato Y et al. Continuous 3D label stereo matching using local expansion moves[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 40, 2725-2739(2018). http://ieeexplore.ieee.org/document/8081755/

[15] Chipot M, March R, Rosati M et al. Analysis of a nonconvex problem related to signal selective smoothing[J]. Mathematical Models and Methods in Applied Sciences, 7, 313-328(1997). http://www.worldscientific.com/doi/abs/10.1142/S0218202597000189

[16] He K M, Sun J, Tang X O. Guided image filtering[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 35, 1397-1409(2013).

[17] Olsson C, Ulén J, Boykov Y. In defense of 3D-label stereo. [C]∥2013 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), June 23-28, 2013, Portland, OR, USA. New York: IEEE, 1730-1737(2013).

[18] Ahmed S, Hansard M, Cavallaro A. Constrained optimization for plane-based stereo[J]. IEEE Transactions on Image Processing, 27, 3870-3882(2018). http://ieeexplore.ieee.org/document/8336940/

[19] Comaniciu D, Meer P. Mean shift: a robust approach toward feature space analysis[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24, 603-619(2002). http://ieeexplore.ieee.org/xpls/icp.jsp?arnumber=1000236

[20] Achanta R, Süsstrunk S. Superpixels and polygons using simple non-iterative clustering. [C]∥2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), July 21-26, 2017, Honolulu, HI, USA. New York: IEEE, 4895-4904(2017).

[21] Chum O, Matas J, Kittler J. Locally optimized RANSAC[M]. ∥Michaelis B, Krell G. Lecture notes in computer science. Berlin, Heidelberg: Springer, 2781, 236-243(2003).

[22] Li Y, Min D B, Brown M S et al. SPM-BP: sped-up PatchMatch belief propagation for continuous MRFs. [C]∥2015 IEEE International Conference on Computer Vision (ICCV), December 7-13, 2015, Santiago, Chile. New York: IEEE, 4006-4014(2015).

[23] Taniai T, Matsushita Y, Naemura T. Graph cut based continuous stereo matching using locally shared labels. [C]∥2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), June 23-28, 2014, Columbus, OH, USA. New York: IEEE, 1613-1620(2014).