Accurate and efficient method for smoothly space-variant Gaussian blurring

Authors:
Timothy Popkin;Andrea Cavallaro;David Hands
Affiliations:
Queen Mary University of London, U.K.;Queen Mary University of London, U.K.;Queen Mary University of London, U.K.
Venue:
IEEE Transactions on Image Processing
Year:
2010

Citing 11
Cited 1

Numerical recipes in C (2nd ed.): the art of scientific computing

Numerical recipes in C (2nd ed.): the art of scientific computing
Space variant image processing

International Journal of Computer Vision
Digital Signal Processing Handbook

Digital Signal Processing Handbook
Summed-area tables for texture mapping

SIGGRAPH '84 Proceedings of the 11th annual conference on Computer graphics and interactive techniques
Robust Real-Time Face Detection

International Journal of Computer Vision
Performance of three recursive algorithms for fast space-variant Gaussian filtering

Real-Time Imaging
Distance blurring for space-variant image coding

ICASSP '09 Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing
Acuity-matching resolution degradation through wavelet coefficient scaling

IEEE Transactions on Image Processing
Foveated video compression with optimal rate control

IEEE Transactions on Image Processing
Automatic foveation for video compression using a neurobiological model of visual attention

IEEE Transactions on Image Processing
Fast algorithms for foveated video processing

IEEE Transactions on Circuits and Systems for Video Technology

Fast restoration of nonuniform blurred images

IScIDE'12 Proceedings of the third Sino-foreign-interchange conference on Intelligent Science and Intelligent Data Engineering

Quantified Score

Hi-index	0.02

Visualization

Abstract

This paper presents a computationally efficient algorithm for smoothly space-variant Gaussian blurring of images. The proposed algorithm uses a specialized filter bank with optimal filters computed through principal component analysis. This filter bank approximates perfect space-variant Gaussian blurring to arbitrarily high accuracy and at greatly reduced computational cost compared to the brute force approach of employing a separate low-pass filter at each image location. This is particularly important for spatially variant image processing such as foveated coding. Experimental results show that the proposed algorithm provides typically 10 to 15 dB better approximation of perfect Gaussian blurring than the blended Gaussian Pyramid blurring approach when using a bank of just eight filters.