Optimal fractional fourier filtering for graph signals
Date
2021-05-19Source Title
IEEE Transactions on Signal Processing
Print ISSN
1053-587X
Electronic ISSN
1941-0476
Publisher
IEEE
Volume
69
Pages
2902 - 2912
Language
English
Type
ArticleItem Usage Stats
34
views
views
150
downloads
downloads
Abstract
Graph signal processing has recently received considerable attention. Several concepts, tools, and applications in signal processing such as filtering, transforming, and sampling have been extended to graph signal processing. One such extension is the optimal filtering problem. The minimum mean-squared error estimate of an original graph signal can be obtained from its distorted and noisy version. However, the best separation of signal and noise, and thus the least error, is not always achieved in the ordinary Fourier domain, but rather a fractional Fourier domain. In this work, the optimal filtering problem for graph signals is extended to fractional Fourier domains, and theoretical analysis and solution of the proposed problem are provided along with computational cost considerations. Numerical results are presented to illustrate the benefits of filtering in fractional Fourier domains.
Keywords
Fractional Fourier transformGraph signal processing (GSP)
Optimal filtering
Wiener filter
Graph Fourier transform (GFT)
Signal processing on graphs
Graphs
Permalink
http://hdl.handle.net/11693/76931Published Version (Please cite this version)
https://doi.org/10.1109/TSP.2021.3079804Collections
Related items
Showing items related by title, author, creator and subject.
-
Exploiting locality in sparse matrix-matrix multiplication on many-core rchitectures
Akbudak K.; Aykanat, Cevdet (IEEE Computer Society, 2017)Exploiting spatial and temporal localities is investigated for efficient row-by-row parallelization of general sparse matrix-matrix multiplication (SpGEMM) operation of the form C=A,B on many-core architectures. Hypergraph ... -
CoSEP: a compound spring embedder layout algorithm with support for ports
Okka, Alihan; Doğrusöz, Uğur; Balcı, Hasan (Sage Publications, 2021-07-01)This paper describes a new automatic layout algorithm named CoSEP for compound graphs with port constraints. The algorithm works by extending the physical model of a previous algorithm named CoSE by defining additional ... -
A compound graph layout algorithm with support for ports
Okka, Alihan (Bilkent University, 2020-10)Information visualization is a eld of study that aims to represent abstract data in an aesthetically pleasing and easy to comprehend visual manner. Various approaches and standards have been created to reinforce the ...