Abstract
We present a novel approach for rapid numerical approximation of convolutions with filters of large support. Our approach consists of a multiscale scheme, fashioned after the wavelet transform, which computes the approximation in linear time. Given a specific large target filter to approximate, we first use numerical optimization to design a set of small kernels, which are then used to perform the analysis and synthesis steps of our multiscale transform. Once the optimization has been done, the resulting transform can be applied to any signal in linear time. We demonstrate that our method is well suited for tasks such as gradient field integration, seamless image cloning, and scattered data interpolation, outperforming existing state-of-the-art methods.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design
Reference28 articles.
1. Efficient gradient-domain compositing using quadtrees
2. Fourier Analysis of the 2D Screened Poisson Equation for Gradient Domain Problems
3. Brigham E. O. 1988. The fast Fourier transform and its applications. Prentice-Hall Inc. Upper Saddle River NJ USA. Brigham E. O. 1988. The fast Fourier transform and its applications . Prentice-Hall Inc. Upper Saddle River NJ USA.
4. The Laplacian Pyramid as a Compact Image Code
5. Fast filter transform for image processing
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献