Fast O(1) Bilateral Filtering Using Trigonometric Range Kernels

DOI10.1109/TIP.2011.2159234zbMATH Open1374.94499OpenAlexW2107462260WikidataQ51559707 ScholiaQ51559707MaRDI QIDQ4591996FDOQ4591996

Authors: Kunal Narayan Chaudhury, Daniel S. Sage, M. Unser 

Publication date: 20 November 2017

Published in: IEEE Transactions on Image Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tip.2011.2159234

Recommendations

• Fast Bilateral Filter With Arbitrary Range and Domain Kernels
• Fast and Provably Accurate Bilateral Filtering
• On a fast bilateral filtering formulation using functional rearrangements
• Acceleration of the Shiftable $\mbi{O}{(1)}$ Algorithm for Bilateral Filtering and Nonlocal Means
• Fast Adaptive Bilateral Filtering
• Fast approximation of trilateral filter for tone mapping using a signal processing approach
• Recursive Approximation of the Bilateral Filter

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Application of orthogonal and other special functions (94A11)

Cited In (4)

• An FPGA-based design for a real-time image denoising using approximated fractional integrator
• On a fast bilateral filtering formulation using functional rearrangements
• Some nonlocal filters formulation using functional rearrangements
• Fast kernel smoothing by a low-rank approximation of the kernel Toeplitz matrix

This page was built for publication: Fast $O(1)$ Bilateral Filtering Using Trigonometric Range Kernels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4591996)