Optimal fractional fourier filtering for graph signals

Simple item page
buir.contributor.authorÖztürk, Cüneyd
buir.contributor.authorÖzaktaş, Haldun M.
buir.contributor.authorGezici, Sinan
buir.contributor.authorKoç, Aykut
buir.contributor.orcidÖztürk, Cüneyd|0000-0003-3792-9844
buir.contributor.orcidGezici, Sinan|0000-0002-6369-3081
buir.contributor.orcidKoç, Aykut|0000-0002-6348-2663
dc.citation.epage2912en_US
dc.citation.spage2902en_US
dc.citation.volumeNumber69en_US
dc.contributor.authorÖztürk, Cüneyd
dc.contributor.authorÖzaktaş, Haldun M.
dc.contributor.authorGezici, Sinan
dc.contributor.authorKoç, Aykut
dc.date.accessioned2022-02-01T06:37:35Z
dc.date.available2022-02-01T06:37:35Z
dc.date.issued2021-05-19
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.description.abstractGraph 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.en_US
dc.description.provenanceSubmitted by Evrim Ergin (eergin@bilkent.edu.tr) on 2022-02-01T06:37:34Z No. of bitstreams: 1 Optimal_fractional_fourier_filtering_for_graph_signals.pdf: 773055 bytes, checksum: 0b8947d68601152a6cc91450bfd944aa (MD5)en
dc.description.provenanceMade available in DSpace on 2022-02-01T06:37:35Z (GMT). No. of bitstreams: 1 Optimal_fractional_fourier_filtering_for_graph_signals.pdf: 773055 bytes, checksum: 0b8947d68601152a6cc91450bfd944aa (MD5) Previous issue date: 2021-05-19en
dc.identifier.doi10.1109/TSP.2021.3079804en_US
dc.identifier.eissn1941-0476
dc.identifier.issn1053-587X
dc.identifier.urihttp://hdl.handle.net/11693/76931
dc.language.isoEnglishen_US
dc.publisherIEEEen_US
dc.relation.isversionofhttps://doi.org/10.1109/TSP.2021.3079804en_US
dc.source.titleIEEE Transactions on Signal Processingen_US
dc.subjectFractional Fourier transformen_US
dc.subjectGraph signal processing (GSP)en_US
dc.subjectOptimal filteringen_US
dc.subjectWiener filteren_US
dc.subjectGraph Fourier transform (GFT)en_US
dc.subjectSignal processing on graphsen_US
dc.subjectGraphsen_US
dc.titleOptimal fractional fourier filtering for graph signalsen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Optimal_fractional_fourier_filtering_for_graph_signals.pdf
Size:
754.94 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.69 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Scholarly Publications - Electrical and Electronics Engineering