The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Constant time O(1) bilateral filtering
Abstract
This paper presents three novel methods that enable bilateral filtering in constant time O(1) without sampling. Constant time means that the computation time of the filtering remains same even if the filter size becomes very large. Our first method takes advantage of the integral histograms to avoid the redundant operations for bilateral filters with box spatial and arbitrary range kernels. For bilateral filters constructed by polynomial range and arbitrary spatial filters, our second method provides a direct formulation by using linear filters of image powers without any approximation. Lastly, we show that Gaussian range and arbitrary spatial bilateral filters can be expressed by Taylor series as linear filter decompositions without any noticeable degradation of filter response. All these methods drastically decrease the computation time by cutting it down constant times (e.g. to 0.06 seconds per 1MB image) while achieving very high PSNRpsilas over 45 dB. In addition to the computational advantages, our methods are straightforward to implement.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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 1×
“[6] as a non-iterative means of smoothing images while retaining edge detail.”
BackgroundFast bilateral filtering for the display of high-dynamic-range images
Durand, F., & Dorsey, J. (2002) · Proceedings of the 29th annual conference on Computer graphics and interactive techniques · doi:10.1145/566570.566574 · Cited by 1,547
A Fast Approximation of the Bilateral Filter Using a Signal Processing Approach
Paris, S., & Durand, F. (2009) · International Journal of Computer Vision · doi:10.1007/s11263-007-0110-8 · Cited by 797
On the origin of the bilateral filter and ways to improve it
Elad, M. (2002) · IEEE Transactions on Image Processing · doi:10.1109/tip.2002.801126 · Cited by 791
Integral histogram: a fast way to extract histograms in Cartesian spaces
Porikli, F. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.188 · Cited by 701
Self-citationA Fast Approximation of the Bilateral Filter Using a Signal Processing Approach
Paris, S., & Durand, F. (2006) · Lecture Notes in Computer Science · doi:10.1007/11744085_44 · Cited by 481
Fast median and bilateral filtering
Weiss, B. (2006) · ACM Transactions on Graphics · doi:10.1145/1141911.1141918 · Cited by 346
Fast anisotropic gauss filtering
Geusebroek, J., Smeulders, A. W. M., & van de Weijer, J. (2003) · IEEE Transactions on Image Processing · doi:10.1109/tip.2003.812429 · Cited by 331
Fundamentals of Image Processing
Young, I., Gerbrands, J., & van Vliet, L. (2009) · Electrical Engineering Handbook · doi:10.1201/9781420046090-c13 · Cited by 286
Efficient Synthesis of Gaussian Filters by Cascaded Uniform Filters
Wells, W. M. (1986) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1986.4767776 · Cited by 163
Cited by
He, K., Sun, J., & Tang, X. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.213 · Cited by 5,546
A Fast Single Image Haze Removal Algorithm Using Color Attenuation Prior
Zhu, Q., Mai, J., & Shao, L. (2015) · IEEE Transactions on Image Processing · doi:10.1109/tip.2015.2446191 · Cited by 2,469
He, K., Sun, J., & Tang, X. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15549-9_1 · Cited by 1,565
Domain transform for edge-aware image and video processing
Gastal, E. S. L., & Oliveira, M. M. (2011) · ACM Transactions on Graphics · doi:10.1145/2010324.1964964 · Cited by 620
Domain transform for edge-aware image and video processing
Gastal, E. S. L., & Oliveira, M. M. (2011) · ACM SIGGRAPH 2011 papers · doi:10.1145/1964921.1964964 · Cited by 591
Metadata
- Authors
- Porikli, F.
- Venue
- 2008 IEEE Conference on Computer Vision and Pattern Recognition
- Publisher
- IEEE
- Published
- 2008-06
- Pages
- 1-8
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W2162618331
- Cited by
- 332
- References
- 11
- FWCI
- 12.02
- Type
- conference paper
- Language
- en
- Open access
- closed
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: Constant time O(1) bilateral filtering. https://app.cochat.ai/papers/10.1109/cvpr.2008.4587843
- The paper
- Porikli, F. (2008). Constant time O(1) bilateral filtering. 2008 IEEE Conference on Computer Vision and Pattern Recognition. https://doi.org/10.1109/cvpr.2008.4587843
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.