A Fast Approximation to the Bilateral Filter for ITK
Please use this identifier to cite or link to this publication: http://hdl.handle.net/10380/3122
New: Prefer using the following doi: https://doi.org/10.54294/noo5vc
This document describes an implementation of an alternative bilateral filtering algorithm in ITK. This class implements the fast bilateral filter algorithm in ITK by taking the input image and organizing it into the required data structure as an ITK Image with dimension one greater than the original image. The DiscreteGaussianImageFilter is then used to blur the higher dimensional image. The discrete Gaussian image filter was chosen because the kernel width used should usually be small due to the down-sampling involved when using this technique. As described in the ITK documentation, this class should outperform the recursive Gaussian algorithm due to the small kernel size DiscreteGaussianImageFilter.After the Gaussian blur has been completed the data will be interpolated and written to the output image. By incorporating this class into the ITK framework, this more efficient algorithm will be made available to all ITK users.