| Full name | SGM-Forest |
| Description | 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 SGM-Forest algorithm solves this problem using per-pixel classification. SGM-Forest 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. |
| Publication title | Learning to Fuse Proposals from Multiple Scanline Optimizations in Semi-Global Matching |
| Publication authors | Johannes L. Schönberger, Sudipta Sinha, Marc Pollefeys |
| Publication venue | ECCV 2018 |
| Programming language(s) | C/C++, Python |
| Hardware | Intel Xeon CPU E5-2697, 32GB RAM |
| Submission creation date | 28 Feb, 2018 |
| Last edited | 4 Jul, 2018 |
