A spectral graph wiener filter in graph fourier domain for improved image denoising
Abstract
A Wiener filtering scheme in graph Fourier domain is proposed for improving image denoising performance achieved by various spectral graph based denoising methods. The proposed Wiener filter is estimated by using graph Fourier coefficients of the noisy image after they are processed for denoising, to further improve the already achieved denoising accuracy as a post-processing step. It can be estimated from and applied to the entire image, or can be used patchwise in a locally adaptive manner. Our results indicate that the proposed step yields consistent accuracy improvement for different choices of weighted adjacency and graph Laplacian matrices used in computing the graph Fourier transform and for different processing methods used to denoise obtained transform coefficients. We obtain higher peak signal-to-noise ratio values than the BM3D method for some images
Source
2016 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2016 - ProceedingsCollections
- Bildiri Koleksiyonu [355]
- Scopus İndeksli Yayınlar Koleksiyonu [8325]
Related items
Showing items related by title, author, creator and subject.
-
Tube Formulas for Graph-Directed Fractals
Demir, Bünyamin; Deniz, Ali; Koçak, Şahin; Üreyen, Adem Ersin (World Scientific Publ Co Pte LTD, 2010)Lapidus and Pearse proved recently an interesting formula about the volume of tubular neighborhoods of fractal sprays, including the self-similar fractals. We consider the graph-directed fractals in the sense of graph ... -
GAME CHROMATIC NUMBER OF (WnP2)-P-center dot center dot
Akcan, Ummahan; Akyar, Emrah; Akyar, Handan (Editura Bibliotheca-Bibliotheca Publ House, 2016)In this paper we find an exact value for the game chromatic number of the Cartesian product graph (WnP2)-P-center dot center dot of two graphs, n-wheel W-n and the path graph P-2. This extends a previous work of Sia on the ... -
Euclidean realizations of Mauldin-Williams graphs
Graph-directed fractals are collections of metric spaces, each of which can be expressed as a union of several scaled copies of spaces from the collection. They give rise to weighted, directed graphs where the term comes ...