资源论文Learning to Fuse Proposals from Multiple Scanline Optimizations in Semi-Global Matching

Learning to Fuse Proposals from Multiple Scanline Optimizations in Semi-Global Matching

2019-10-23 | |  56 |   32 |   0
Abstract. Semi-Global Matching (SGM) uses an aggregation scheme to combine costs from multiple 1D scanline optimizations that tends to hurt its accuracy in difficult scenarios. We propose replacing this aggregation scheme with a new learning-based method that fuses disparity proposals estimated using scanline optimization. Our proposed SGMForest algorithm solves this problem using per-pixel classification. SGMForest currently ranks 1st on the ETH3D stereo benchmark and is ranked competitively on the Middlebury 2014 and KITTI 2015 benchmarks. It consistently outperforms SGM in challenging settings and under difficult training protocols that demonstrate robust generalization, while adding only a small computational overhead to SGM.

上一篇:CTAP: Complementary Temporal Action Proposal Generation

下一篇:DFT-based Transformation Invariant Pooling Layer for Visual Classification

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...