Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 473-484 |
Number of pages | 12 |
Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
Volume | 5414 LNCS |
DOIs | |
Publication status | Published - 2009 |
Event | 3rd Pacific Rim Symposium on Image and Video Technology, PSIVT 2009 - Tokyo, Japan Duration: Jan 13 2009 → Jan 16 2009 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)