Estimation of partially observed multiple graph signals by learning spectrally concentrated graph kernels

Download

12626314.pdf

Date

2021-3-31

Author

Turhan, Gülce

Metadata

Show full item record

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

Item Usage Stats

366
views

214
downloads

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 with missing observations. We study the problem of learning a graph signal model that allows an accurate estimation of the missing observations. The proposed method is based on learning a sparse representation of the graph signals over spectrally characterized graph dictionaries. The dictionary on each graph consists of a set of spectrally concentrated, narrowband graph atoms localized at different graph nodes. We formulate the dictionary learning problem in the spectral domain, as opposed to the vertex domain, which provides the flexibility of incorporating signals from more than one graph in the learning. The learnt dictionaries consist of several sub-dictionaries, where each sub-dictionary consists of atoms with a spectrum concentrated at a certain graph frequency, so that each sub-dictionary captures a different spectral component of the graph signals at hand. We approximate the narrowband graph spectra with Gaussian kernels, the parameters of which are learnt jointly with the sparse coefficients of the graph signals. The resulting optimization problem is solved with an alternating optimization approach. Finally, the incomplete entries of the given graph signals are estimated using the learnt dictionaries and sparse coefficients. Experimental results on synthetic graph data sets suggest that the proposed method has promising performance in comparison to baseline solutions.

Subject Keywords

Sparse representation, Graph signal processing, Dictionary learning, Graph kernels, Multiple graph domains, Optimization

URI

https://hdl.handle.net/11511/89694

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Estimating Partially Observed Graph Signals by Learning Spectrally Concentrated Graph Kernels Turhan, Gulce; Vural, Elif (2021-01-01) © 2021 IEEE.Graph models provide flexible tools for the representation and analysis of signals defined over irregular 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 sensor failure or connection loss. In this paper, we study the estimation of partially observed graph signals on multiple graphs. We learn a sparse representation of partially observed graph signals over spectrally concentr...
ESTIMATION OF TIME VARYING GRAPH SIGNALS WITH GRAPH ARMA PROCESSES Güneyi, Eylem Tuğçe; Vural, Elif; Department of Electrical and Electronics Engineering (2021-9-8) Graph models provide efficient tools for analyzing data defined over irregular domains such as social networks, sensor networks, and transportation networks. Real-world graph signals are usually time-varying signals. The characterization of the joint behavior of time-varying graph signals in the time and the vertex domains has recently arisen as an interesting research problem, contrasted to the independent processing of graph signals acquired at different time instants. The concept of wide sense stationari...
Investigation of haptic line graph comprehension through co production of gesture and language Deniz, Ozan; Mehmetcan, Fal; Acartürk, Cengiz (null; 2013-06-30) In communication settings, statistical graphs accompany language by providing visual access to various aspects of domain entities, such as conveying information about trends. A similar and comparable means for providing perceptual access is to provide haptic graphs for blind people. In this study, we present the results of an experimental study that aimed to investigate visual line graphs and haptic line graphs in time domain by means of gesture production as an indicator of event conceptualization. The par...
Learning Graph Signal Representations with Narrowband Spectral Kernels Kar, Osman Furkan; Turhan, Gülce; Vural, Elif (2022-01-01) 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 smoot...
Estimation of Locally Stationary Graph Processes from Incomplete Realizations Canbolat, Abdullah; Vural, Elif (2022-01-01) Stationarity is a well-studied concept in signal processing and the concept of stationary random processes has been extended to graph domains in several recent works. Meanwhile, in many scenarios a globally stationary process model may fail to accurately represent the correlation patterns of the data on the whole graph, e.g. when data is acquired on big graphs or when the behavior of the process varies significantly throughout the graph. In this work, we first propose a locally stationary graph process mode...

Citation Formats

G. Turhan, “Estimation of partially observed multiple graph signals by learning spectrally concentrated graph kernels,” M.S. - Master of Science, Middle East Technical University, 2021.