Fast multi-scale detail decomposition via accelerated iterative shrinkage

Authors:
Hicham Badri;Hussein Yahia;Driss Aboutajdine
Affiliations:
INRIA, Geostat team, Talence Cedex, France;INRIA, Geostat team, Talence Cedex, France;Mohammed V-Agdal University, Rabat, Morocco
Venue:
SIGGRAPH Asia 2013 Technical Briefs
Year:
2013

Citing 12
Cited 0

Fast bilateral filtering for the display of high-dynamic-range images

Proceedings of the 29th annual conference on Computer graphics and interactive techniques
A Fundamental Relationship between Bilateral Filtering, Adaptive Smoothing, and the Nonlinear Diffusion Equation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Iterative Methods for Sparse Linear Systems

Iterative Methods for Sparse Linear Systems
Bilateral Filtering for Gray and Color Images

ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
Edge-preserving decompositions for multi-scale tone and detail manipulation

ACM SIGGRAPH 2008 papers
Fourier Analysis of the 2D Screened Poisson Equation for Gradient Domain Problems

ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part II
A Fast Approximation of the Bilateral Filter Using a Signal Processing Approach

International Journal of Computer Vision
Edge-avoiding wavelets and their applications

ACM SIGGRAPH 2009 papers
Edge-preserving multiscale image decomposition based on local extrema

ACM SIGGRAPH Asia 2009 papers
Domain transform for edge-aware image and video processing

ACM SIGGRAPH 2011 papers
Image smoothing via L0 gradient minimization

Proceedings of the 2011 SIGGRAPH Asia Conference
A Low-Memory, Straightforward and Fast Bilateral Filter Through Subsampling in Spatial Domain

Computer Graphics Forum

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a fast solution for performing multi-scale detail decomposition. The proposed method is based on an accelerated iterative shrinkage algorithm, able to process high definition color images in real-time on modern GPUs. Our strategy to accelerate the smoothing process is based on the use of first order proximal operators. We use the approximation to both designing suitable shrinkage operators as well as deriving a proper warm-start solution. The method supports full color filtering and can be implemented efficiently and easily on both the CPU and the GPU. We demonstrate the performance of the proposed approach on fast multi-scale detail manipulation of low and high dynamic range images and show that we get good quality results with reduced processing time.