The Fast Bilateral Solver
About
We present the bilateral solver, a novel algorithm for edge-aware smoothing that combines the flexibility and speed of simple filtering approaches with the accuracy of domain-specific optimization algorithms. Our technique is capable of matching or improving upon state-of-the-art results on several different computer vision tasks (stereo, depth superresolution, colorization, and semantic segmentation) while being 10-1000 times faster than competing approaches. The bilateral solver is fast, robust, straightforward to generalize to new domains, and simple to integrate into deep learning pipelines.
Jonathan T. Barron, Ben Poole• 2015
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Depth Completion | NYU-depth-v2 official (test) | RMSE0.479 | 187 | |
| Depth Completion | KITTI depth completion official (test) | RMSE (mm)1.75e+3 | 154 | |
| Depth Super-Resolution | NYU v2 (test) | RMSE4.29 | 126 | |
| Depth Upsampling | NYU V2 | RMSE (x4)4.29 | 11 |
Showing 4 of 4 rows