ACM Home Page
Please provide us with feedback. Feedback
Gaussian KD-trees for fast high-dimensional filtering
Full text PdfPdf (9.84 MB)
Source
ACM Transactions on Graphics (TOG) archive
Volume 28 ,  Issue 3  (August 2009) table of contents
Proceedings of ACM SIGGRAPH 2009
SESSION: Fast image processing and retargeting table of contents
Article No. 21  
Year of Publication: 2009
ISSN:0730-0301
Also published in ...
Authors
Andrew Adams  Stanford University
Natasha Gelfand  Nokia Research
Jennifer Dolson  Stanford University
Marc Levoy  Stanford University
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 194,   Downloads (12 Months): 518,   Citation Count: 0
Additional Information:

appendices and supplements   abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1531326.1531327
What is a DOI?

APPENDICES and SUPPLEMENTS
Supplemental material for Gaussian KD-Trees for Fast High-Dimensional Filtering. Contact abadams@stanford.edu for any questions about this data.


ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Adams, A., Gelfand, N., and Pulli, K. 2008. Viewfinder alignment. Computer Graphics Forum (Proc. Eurographics) 27, 2, 597--606.
 
2
Amat, F., Moussavi, F., Comolli, L., Elidan, G., Downing, K., and Horowitz, M. 2008. Markov random field based automatic image alignment for electron tomography. Journal of Structural Biology (March), 260--275.
3
 
4
 
5
Avanaki, A. N. 2006. A spatiotemporal edge-preserving denoising method for high-quality video. Signal Processing and Information Technology, 2006 IEEE International Symposium on (Aug.), 157--161.
 
6
7
 
8
Brox, T., Kleinschmidt, O., and Cremers, D. 2008. Efficient nonlocal means for denoising of textural patterns. Image Processing, IEEE Transactions on 17, 7 (July), 1083--1092.
 
9
 
10
 
11
12
 
13
 
14
15
16
17
18
 
19
20
 
21
 
22
Paris, S., and Durand, F. 2006. A fast approximation of the bilateral filter using a signal processing approach. In Proc. ECCV 06.
 
23
 
24
25
 
26
Sheffer, A., Praun, E., and Rose, K. 2006. Mesh Parameterization Methods and Their Applications. Now Publishers.
 
27
28
29
 
30
Telleen, J., Sullivan, A., Yee, J., Wang, O., Gunawardane, P., Collins, I., and Davis, J. 2007. Synthetic shutter speed imaging. Computer Graphics Forum (Proc. Eurographics) 26, 3, 591--598.
 
31
32
 
33
 
34
35

Collaborative Colleagues:
Andrew Adams: colleagues
Natasha Gelfand: colleagues
Jennifer Dolson: colleagues
Marc Levoy: colleagues