Fast High-Dimensional Filtering Using the Permutohedral Lattice
Andrew Adams, Jongmin Baek, Myers Abraham Davis
In Computer Graphics Forum, 29(2), 2010.
Abstract: 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.
Keyword(s): I.4.3 [Image Processing and Computer Vision]: Enhancement—Filtering
@article{CGF:CGF1645,
author = {Andrew Adams and Jongmin Baek and Myers Abraham Davis},
title = {Fast High-Dimensional Filtering Using the Permutohedral Lattice},
journal = {Computer Graphics Forum},
volume = {29},
number = {2},
pages = {753--762},
year = {2010},
}
Return to the search page.
graphbib: Powered by "bibsql" and "SQLite3."