arXiv · 2510.07503
Time-Frequency Filtering Meets Graph Clustering
Abstract
We show that the problem of identifying different signal components from a time-frequency representation can be equivalently phrased as a graph clustering problem: given a graph $G=(V,E)$ one aims to identify `clusters', subgraphs that are strongly connected and have relatively few connections between them. The graph clustering problem is well studied, we show how these ideas can suggest (many) new ways to identify signal components. Numerical experiments illustrate the ideas.
Explore related subjects
Keep this discovery
Marcelo A. Colominas, Stefan Steinerberger, Hau-Tieng Wu. 2025-10-08. Time-Frequency Filtering Meets Graph Clustering. https://arxiv.org/abs/2510.07503
Cite the original work for its findings. Save a collection to share your selection of sources.