[1] 马瑞浩, 朱枫, 吴清潇, 等. 基于图像分割的稠密立体匹配算法[J]. 光学学报, 2019, 39(3): 0315001.

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

[2] BleyerM, RhemannC, RotherC. PatchMatch stereo-stereo matching with slanted support windows[C]∥Procedings of the British Machine Vision Conference 2011, August 29-September 1, 2011, Dundee.Durham: BMVA Press, 2011: 14.

[3] Barnes C, Shechtman E, Finkelstein A, et al. PatchMatch: a randomized correspondence algorithm for structural image editing[J]. ACM Transactions on Graphics, 2009, 28(3): 24.

[4] Luus R. Jaakola T H I. Optimization by direct search and systematic reduction of the size of search region[J]. AIChE Journal, 1973, 19(4): 760-766.

[5] Besse F, Rother C, Fitzgibbon A, et al. PMBP: PatchMatch belief propagation for correspondence field estimation[J]. International Journal of Computer Vision, 2014, 110(1): 2-13.

[6] Lu JB, Yang HS, Min DB, 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, 2013: 1854- 1861.

[7] HeiseP, KloseS, JensenB, 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, 2013: 2360- 2367.

[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, 2018, 28(3): 679-692.

[9] Žbontar J. LeCun Y. Stereo matching by training a convolutional neural network to compare image patches[J]. Journal of Machine Learning Research, 2016, 17: 1-32.

[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, 2004, 26(9): 1124-1137.

[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, 2017, 56(12): 3411-3420.

[12] Felzenszwalb P F, Huttenlocher D P. Efficient graph-based image segmentation[J]. International Journal of Computer Vision, 2004, 59(2): 167-181.

[13] Yang QX. 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, 2012: 1402- 1409.

[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, 2018, 40(11): 2725-2739.

[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, 1997, 7(3): 313-328.

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

[17] OlssonC, UlénJ, BoykovY. 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, 2013: 1730- 1737.

[18] Ahmed S, Hansard M, Cavallaro A. Constrained optimization for plane-based stereo[J]. IEEE Transactions on Image Processing, 2018, 27(8): 3870-3882.

[19] Comaniciu D, Meer P. Mean shift: a robust approach toward feature space analysis[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2002, 24(5): 603-619.

[20] AchantaR, SüsstrunkS. 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, 2017: 4895- 4904.

[21] ChumO, MatasJ, KittlerJ. Locally optimized RANSAC[M] ∥Michaelis B, Krell G. Lecture notes in computer science. Berlin, Heidelberg: Springer, 2003, 2781: 236- 243.

[22] LiY, Min DB, Brown MS, 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, 2015: 4006- 4014.

[23] TaniaiT, MatsushitaY, NaemuraT. 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, 2014: 1613- 1620.