A fast algorithm is derived for the compressive bilateral filter (CBF) by representing the bilateral filter in a new way. This representation allows us to use the property of the… Click to show full abstract
A fast algorithm is derived for the compressive bilateral filter (CBF) by representing the bilateral filter in a new way. This representation allows us to use the property of the Gaussian function to reduce the number of Gaussian filters required by the CBF by a factor of 2. Producing the same results as that of the CBF, the fast algorithm runs about two times faster than the CBF.
               
Click one of the above tabs to view related content.