The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Fast Adaptive Bilateral Filtering
Open accessAbstract
In the classical bilateral filter, a fixed Gaussian range kernel is used along with a spatial kernel for edge-preserving smoothing. We consider a generalization of this filter, the so-called adaptive bilateral filter, where the center and width of the Gaussian range kernel are allowed to change from pixel to pixel. Though this variant was originally proposed for sharpening and noise removal, it can also be used for other applications, such as artifact removal and texture filtering. Similar to the bilateral filter, the brute-force implementation of its adaptive counterpart requires intense computations. While several fast algorithms have been proposed in the literature for bilateral filtering, most of them work only with a fixed range kernel. In this paper, we propose a fast algorithm for adaptive bilateral filtering, whose complexity does not scale with the spatial filter width. This is based on the observation that the concerned filtering can be performed purely in range space using an appropriately defined local histogram. We show that by replacing the histogram with a polynomial and the finite range-space sum with an integral, we can approximate the filter using analytic functions. In particular, an efficient algorithm is derived using the following innovations: the polynomial is fitted by matching its moments to those of the target histogram (this is done using fast convolutions), and the analytic functions are recursively computed using integration-by-parts. Our algorithm can accelerate the brute-force implementation by at least , without perceptible distortions in the visual quality. We demonstrate the effectiveness of our algorithm for sharpening, JPEG deblocking, and texture filtering.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Bilateral Filtering for Gray and Color Images
Tomasi, C., & Manduchi, R. (2002) · Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271) · doi:10.1109/iccv.1998.710815 · Cited by 8,177 · cited 19×
“In this method, a Gaussian smoothing is first applied to the input image to smooth out the textures.”
BackgroundInfluentialHe, K., Sun, J., & Tang, X. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.213 · Cited by 5,546
SUSAN—a new approach to low level image processing
Smith, S. M., & Brady, J. M. (1997) · International Journal of Computer Vision · doi:10.1023/a:1007963824710 · Cited by 3,333
Adaptive Bilateral Filter for Sharpness Enhancement and Noise Removal
Zhang, B., & Allebach, J. P. (2008) · IEEE Transactions on Image Processing · doi:10.1109/tip.2008.919949 · Cited by 403 · cited 10×
“The first application is directly based on the method in [5], whereas the second is a minor modifica-tion of the method in [6].”
BackgroundMethodInfluential
Cited by
Recent advances on image edge detection: A comprehensive review
Jing, J., Liu, S., Wang, G., Zhang, W., & Sun, C. (2022) · Neurocomputing · doi:10.1016/j.neucom.2022.06.083 · Cited by 298
Metadata
- Authors
- Gavaskar, R. G., & Chaudhury, K. N.
- Venue
- IEEE Transactions on Image Processing
- Published
- 2019-02
- Volume
- 28
- Issue
- 2
- Pages
- 779-790
- ISSN
- 1057-7149 (ISSN-L)
- 1941-0042
- OpenAlex
- W2891878684
- Cited by
- 168
- References
- 4
- FWCI
- 6.23
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Fast Adaptive Bilateral Filtering. https://app.cochat.ai/papers/10.1109/tip.2018.2871597
- The paper
- Gavaskar, R. G., & Chaudhury, K. N. (2019). Fast Adaptive Bilateral Filtering. IEEE Transactions on Image Processing. https://doi.org/10.1109/tip.2018.2871597
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.