Sciweavers

EUROGRAPHICS
2010
Eurographics

Fast High-Dimensional Filtering Using the Permutohedral Lattice

14 years 8 months ago
Fast High-Dimensional Filtering Using the Permutohedral Lattice
Many useful algorithms for processing images and geometry fall under the general framework of high-dimensional Gaussian filtering. This family of algorithms includes bilateral filtering and non-local means. We propose a new way to perform such filters using the permutohedral lattice, which tessellates high-dimensional space with uniform simplices. Our algorithm is the first implementation of a high-dimensional Gaussian filter that is both linear in input size and polynomial in dimensionality. Furthermore it is parameter-free, apart from the filter size, and achieves a consistently high accuracy relative to ground truth (> 45 dB). We use this to demonstrate a number of interactive-rate applications of filters in as high as eight dimensions. Categories and Subject Descriptors (according to ACM CCS): I.4.3 [Image Processing and Computer Vision]: Enhancement—Filtering
Andrew Adams, Jongmin Baek, Myers Abraham Davis
Added 11 Mar 2010
Updated 15 Mar 2010
Type Conference
Year 2010
Where EUROGRAPHICS
Authors Andrew Adams, Jongmin Baek, Myers Abraham Davis
Comments (0)