Fast bilateral filter with arbitrary range and domain kernels

In this paper, we present a fast implementation of the bilateral filter with arbitrary range and domain kernels. It is based on the fast bilateral filter approximation that uses uniform box domain kernel. Instead of using a single box kernel, multiple box kernels are used and combined optimally to approximate an arbitrary domain kernel. The method achieves better approximation of the bilateral filter compared to the single box kernel version with little increase in computational complexity.