Why the implementation algorithm for the bilateral filter is so old?

asked 2015-09-25 03:18:07 -0600

galiano gravatar image

Hello all,

The algorithm implementing the bilateral filter is the old-fashioned pixel-based version of Banduchi and Tomasi.

Nowadays, there are much faster algorithms for the bilateral filter.

If someone answers, I can give her/him some references and even plain C implementations of those algorithms for creating a fork or whatever.

I don't do it myself because I'm not so good at efficient programing.

Cheers!

edit retag flag offensive close merge delete

Comments

What do you mean by old? And why C implementation?

thdrksdfthmn gravatar imagethdrksdfthmn ( 2015-09-25 06:43:17 -0600 )edit
1

I mean that the algorithm implemented in OpenCV is the straightforward pixelwise implementation which is much slower than other more recent formulations. For instance:

  • Paris S, Durand F (2006) A fast approximation of the bilateral filter using a signal processing approach. ECCV 2006
  • Porikli F (2008) Constant time O(1) bilateral filtering. CVPR 2008
  • Yang Q, Tan KH, Ahuja N (2009) Real-time O(1) bilateral filtering. CVPR 2009. *Galiano G, Velasco J (2015) On a fast bilateral filtering formulation using functional rearrangements. J Math Imaging Vision

I have C and C++ implementations of new formulations.

galiano gravatar imagegaliano ( 2015-10-01 12:11:52 -0600 )edit
add a comment