Improvements on "Fast space-variant elliptical filtering using box splines"

Details Improvements on "Fast space-variant elliptical filtering using box splines" Improvements on "Fast space-variant elliptical filtering using box splines"

2011-09-23

arxiv.org/abs/1109.5114v3

Computer Science

Computer Vision and Pattern Recognition

7 figures

Scientific paper

It is well-known that box filters can be efficiently computed using pre-integrations and local finite-differences [Crow1984,Heckbert1986,Viola2001]. By generalizing this idea and by combining it with a non-standard variant of the Central Limit Theorem, a constant-time or O(1) algorithm was proposed in [Chaudhury2010] that allowed one to perform space-variant filtering using Gaussian-like kernels. The algorithm was based on the observation that both isotropic and anisotropic Gaussians could be approximated using certain bivariate splines called box splines. The attractive feature of the algorithm was that it allowed one to continuously control the shape and size (covariance) of the filter, and that it had a fixed computational cost per pixel, irrespective of the size of the filter. The algorithm, however, offered a limited control on the covariance and accuracy of the Gaussian approximation. In this work, we propose some improvements by appropriately modifying the algorithm in [Chaudhury2010].

Affiliated with

Also associated with

No associations

Rating

Improvements on "Fast space-variant elliptical filtering using box splines" does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Improvements on "Fast space-variant elliptical filtering using box splines", we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improvements on "Fast space-variant elliptical filtering using box splines" will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-724331