Separable Autoregressive Moving Average Graph-Temporal Filters

Conference paper (2016)

Authors

E. Isufi Signal Processing Systems -

A. Loukas Technical University of Berlin

A. Simonetto Signal Processing Systems -

G.J.T. Leus Signal Processing Systems -

Research Group

Signal Processing Systems () (TU Delft)

Graph filters Distributed signal processing Signal processing over graphs Separable graph-temporal filters

To reference this document use:

http://resolver.tudelft.nl/uuid:171f0a50-8b0c-4c4f-8e52-5e5287f6bf34

More Info

expand_more

Published Date

01-12-2016

Language

English

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.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Microelectronics

Research Group

Signal Processing Systems

Abstract

Despite their widespread use for the analysis of graph data, current graph filters are designed for graph signals that do not change over time, and thus they cannot simultaneously process time and graph frequency content in an adequate manner. This work presents ARMA2D, an autoregressive moving average graph-temporal filter that captures jointly the signal variations over the graph and time. By its unique nature, this filter is able to achieve a separable 2-dimensional frequency response, making it possible to approximate the filtering specifications along both the graph and temporal frequency domains. Numerical results show that the proposed solution outperforms the state of the art graph filters when the graph signal is time-varying.