光学学报, 2018, 38 (1): 0115002, 网络出版: 2018-08-31   

基于水平树结构的可变权重代价聚合立体匹配算法 下载: 976次

Variable Weight Cost Aggregation Algorithm for Stereo Matching Based on Horizontal Tree Structure
作者单位
江南大学轻工过程先进控制教育部重点实验室, 江苏 无锡 214122
引用该论文

彭建建, 白瑞林. 基于水平树结构的可变权重代价聚合立体匹配算法[J]. 光学学报, 2018, 38(1): 0115002.

Jianjian Peng, Ruilin Bai. Variable Weight Cost Aggregation Algorithm for Stereo Matching Based on Horizontal Tree Structure[J]. Acta Optica Sinica, 2018, 38(1): 0115002.

参考文献

[1] BleyerM, BreitenederC. Stereo matching—state-of-the-art and research challenges[M]. Advanced topics in computer vision. London: Springer, 2013: 143- 179.

    BleyerM, BreitenederC. Stereo matching—state-of-the-art and research challenges[M]. Advanced topics in computer vision. London: Springer, 2013: 143- 179.

    BleyerM, BreitenederC. Stereo matching—state-of-the-art and research challenges[M]. Advanced topics in computer vision. London: Springer, 2013: 143- 179.

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

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

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

