A signal processing approach to fair surface design
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
SUSAN—A New Approach to Low Level Image Processing
International Journal of Computer Vision
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
Using Spin Images for Efficient Object Recognition in Cluttered 3D Scenes
IEEE Transactions on Pattern Analysis and Machine Intelligence
Implicit fairing of irregular meshes using diffusion and curvature flow
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Fast bilateral filtering for the display of high-dynamic-range images
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
IEEE Transactions on Pattern Analysis and Machine Intelligence
Weighted Importance Sampling Techniques for Monte Carlo Radiosity
Proceedings of the Eurographics Workshop on Rendering Techniques 2000
Non-Linear Gaussian Filters Performing Edge Preserving Diffusion
Mustererkennung 1995, 17. DAGM-Symposium
Non-iterative, feature-preserving mesh smoothing
ACM SIGGRAPH 2003 Papers
ACM SIGGRAPH 2003 Papers
Bilateral Filtering for Gray and Color Images
ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
Improved Fast Gauss Transform and Efficient Kernel Density Estimation
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Digital photography with flash and no-flash image pairs
ACM SIGGRAPH 2004 Papers
Flash photography enhancement via intrinsic relighting
ACM SIGGRAPH 2004 Papers
Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing
A Non-Local Algorithm for Image Denoising
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
Robust moving least-squares fitting with sharp features
ACM SIGGRAPH 2005 Papers
Video enhancement using per-pixel virtual exposures
ACM SIGGRAPH 2005 Papers
IEEE Transactions on Visualization and Computer Graphics
Smoothing by Example: Mesh Denoising by Averaging with Similarity-Based Weights
SMI '06 Proceedings of the IEEE International Conference on Shape Modeling and Applications 2006
Fast median and bilateral filtering
ACM SIGGRAPH 2006 Papers
GPU Computing: Programming a Massively Parallel Processor
Proceedings of the International Symposium on Code Generation and Optimization
Real-time edge-aware image processing with the bilateral grid
ACM SIGGRAPH 2007 papers
Nonlocal Image and Movie Denoising
International Journal of Computer Vision
Real-time KD-tree construction on graphics hardware
ACM SIGGRAPH Asia 2008 papers
What Is a Good Nearest Neighbors Algorithm for Finding Similar Patches in Images?
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
A fast approximation of the bilateral filter using a signal processing approach
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part IV
Efficient Nonlocal Means for Denoising of Textural Patterns
IEEE Transactions on Image Processing
Efficient affinity-based edit propagation using K-D tree
ACM SIGGRAPH Asia 2009 papers
ACM SIGGRAPH 2010 papers
RepFinder: finding approximately repeated scene elements for image editing
ACM SIGGRAPH 2010 papers
Smoothed local histogram filters
ACM SIGGRAPH 2010 papers
Accelerating spatially varying Gaussian filters
ACM SIGGRAPH Asia 2010 papers
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part I
Fast covariance computation and dimensionality reduction for sub-window features in images
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part II
Self-similarity-based image denoising
Communications of the ACM
Domain transform for edge-aware image and video processing
ACM SIGGRAPH 2011 papers
Multidimensional image retargeting
SIGGRAPH Asia 2011 Courses
Adaptive manifolds for real-time high-dimensional filtering
ACM Transactions on Graphics (TOG) - SIGGRAPH 2012 Conference Proceedings
A Low-Memory, Straightforward and Fast Bilateral Filter Through Subsampling in Spatial Domain
Computer Graphics Forum
Coherent Spatiotemporal Filtering, Upsampling and Rendering of RGBZ Videos
Computer Graphics Forum
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part I
A sparse control model for image and video editing
ACM Transactions on Graphics (TOG)
Boosting monte carlo rendering by ray histogram fusion
ACM Transactions on Graphics (TOG)
Automatic objects segmentation with RGB-D cameras
Journal of Visual Communication and Image Representation
Hi-index | 0.02 |
We propose a method for accelerating a broad class of non-linear filters that includes the bilateral, non-local means, and other related filters. These filters can all be expressed in a similar way: First, assign each value to be filtered a position in some vector space. Then, replace every value with a weighted linear combination of all values, with weights determined by a Gaussian function of distance between the positions. If the values are pixel colors and the positions are (x, y) coordinates, this describes a Gaussian blur. If the positions are instead (x, y, r, g, b) coordinates in a five-dimensional space-color volume, this describes a bilateral filter. If we instead set the positions to local patches of color around the associated pixel, this describes non-local means. We describe a Monte-Carlo kd-tree sampling algorithm that efficiently computes any filter that can be expressed in this way, along with a GPU implementation of this technique. We use this algorithm to implement an accelerated bilateral filter that respects full 3D color distance; accelerated non-local means on single images, volumes, and unaligned bursts of images for denoising; and a fast adaptation of non-local means to geometry. If we have n values to filter, and each is assigned a position in a d-dimensional space, then our space complexity is O(dn) and our time complexity is O(dn log n), whereas existing methods are typically either exponential in d or quadratic in n.