Open AccessOptimal fitting polynomial for linear time bilateral filters
Author(s) -
Dai Longquan,
Yuan Mengke,
Zhang Xiaopeng
Publication year - 2015
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
eISSN - 1350-911X
pISSN - 0013-5194
DOI - 10.1049/el.2015.1543
Subject(s) - polynomial , mathematics , kernel (algebra) , smoothing , algorithm , range (aeronautics) , polynomial interpolation , lagrange polynomial , interpolation (computer graphics) , kernel smoother , nonlinear system , polynomial kernel , mathematical optimization , kernel method , linear interpolation , computer science , mathematical analysis , discrete mathematics , radial basis function kernel , artificial intelligence , statistics , motion (physics) , materials science , physics , quantum mechanics , support vector machine , composite material
The bilateral filter (BF) has showed great effectiveness for a variety of problems. However, its brute‐force implementation is time consuming. One way of accelerating a BF is to approximate the nonlinear range kernel of the BF by a set of linear time shiftable kernels. To achieve this goal, only finite values of the kernel of the BF have been used to perform smoothing due to the quantisation of digital images. Thus, the filtering results are not changed by substituting the range kernel with the function having the same values at finite discrete points. The Lagrange interpolation polynomial can exactly pass through predefined points and therefore can be employed to replace original kernels for accurate by accelerating the BF. To speed up the BF at the cost of small approximation error, two approximation methods are proposed to obtain the optimal fitting polynomial. The performance of the proposed method is validated by extensive experiments.