[3] Sun J, Zheng N N, Shum H Y. Stereo matching using belief propagation[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2003, 25(7): 787-800.

    Sun J, Zheng N N, Shum H Y. Stereo matching using belief propagation[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2003, 25(7): 787-800.

    Sun J, Zheng N N, Shum H Y. Stereo matching using belief propagation[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2003, 25(7): 787-800.

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

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

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

[5] BleyerM, GelautzM. Simple buteffective tree structures for dynamic programming-based stereo matching[C]∥International Conference on Computer Vision Theory and Applications, Funchal, Portugal, 2008: 415- 422.

    BleyerM, GelautzM. Simple buteffective tree structures for dynamic programming-based stereo matching[C]∥International Conference on Computer Vision Theory and Applications, Funchal, Portugal, 2008: 415- 422.

    BleyerM, GelautzM. Simple buteffective tree structures for dynamic programming-based stereo matching[C]∥International Conference on Computer Vision Theory and Applications, Funchal, Portugal, 2008: 415- 422.

[6] 祝世平, 李政. 基于改进梯度和自适应窗口的立体匹配算法[J]. 光学学报, 2015, 35(1): 0110003.

    祝世平, 李政. 基于改进梯度和自适应窗口的立体匹配算法[J]. 光学学报, 2015, 35(1): 0110003.

    祝世平, 李政. 基于改进梯度和自适应窗口的立体匹配算法[J]. 光学学报, 2015, 35(1): 0110003.

    Zhu S P, Li Z. A stereo matching algorithm using improved gradient and adaptive window[J]. Acta Optica Sinica, 2015, 35(1): 0110003.

    Zhu S P, Li Z. A stereo matching algorithm using improved gradient and adaptive window[J]. Acta Optica Sinica, 2015, 35(1): 0110003.

    Zhu S P, Li Z. A stereo matching algorithm using improved gradient and adaptive window[J]. Acta Optica Sinica, 2015, 35(1): 0110003.

[7] Yoon K J, Kweon I S. Adaptive support-weight approach for correspondence search[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2006, 28(4): 650-656.

    Yoon K J, Kweon I S. Adaptive support-weight approach for correspondence search[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2006, 28(4): 650-656.

    Yoon K J, Kweon I S. Adaptive support-weight approach for correspondence search[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2006, 28(4): 650-656.

[8] Hosni A, Rhemann C, Bleyer M, et al. Fast cost-volume filtering for visual correspondence and beyond[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2013, 35(2): 504-511.

    Hosni A, Rhemann C, Bleyer M, et al. Fast cost-volume filtering for visual correspondence and beyond[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2013, 35(2): 504-511.

    Hosni A, Rhemann C, Bleyer M, et al. Fast cost-volume filtering for visual correspondence and beyond[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2013, 35(2): 504-511.

[9] CiglaC. Recursive edge-aware filters for stereo matching[C]∥Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition Workshops, 2015: 27- 34.

    CiglaC. Recursive edge-aware filters for stereo matching[C]∥Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition Workshops, 2015: 27- 34.

    CiglaC. Recursive edge-aware filters for stereo matching[C]∥Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition Workshops, 2015: 27- 34.

[10] Yang Q, Li D, Wang L, et al. Full-image guided filtering for fast stereo matching[J]. IEEE Signal Processing Letters, 2013, 20(3): 237-240.

    Yang Q, Li D, Wang L, et al. Full-image guided filtering for fast stereo matching[J]. IEEE Signal Processing Letters, 2013, 20(3): 237-240.

    Yang Q, Li D, Wang L, et al. Full-image guided filtering for fast stereo matching[J]. IEEE Signal Processing Letters, 2013, 20(3): 237-240.

[11] Yang Q. Local smoothness enforced cost volume regularization for fast stereo correspondence[J]. IEEE Signal Processing Letters, 2015, 22(9): 1429-1433.

    Yang Q. Local smoothness enforced cost volume regularization for fast stereo correspondence[J]. IEEE Signal Processing Letters, 2015, 22(9): 1429-1433.

    Yang Q. Local smoothness enforced cost volume regularization for fast stereo correspondence[J]. IEEE Signal Processing Letters, 2015, 22(9): 1429-1433.

[12] YangQ. A non-local cost aggregation method for stereo matching[C]∥IEEE Conference on Computer Vision and Pattern Recognition, 2012: 1402- 1409.

    YangQ. A non-local cost aggregation method for stereo matching[C]∥IEEE Conference on Computer Vision and Pattern Recognition, 2012: 1402- 1409.

    YangQ. A non-local cost aggregation method for stereo matching[C]∥IEEE Conference on Computer Vision and Pattern Recognition, 2012: 1402- 1409.

[13] MeiX, SunX, Dong WM, et al. Segment-tree based cost aggregation for stereo matching[C]∥Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2013: 313- 320.

    MeiX, SunX, Dong WM, et al. Segment-tree based cost aggregation for stereo matching[C]∥Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2013: 313- 320.

    MeiX, SunX, Dong WM, et al. Segment-tree based cost aggregation for stereo matching[C]∥Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2013: 313- 320.

[14] YaoP, ZhangH, XueY, et al. Segment-tree based cost aggregation for stereo matching with enhanced segmentation advantage[C]∥IEEE International Conference on Acoustics, Speech and Signal Processing, 2017: 2027- 2031.

    YaoP, ZhangH, XueY, et al. Segment-tree based cost aggregation for stereo matching with enhanced segmentation advantage[C]∥IEEE International Conference on Acoustics, Speech and Signal Processing, 2017: 2027- 2031.

    YaoP, ZhangH, XueY, et al. Segment-tree based cost aggregation for stereo matching with enhanced segmentation advantage[C]∥IEEE International Conference on Acoustics, Speech and Signal Processing, 2017: 2027- 2031.

[15] Ma ZY, He KM, Wei YC, et al. Constant time weighted median filtering for stereo matching and beyond[C]∥Proceedings of the IEEE International Conference on Computer Vision, 2013: 49- 56.

    Ma ZY, He KM, Wei YC, et al. Constant time weighted median filtering for stereo matching and beyond[C]∥Proceedings of the IEEE International Conference on Computer Vision, 2013: 49- 56.

    Ma ZY, He KM, Wei YC, et al. Constant time weighted median filtering for stereo matching and beyond[C]∥Proceedings of the IEEE International Conference on Computer Vision, 2013: 49- 56.

[16] SunX, MeiX, Jiao SH, et al. Stereo matching with reliable disparity propagation[C]∥IEEE International Conference on 3D Imaging, Modeling, Processing, Visualization and Transmission, 2011: 132- 139.

    SunX, MeiX, Jiao SH, et al. Stereo matching with reliable disparity propagation[C]∥IEEE International Conference on 3D Imaging, Modeling, Processing, Visualization and Transmission, 2011: 132- 139.

    SunX, MeiX, Jiao SH, et al. Stereo matching with reliable disparity propagation[C]∥IEEE International Conference on 3D Imaging, Modeling, Processing, Visualization and Transmission, 2011: 132- 139.

[17] ZhangK, FangY, MinD, et al. Cross-scale cost aggregation for stereo matching[C]∥Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2014: 1590- 1597.

    ZhangK, FangY, MinD, et al. Cross-scale cost aggregation for stereo matching[C]∥Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2014: 1590- 1597.

    ZhangK, FangY, MinD, et al. Cross-scale cost aggregation for stereo matching[C]∥Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2014: 1590- 1597.

彭建建, 白瑞林. 基于水平树结构的可变权重代价聚合立体匹配算法[J]. 光学学报, 2018, 38(1): 0115002. Jianjian Peng, Ruilin Bai. Variable Weight Cost Aggregation Algorithm for Stereo Matching Based on Horizontal Tree Structure[J]. Acta Optica Sinica, 2018, 38(1): 0115002.

本文已被 2 篇论文引用
被引统计数据来源于中国光学期刊网
引用该论文: TXT   |   EndNote

相关论文

加载中...

关于本站 Cookie 的使用提示

中国光学期刊网使用基于 cookie 的技术来更好地为您提供各项服务,点击此处了解我们的隐私策略。 如您需继续使用本网站,请您授权我们使用本地 cookie 来保存部分信息。
全站搜索
您最值得信赖的光电行业旗舰网络服务平台!