The Fast Bilateral Solver

11/10/2015
by   Jonathan T. Barron, et al.
0

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.

READ FULL TEXT

page 12

page 33

page 34

page 35

page 36

page 37

page 38

page 39

research
05/11/2018

The Domain Transform Solver

We present a framework for edge-aware optimization that is an order of m...
research
01/26/2023

Learning Good Features to Transfer Across Tasks and Domains

Availability of labelled data is the major obstacle to the deployment of...
research
09/18/2017

Variational Methods for Normal Integration

The need for an efficient method of integration of a dense normal field ...
research
10/19/2016

Fast and Accurate Surface Normal Integration on Non-Rectangular Domains

The integration of surface normals for the purpose of computing the shap...
research
10/12/2021

Fast Block Linear System Solver Using Q-Learning Schduling for Unified Dynamic Power System Simulations

We present a fast block direct solver for the unified dynamic simulation...
research
02/22/2021

Escaping Poor Local Minima in Large Scale Robust Estimation

Robust parameter estimation is a crucial task in several 3D computer vis...
research
02/01/2019

Fast and Optimal Laplacian Solver for Gradient-Domain Image Editing using Green Function Convolution

In computer vision, the gradient and Laplacian of an image are used in m...

Please sign up or login with your details

Forgot password? Click here to reset