Scientific article

Community-Aware Graph Signal Processing: Modularity Defines New Ways of Processing Graph Signals

Published inIEEE Signal Processing Magazine, vol. 37, no. 6, p. 150-159
Publication date2020

The emerging field of graph signal processing (GSP) allows one to transpose classical signal processing operations (e.g., filtering) to signals on graphs. The GSP framework is generally built upon the graph Laplacian, which plays a crucial role in studying graph properties and measuring graph signal smoothness. Here, instead, we propose the graph modularity matrix as the centerpiece of GSP to incorporate knowledge about graph community structure when processing signals on the graph but without the need for community detection. We study this approach in several generic settings, such as filtering, optimal sampling and reconstruction, surrogate data generation, and denoising. Feasibility is illustrated by a small-scale example and a transportation network data set as well as one application in human neuroimaging where community-aware GSP reveals relationships between behavior and brain features that are not shown by Laplacian-based GSP. This work demonstrates how concepts from network science can lead to new, meaningful operations on graph signals.

  • Communities
  • Signal processing algorithms
  • Laplace equations
  • Neuroimaging
  • Graphical models
Citation (ISO format)
PETROVIC, Miljan et al. Community-Aware Graph Signal Processing: Modularity Defines New Ways of Processing Graph Signals. In: IEEE Signal Processing Magazine, 2020, vol. 37, n° 6, p. 150–159. doi: 10.1109/MSP.2020.3018087
Main files (1)
Article (Published version)
ISSN of the journal1053-5888

Technical informations

Creation09/09/2021 3:25:00 PM
First validation09/09/2021 3:25:00 PM
Update time03/16/2023 1:59:28 AM
Status update03/16/2023 1:59:27 AM
Last indexation01/17/2024 3:24:57 PM
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack