Learning Graph Signal Representations with Narrowband Spectral Kernels

Date

2022-01-01

Author

Kar, Osman Furkan
Turhan, Gülce
Vural, Elif

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

154
views

0
downloads

In this work, we study the problem of learning graph dictionary models from partially observed graph signals. We represent graph signals in terms of atoms generated by narrowband graph kernels. We formulate an optimization problem where the kernel parameters are learnt jointly with the signal representations under a triple regularization scheme: While the first regularization term aims to control the spectrum of the narrowband kernels, the second term encourages the reconstructed graph signals to vary smoothly on the graph, and the third term enforces that similar graph signals have similar representations over the learnt dictionaries. Once the graph kernels and signal representations are learnt, the initially unknown values of the signals are estimated based on the computed model. Experimental results show that the proposed method gives significant improvements in the estimation performance compared to reference approaches.

Subject Keywords

graph dictionary learning, graph kernels, graph regularization, Graph signal processing, narrow-band kernels

URI

https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85142681215&origin=inward
https://hdl.handle.net/11511/101630

DOI

https://doi.org/10.1109/mlsp55214.2022.9943514

Conference Name

32nd IEEE International Workshop on Machine Learning for Signal Processing, MLSP 2022

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Estimation of Time-Varying Graph Signals by Learning Graph Dictionaries Zamanda Deǧişen Graf Sinyallerinin Kestirimi için Graflarda Sözlük Öǧrenme Acar, Abdullah Burak; Vural, Elif (2022-01-01) We study the problem of estimating time-varying graph signals from missing observations. We propose a method based on learning graph dictionaries specified by a set of time-vertex kernels in the joint spectral domain. The parameters of the time-vertex kernels are optimized jointly with the sparse representation coefficients of the signals, so that the learnt representation fits well to the available observations of the time-vertex signals at hand. The missing observations of the signals are then estimated b...
Learning Time-Vertex Dictionaries for Estimating Time-Varying Graph Signals Acar, Abdullah Burak; Vural, Elif (2022-01-01) In this work, we study the problem of learning time-vertex dictionaries for the modeling and estimation of time-varying graph signals. We consider a setting with a collection of partially observed time-varying graph signals, and propose a solution for the estimation of the missing signal observations by learning time-vertex dictionaries from the available observations. We adopt a time-vertex dictionary model defined through a set of joint time-vertex spectral kernels, each of which captures a different spec...
Estimation of partially observed multiple graph signals by learning spectrally concentrated graph kernels Turhan, Gülce; Vural, Elif; Department of Electrical and Electronics Engineering (2021-3-31) Graph models provide flexible tools for the representation and analysis of signals defined over domains such as social or sensor networks. However, in real applications data observations are often not available over the whole graph, due to practical problems such as broken sensors, connection loss, or storage problems. In this thesis, we study the problem of estimating partially observed graph signals on multiple graphs. We consider possibly multiple graph domains over which a set of signals is available wi...
Learning Narrowband Graph Spectral Kernels for Graph Signal Estimation Çizge Sinyallerinin Dar Bantli Spektral Kernel Öǧrenimi ile Kestirimi Furkan Kar, Osman; Turhan, Gülce; Vural, Elif (2022-01-01) In this work, we study the problem of estimating graph signals from incomplete observations. We propose a method that learns the spectrum of the graph signal collection at hand by fitting a set of narrowband graph kernels to the observed signal values. The unobserved graph signal values are then estimated using the sparse representations of the signals in the graph dictionary formed by the learnt kernels. Experimental results on graph data sets show that the proposed method compares favorably to baseline gr...
Towards a systematic understanding of graphical cues in communication through statistical graphs Acartürk, Cengiz (2014-04-01) Statistical graphs in particular, line graphs and bar graphs are efficient means of communication in a wide range of non-expert settings. In communication settings, statistical graphs do not only serve as visualizations of individual data points but also provide visual access to various aspects of the information contained in data. Moreover, specific types of graphs are better means for providing visual access to certain aspects of data. For instance, trend information is visually conveyed through line grap...

Citation Formats

O. F. Kar, G. Turhan, and E. Vural, “Learning Graph Signal Representations with Narrowband Spectral Kernels,” Xian, Çin, 2022, vol. 2022-August, Accessed: 00, 2023. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85142681215&origin=inward.