Name
Abstract | ||
|---|---|---|
In this work we introduce a new image editing tool, based on the spectrum of a global filter computed from image affinities. Recently, we have shown that the global filter derived from a fully connected graph representing the image, can be approximated using the Nyström extension [1]. This filter is computed by approximating the leading eigenvectors of the filter. These orthonormal eigenfunctions are highly expressive of the coarse and fine details in the underlying image, where each eigenvector can be interpreted as one scale of a data-dependent multiscale image decomposition. In this filtering scheme, each eigenvalue can boost or suppress the corresponding signal component in each scale. Our analysis shows that the mapping of the eigenvalues by an appropriate polynomial function endows the filter with a number of important capabilities, such as edge-aware sharpening, denoising and tone manipulation. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/GlobalSIP.2013.6737005 | Global Conference Signal and Information Processing |
Keywords | Field | DocType |
eigenvalues and eigenfunctions,graph theory,image representation,matrix algebra,polynomials,Nyström extension,affinity matrices spectrum,data-dependent multiscale image decomposition,denoising,edge-aware sharpening,eigenvalues mapping,filter eigenvector,global filter spectrum,global image editing,graph,image affinities,image representation,orthonormal eigenfunctions,polynomial function,tone manipulation,Image Editing,Image Filtering,Nyström Extension | Noise reduction,Sharpening,Discrete mathematics,Polynomial,Matrix (mathematics),Image editing,Filter (signal processing),Algorithm,Orthonormal basis,Eigenvalues and eigenvectors,Mathematics | Conference |
ISSN | Citations | PageRank |
2376-4066 | 1 | 0.36 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hossein Talebi | 1 | 37 | 3.61 |
| Peyman Milanfar | 2 | 3284 | 155.61 |
| Talebi, H. | 3 | 1 | 0.36 |