Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Estimating Partially Observed Graph Signals by Learning Spectrally Concentrated Graph Kernels
Date
2021-01-01
Author
Turhan, Gulce
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
151
views
0
downloads
Cite This
© 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 concentrated graph dictionaries. Our dictionary model consists of several sub-dictionaries each of which is generated from a Gaussian kernel centered at a certain graph frequency in order to capture a particular spectral component of the graph signals at hand. The problem of jointly learning the spectral kernels and the sparse codes is solved with an alternating optimization approach. Finally, the incomplete entries of the given graph signals are estimated using the learnt dictionaries and the sparse coefficients. Experimental results on synthetic and real graph data sets suggest that the proposed method yields promising performance in comparison to reference solutions.
Subject Keywords
Graph dictionary learning
,
graph signal processing
,
sparse representations
,
graph kernels
,
multiple graph domains
,
Graph dictionary learning
,
graph kernels
,
graph signal processing
,
multiple graph domains
,
sparse representations
URI
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85122833384&origin=inward
https://hdl.handle.net/11511/99167
DOI
https://doi.org/10.1109/mlsp52302.2021.9596282
Conference Name
31st IEEE International Workshop on Machine Learning for Signal Processing, MLSP 2021
Collections
Department of Electrical and Electronics Engineering, Conference / Seminar
Suggestions
OpenMETU
Core
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...
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...
An Approach for introducing a set of domain specific components
Yiğit, İbrahim Onuralp; Doğru, Ali Hikmet; Department of Computer Engineering (2015)
In this thesis, a preliminary methodology is proposed for the determination of a set of components to populate the domain model of a Software Product Line infrastructure. Software Product Line based approaches focus on the reusability of assets for a family of software products. For effective reuse, the definition of reusable assets in this thesis considers variability in a domain. The approach is based on variability specifications that is rooted in Feature Models and is reflected to a component modeling n...
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...
Data integration over horizontally partitioned databases in service-oriented data grids
Sunercan, Hatice Kevser Sönmez; Çiçekli, Fehime Nihan; Alpdemir, Mahmut Nedim; Department of Computer Engineering (2010)
Information integration over distributed and heterogeneous resources has been challenging in many terms: coping with various kinds of heterogeneity including data model, platform, access interfaces; coping with various forms of data distribution and maintenance policies, scalability, performance, security and trust, reliability and resilience, legal issues etc. It is obvious that each of these dimensions deserves a separate thread of research efforts. One particular challenge among the ones listed above tha...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
G. Turhan and E. Vural, “Estimating Partially Observed Graph Signals by Learning Spectrally Concentrated Graph Kernels,” Gold-Coast, Avustralya, 2021, vol. 2021-October, Accessed: 00, 2022. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85122833384&origin=inward.