Print Email Facebook Twitter Rational Chebyshev Graph Filters Title Rational Chebyshev Graph Filters Author Rimleanscaia, Oxana (University of Perugia) Isufi, E. (TU Delft Multimedia Computing) Contributor Matthews, Michael B. (editor) Date 2020 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. Subject Graph filtersgraph signal processingspectral clustering To reference this document use: http://resolver.tudelft.nl/uuid:f8e815ab-1c4c-4288-b47e-c122d76a1bdd DOI https://doi.org/10.1109/IEEECONF51394.2020.9443317 Publisher IEEE ISBN 9780738131269 Source Conference Record of the 54th Asilomar Conference on Signals, Systems and Computers, ACSSC 2020 Event 54th Asilomar Conference on Signals, Systems and Computers, ACSSC 2020, 2020-11-01 → 2020-11-05, Pacific Grove, United States Series Conference Record - Asilomar Conference on Signals, Systems and Computers, 1058-6393, 2020-November Part of collection Institutional Repository Document type conference paper Rights © 2020 Oxana Rimleanscaia, E. Isufi Files PDF main.pdf 849.65 KB Close viewer /islandora/object/uuid:f8e815ab-1c4c-4288-b47e-c122d76a1bdd/datastream/OBJ/view