TY - JOUR
T1 - Observing and tracking bandlimited graph processes from sampled measurements
AU - Isufi, Elvin
AU - Banelli, Paolo
AU - Lorenzo, Paolo Di
AU - Leus, Geert
N1 - KAUST Repository Item: Exported on 2022-06-14
Acknowledged KAUST grant number(s): OSR-2015-Sensors-2700
Acknowledgements: This work was supported in part by the KAUST-MIT-TUD-Caltech consortium grant OSR-2015-Sensors-2700 Ext. 2018. The work of P. Di Lorenzo was in part done at University of Perugia and was supported by the “Fondazione Cassa di Risparimio di Perugia”.
This publication acknowledges KAUST support, but has no KAUST affiliated authors.
PY - 2020/8/21
Y1 - 2020/8/21
N2 - A critical challenge in graph signal processing is the sampling of bandlimited graph signals; signals that are sparse in a well-defined graph Fourier domain. Current works focused on sampling time-invariant graph signals and ignored their temporal evolution. However, time can bring new insights on sampling since sensor, biological, and financial network signals are correlated in both domains. Hence, in this work, we develop a sampling theory for time varying graph signals, named graph processes, to observe and track a process described by a linear state-space model. We provide a mathematical analysis to highlight the role of the graph, process bandwidth, and sample locations. We also propose sampling strategies that exploit the coupling between the topology and the corresponding process. Numerical experiments corroborate our theory and show the proposed methods trade well the number of samples with accuracy.
AB - A critical challenge in graph signal processing is the sampling of bandlimited graph signals; signals that are sparse in a well-defined graph Fourier domain. Current works focused on sampling time-invariant graph signals and ignored their temporal evolution. However, time can bring new insights on sampling since sensor, biological, and financial network signals are correlated in both domains. Hence, in this work, we develop a sampling theory for time varying graph signals, named graph processes, to observe and track a process described by a linear state-space model. We provide a mathematical analysis to highlight the role of the graph, process bandwidth, and sample locations. We also propose sampling strategies that exploit the coupling between the topology and the corresponding process. Numerical experiments corroborate our theory and show the proposed methods trade well the number of samples with accuracy.
UR - http://hdl.handle.net/10754/678979
UR - https://linkinghub.elsevier.com/retrieve/pii/S0165168420302929
UR - http://www.scopus.com/inward/record.url?scp=85089575546&partnerID=8YFLogxK
U2 - 10.1016/j.sigpro.2020.107749
DO - 10.1016/j.sigpro.2020.107749
M3 - Article
SN - 0165-1684
VL - 177
SP - 107749
JO - Signal Processing
JF - Signal Processing
ER -