Recursive Bilateral Filtering

  • Qingxiong Yang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7572)


This paper proposes a recursive implementation of the bilateral filter. Unlike previous methods, this implementation yields an bilateral filter whose computational complexity is linear in both input size and dimensionality. The proposed implementation demonstrates that the bilateral filter can be as efficient as the recent edge-preserving filtering methods, especially for high-dimensional images. Let the number of pixels contained in the image be N, and the number of channels be D, the computational complexity of the proposed implementation will be O(ND). It is more efficient than the state-of-the-art bilateral filtering methods that have a computational complexity of O(ND 2) [1] (linear in the image size but polynomial in dimensionality) or O(Nlog(N)D) [2] (linear in the dimensionality thus faster than [1] for high-dimensional filtering). Specifically, the proposed implementation takes about 43 ms to process a one megapixel color image (and about 14 ms to process a 1 megapixel grayscale image) which is about 18 × faster than [1] and 86× faster than [2]. The experiments were conducted on a MacBook Air laptop computer with a 1.8 GHz Intel Core i7 CPU and 4 GB memory. The memory complexity of the proposed implementation is also low: as few as the image memory will be required (memory for the images before and after filtering is excluded). This paper also derives a new filter named gradient domain bilateral filter from the proposed recursive implementation. Unlike the bilateral filter, it performs bilateral filtering on the gradient domain. It can be used for edge-preserving filtering but avoids sharp edges that are observed to cause visible artifacts in some computer graphics tasks. The proposed implementations were proved to be effective for a number of computer vision and computer graphics applications, including stylization, tone mapping, detail enhancement and stereo matching.


Grayscale Image Stereo Match Color Edge Bilateral Filter Tone Mapping 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Adams, A., Baek, J., Davis, A.: Fast high-dimensional filtering using the permutohedral lattice. Comput. Graph. Forum 29, 753–762 (2010)CrossRefGoogle Scholar
  2. 2.
    Adams, A., Gelfand, N., Dolson, J., Levoy, M.: Gaussian kd-trees for fast high-dimensional filtering. ACM Trans. Graph. 28, 21:1–21:12 (2009)CrossRefGoogle Scholar
  3. 3.
    Tomasi, C., Manduchi, R.: Bilateral filtering for gray and color images. In: ICCV, pp. 839–846 (1998)Google Scholar
  4. 4.
    Paris, S., Kornprobst, P., Tumblin, J., Durand, F.: Bilateral filtering: Theory and applications. Foundations and Trends in Computer Graphics and Vision (4), 1–73Google Scholar
  5. 5.
    Paris, S., Durand, F.: A fast approximation of the bilateral filter using a signal processing approach. IJCV 81, 24–52 (2009)CrossRefGoogle Scholar
  6. 6.
    Durand, F., Dorsey, J.: Fast bilateral filtering for the display of high-dynamic-range images. In: Siggraph, vol. 21 (2002)Google Scholar
  7. 7.
    Pham, T.Q., van Vliet, L.J.: Separable bilateral filtering for fast video preprocessing. In: International Conference on Multimedia and Expo. (2005)Google Scholar
  8. 8.
    Weiss, B.: Fast median and bilateral filtering. In: Siggraph, vol. 25, pp. 519–526 (2006)Google Scholar
  9. 9.
    Chen, J., Paris, S., Durand, F.: Real-time edge-aware image processing with the bilateral grid. In: Siggraph, vol. 26 (2007)Google Scholar
  10. 10.
    Porikli, F.: Integral histogram: A fast way to extract histograms in cartesian spaces, pp. 829–836 (2005)Google Scholar
  11. 11.
    Porikli, F.: Constant time o(1) bilateral filtering. In: CVPR (2008)Google Scholar
  12. 12.
    Yang, Q., Tan, K.H., Ahuja, N.: Real-time o(1) bilateral filtering. In: CVPR, pp. 557–564 (2009)Google Scholar
  13. 13.
    Adams, A.: High-dimensional gaussian filtering for computational photography. PhD Thesis, Stanford University, California, U.S.A. (2011)Google Scholar
  14. 14.
    Fattal, R.: Edge-avoiding wavelets and their applications. ToG 28, 1–10 (2009)Google Scholar
  15. 15.
    He, K., Sun, J., Tang, X.: Guided Image Filtering. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010, Part I. LNCS, vol. 6311, pp. 1–14. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  16. 16.
    Gastal, E., Oliveira, M.: Domain transform for edge-aware image and video processing. ACM TOG 30, 69:1–69:12 (2011), Proceedings of SIGGRAPH 2011Google Scholar
  17. 17.
    Scharstein, D., Szeliski, R.: (Middlebury stereo evaluation),
  18. 18.
    Smith, J.O.: Introduction to Digital Filters with Audio Applications. W3K Publishing (2007)Google Scholar
  19. 19.
    Orfanidis, S.: Introduction to signal processing. Prentice-Hall, Inc., Upper Saddle River (1995)Google Scholar
  20. 20.
    Deriche, R.: Recursively implementing the gaussian and its derivatives. In: ICIP, pp. 263–267 (1992)Google Scholar
  21. 21.
    Yoon, K.J., Kweon, I.S.: Adaptive support-weight approach for correspondence search. PAMI 28, 650–656 (2006)CrossRefGoogle Scholar
  22. 22.
    Rhemann, C., Hosni, A., Bleyer, M., Rother, C., Gelautz, M.: Fast cost-volume filtering for visual correspondence and beyond. In: CVPR, pp. 3017–3024 (2011)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Qingxiong Yang
    • 1
  1. 1.Department of Computer ScienceCity University of Hong KongHong KongChina

Personalised recommendations