A Fast Approach for Design and Realization of Bilateral filter

This paper proposed a fast approach for Bilateral filter. First, instead of the time-consuming point-by-point calculation in the primal, we set up a set of dynamic templets to the geometric closeness function,as a result, only cost two-thirds computing time than before . Then, We discretize the photometric similarity function to make the computational formula of the Bilateral filter come into being a convolution. In the end, since the discrete Fast Fourier Transform (FFT) have cost O (Nlog2N), the O (N2) convolution can be greatly accelerated using discrete FFT,there is a gain of one order of magnitude.