Rational Chebyshev Graph Filters

Conference paper (2020)

Authors

Oxana Rimleanscaia University of Perugia
Copyright: © 2020 Oxana Rimleanscaia, E. Isufi
DOI: https://doi.org/10.1109/IEEECONF51394.2020.9443317
Graph signal processing Spectral clustering Graph filters
More Info
expand_more

Published Date

2020

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.

Abstract

This paper proposes rational Chebyshev graph filters to approximate step graph spectral responses with arbitrary precision, which are of interest in graph filter banks and spectral clustering. The proposed method relies on the well-known Chebyshev filters of the first kind and on a domain transform of the angular frequencies to the graph frequencies. This approach identifies in closed-form the filter coefficients, hence it avoids the costs of solving a nonlinear problem. Rational Chebyshev graph filters improve the control on the ripples in the pass- and stop-band and on the transition decay. Numerical experiments show the proposed approach approximates better ideal step responses than competing alternatives and reaches the performance of the ideal filters in compressive spectral clustering.