%0 Electronic Article
%A Xueli Zhang
%A Longquan Dai
%K computer vision
%K edge-preserving ability
%K bilateral filtering
%K computational complexity
%K spatial kernel
%K fast bilateral filtering
%K smoothing tool
%K image processing
%K exponential function
%X The bilateral filter is a fundamental smoothing tool in image processing and computer vision due to its outstanding edge-preserving ability. However, the computational complexity depends on the size of the support of the spatial kernel. This drawback makes bilateral filtering time-consuming and significantly limits its applications. A novel strategy to turn the range kernel of the bilateral filter into a sum of exponential functions is proposed. As the convolution with the exponential function can be accelerated by the O ( 1 ) box filtering, the computational complexity of the bilateral thus becomes O ( 1 ) . Experimental results disclose that the proposed algorithm is competitive with the state-of-the-art algorithms in terms of filtering accuracy and computational efficiency.
%@ 0013-5194
%T Fast bilateral filtering
%B Electronics Letters
%D March 2019
%V 55
%N 5
%P 258-260
%I Institution of Engineering and Technology
%U https://digital-library.theiet.org/;jsessionid=3troup0jbffp8.x-iet-live-01content/journals/10.1049/el.2018.7278
%G EN