The Fast Bilateral Solver

被引:241
作者
Barron, Jonathan T. [1 ]
Poole, Ben [2 ]
机构
[1] Google, Mountain View, CA 94043 USA
[2] Stanford Univ, Stanford, CA 94305 USA
来源
COMPUTER VISION - ECCV 2016, PT III | 2016年 / 9907卷
关键词
D O I
10.1007/978-3-319-46487-9_38
中图分类号
TP18 [人工智能理论];
学科分类号
140502 [人工智能];
摘要
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-1000x faster than baseline techniques with comparable accuracy, and producing lower-error output than techniques with comparable runtimes. The bilateral solver is fast, robust, straightforward to generalize to new domains, and simple to integrate into deep learning pipelines.
引用
收藏
页码:617 / 632
页数:16
相关论文
共 45 条
[1]
[Anonymous], 1996, P ACM SIGGRAPH
[2]
[Anonymous], 2008, ECCV WORKSH
[3]
[Anonymous], 2015, CoRR. abs/1505.00996
[4]
[Anonymous], ICME
[5]
[Anonymous], 2015, CVPR
[6]
[Anonymous], 1998, BILATERAL FILTERING
[7]
[Anonymous], 2015, CVPR
[8]
[Anonymous], CVPR
[9]
[Anonymous], 2002, IJCV
[10]
[Anonymous], 1997, IJCV