Graph spectral image smoothing using the heat kernel
By Fan Zhang, Edwin Robert Hancock. 2008
186 citations recorded by the source corpus.
Subfields: Computer Vision and Pattern Recognition, Media Technology, Graph Learning
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Vision and Pattern Recognition
- Pierre Vandergheynst
- Antonio Ortega
- David I. Shuman
- Nathanael Perraudin
- Pascal Frossard
- Vassilis Kalofolias
- Sunil K. Narang
- Daniel Kressner
In Media Technology
- Antonio Ortega
- Pierre Vandergheynst
- David I. Shuman
- Pascal Frossard
- Sunil K. Narang
- Nathanael Perraudin
- Vassilis Kalofolias
- Karthik Raoaroor
In Graph Learning
- Pierre Vandergheynst
- Pascal Frossard
- Nathanael Perraudin
- Antonio Ortega
- David I. Shuman
- Sunil K. Narang
- David K. Hammond
- Vassilis Kalofolias
Citations in the corpus
- The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains (2012, methodology): “This method is a variant of the graph-based anisotropic diffusion image smoothing method of [11].”
- Accelerated filtering on graphs using Lanczos method (2015, background): “For instance, many applications in image processing benefit from the use of graphs that describe connections between local patches in the image (e.g. [ 13, 22] and references therein).”
- GSPBOX: A toolbox for signal processing on graphs (2014, background): “Parameters allow the resulting graph to vary between local and non-local and to use different distance functions [12, 4].”
- Image denoising with nonlocal spectral graph wavelets (2010, methodology): “Zhang and Hancock studied image smoothing using the heat kernel corresponding to the graph Laplacian, using a graph whose edge weights depended on the difference of local neighboring windows [10].”