Observing Bandlimited Graph Processes from Subsampled Measurements

Conference Paper (2019)
Author(s)

Elvin Isufi (TU Delft - Electrical Engineering, Mathematics and Computer Science, Università degli Studi di Perugia)

Paolo Banelli (Università degli Studi di Perugia)

Paolo Di Lorenzo (Sapienza University of Rome)

Geert Leus (TU Delft - Electrical Engineering, Mathematics and Computer Science)

Research Group
Multimedia Computing
DOI related publication
https://doi.org/10.1109/ACSSC.2018.8645200 Final published version
More Info
expand_more
Publication Year
2019
Language
English
Research Group
Multimedia Computing
Article number
8645200
Pages (from-to)
737-741
ISBN (print)
978-1-5386-9219-6
ISBN (electronic)
978-1-5386-9218-9
Event
52nd Asilomar Conference on Signals, Systems and Computers, ACSSC 2018 (2018-10-28 - 2018-10-31), Pacific Grove, United States
Downloads counter
249
Collections
Institutional Repository
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

This work merges tools from graph signal processing and linear systems theory to propose sampling strategies for observing the initial state of a process evolving over a graph. The proposed method is ratified by a mathematical analysis that provides insights on the role played by the different actors, such as the graph topology, the process bandwidth, and the sampling strategy. Moreover, conditions when the graph process is observable from a few samples and (sub)optimal sampling strategies that jointly exploit the nature of the graph structure and graph process are proposed. Finally, numerical tests are conducted to illustrate the benefits of the proposed approach.

Files

Observing_Bandlimited_Graph_Pr... (pdf)
(pdf | 0.245 Mb)
- Embargo expired in 21-08-2019
License info not available