Prefer a chat interface with context about you and your work?
Fast $O(1)$ Bilateral Filtering Using Trigonometric Range Kernels
It is well known that spatial averaging can be realized (in space or frequency domain) using algorithms whose complexity does not scale with the size or shape of the filter. These fast algorithms are generally referred to as constant-time or O(1) algorithms in the image-processing literature. Along with the spatial …