Open AccessPosted Content
Fast O(1) bilateral filtering using trigonometric range kernels
TLDR
This paper shows how the O(1) averaging algorithms can be leveraged for realizing the bilateral filter in constant time, by using trigonometric range kernels, by generalizing the idea presented by Porikli, i.e., using polynomial kernels.Abstract:
It is well-known that spatial averaging can be realized (in space or frequency domain) using algorithms whose complexity does not depend on 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 filter, the edge-preserving bilateral filter [Tomasi1998] involves an additional range kernel. This is used to restrict the averaging to those neighborhood pixels whose intensity are similar or close to that of the pixel of interest. The range kernel operates by acting on the pixel intensities. This makes the averaging process non-linear and computationally intensive, especially when the spatial filter is large. In this paper, we show how the O(1) averaging algorithms can be leveraged for realizing the bilateral filter in constant-time, by using trigonometric range kernels. This is done by generalizing the idea in [Porikli2008] of using polynomial range kernels. The class of trigonometric kernels turns out to be sufficiently rich, allowing for the approximation of the standard Gaussian bilateral filter. The attractive feature of our approach is that, for a fixed number of terms, the quality of approximation achieved using trigonometric kernels is much superior to that obtained in [Porikli2008] using polynomials.read more
Citations
More filters
Posted Content
A Brief Survey of Recent Edge-Preserving Smoothing Algorithms on Digital Images.
TL;DR: This paper provides a concrete introduction to edge preserving filters starting from the heat diffusion equation in olden to recent eras, an overview of its numerous applications, as well as mathematical analysis, various efficient and optimized ways of implementation and their interrelationships.
Journal ArticleDOI
Structure-aware adaptive bilateral texture filtering
TL;DR: In this article , a structure-aware bilateral filter that incorporates the structural information throughout texture smoothing is proposed. But, it is not viable to use the bilateral filter for simple image smoothing, as certain modifications are required in a bilateral filter to exploit it as a precise tool for texture smoothhing.
Journal ArticleDOI
A Fast Two-Stage Bilateral Filter Using Constant Time O(1) Histogram Generation
TL;DR: A novel Dual-Histogram BF (DHBF) method that exploits an edge-preserving noise-reduced guidance image to compute the range kernel, removing isolated noisy pixels for better denoising results and outperforms other state-of-the-art BF methods.
Journal ArticleDOI
Speed Up Bilateral Filtering via Sparse Approximation on a Learned Cosine Dictionary
TL;DR: This approach is the first method that adaptively constructs a cosine dictionary according to the input kernel and guarantees the best filtering accuracy and efficiency.
References
More filters
Journal ArticleDOI
Scale-space and edge detection using anisotropic diffusion
Pietro Perona,Jitendra Malik +1 more
TL;DR: A new definition of scale-space is suggested, and a class of algorithms used to realize a diffusion process is introduced, chosen to vary spatially in such a way as to encourage intra Region smoothing rather than interregion smoothing.
Proceedings ArticleDOI
Fast bilateral filtering for the display of high-dynamic-range images
Frédo Durand,Julie Dorsey +1 more
TL;DR: A new technique for the display of high-dynamic-range images, which reduces the contrast while preserving detail, is presented, based on a two-scale decomposition of the image into a base layer, encoding large-scale variations, and a detail layer.
Proceedings ArticleDOI
Summed-area tables for texture mapping
TL;DR: Texture-map computations can be made tractable through use of precalculated tables which allow computational costs independent of the texture density, and the cost and performance of the new technique is compared to previous techniques.
Journal ArticleDOI
Stereo Matching with Color-Weighted Correlation, Hierarchical Belief Propagation, and Occlusion Handling
TL;DR: A stereo matching algorithm with careful handling of disparity, discontinuity, and occlusion based on an energy-minimization framework that is evaluated on the Middlebury data sets, showing that the algorithm is the top performer among all the algorithms listed there.
Journal ArticleDOI
Real-time video abstraction
TL;DR: An automatic, real-time video and image abstraction framework that abstracts imagery by modifying the contrast of visually important features, namely luminance and color opponency is presented and finds that participants are faster at naming abstracted faces of known persons compared to photographs.