Fixed-Coefficient Iterative Bilateral Filters for Graph-Based Image Processing
We present a graph-based image processing algorithm using fast iterative bilateral filters. The computation of bilateral filters is accelerated with fixation of the coefficients during iterations and their approximate decomposition further speeds up the computation. We show that this fixed-coefficient iterative bilateral filter is an alternative solver for optimization problems in graph-based data analyses and apply its fast algorithm to graph-based image processing tasks. Performance of the present algorithm is demonstrated with experiments of contrast enhancement and smoothing of images using cross bilateral filters, in addition to semi-supervised image segmentation and colorization of monochromatic images.
KeywordsInput Image Fast Algorithm Spectral Cluster Bilateral Filter Monochromatic Image
- 4.Tomasi, C., Manduchi, R.: Bilateral filtering for gray and color images. In: Proc. ICCV, pp. 839–846 (1998)Google Scholar
- 5.Belkin, P.M., Niyogi, P.: Laplacian eigenmaps and spectral techniques for embedding and clustering. In: Proc. NIPS, pp. 585–591 (2001)Google Scholar
- 6.Wang, F., Zhang, C.: Label propagation through linear neighborhoods. In: Proc. ICML, pp. 985–992 (2006)Google Scholar
- 8.Levin, A., Rav-Acha, A., Lischinski, D.: Spectral matting. In: Proc. CVPR, pp. 1–8 (2007)Google Scholar