Learning Narrowband Graph Spectral Kernels for Graph Signal Estimation Çizge Sinyallerinin Dar Bantli Spektral Kernel Öǧrenimi ile Kestirimi

Date

2022-01-01

Author

Furkan Kar, Osman
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

162
views

0
downloads

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 graph-based semi-supervised regression solutions.

Subject Keywords

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

URI

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

DOI

https://doi.org/10.1109/siu55565.2022.9864966

Conference Name

30th Signal Processing and Communications Applications Conference, SIU 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 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...
Ant Colony Optimization based clustering methodology İNKAYA, TÜLİN; Kayaligil, Sinan; Özdemirel, Nur Evin (Elsevier BV, 2015-03-01) In this work we consider spatial clustering problem with no a priori information. The number of clusters is unknown, and clusters may have arbitrary shapes and density differences. The proposed clustering methodology addresses several challenges of the clustering problem including solution evaluation, neighborhood construction, and data set reduction. In this context, we first introduce two objective functions, namely adjusted compactness and relative separation. Each objective function evaluates the cluste...
A quadtree-based adaptively-refined cartesian-grid algorithm for solution of the euler equations Bulkök, Murat; Aksel, Mehmet Haluk; Department of Mechanical Engineering (2005) A Cartesian method for solution of the steady two-dimensional Euler equations is produced. Dynamic data structures are used and both geometric and solution-based adaptations are applied. Solution adaptation is achieved through solution-based gradient information. The finite volume method is used with cell-centered approach. The solution is converged to a steady state by means of an approximate Riemann solver. Local time step is used for convergence acceleration. A multistage time stepping scheme is used to ...
A systematic study of probabilistic aggregation strategies in swarm robotic systems Soysal, Onur; Şahin, Erol; Department of Computer Engineering (2005) In this study, a systematic analysis of probabilistic aggregation strategies in swarm robotic systems is presented. A generic aggregation behavior is proposed as a combination of four basic behaviors: obstacle avoidance, approach, repel, and wait. The latter three basic behaviors are combined using a three-state finite state machine with two probabilistic transitions among them. Two different metrics were used to compare performance of strategies. Through systematic experiments, how the aggregation performa...

Citation Formats

O. Furkan Kar, G. Turhan, and E. Vural, “Learning Narrowband Graph Spectral Kernels for Graph Signal Estimation Çizge Sinyallerinin Dar Bantli Spektral Kernel Öǧrenimi ile Kestirimi,” presented at the 30th Signal Processing and Communications Applications Conference, SIU 2022, Safranbolu, Türkiye, 2022, Accessed: 00, 2023. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85138673672&origin=inward.