Graph-Aided Multivariate Signal Decomposition
This work addresses the challenge of decomposing time-varying graph signals into their constituent amplitude- and frequency-modulated components while inferring their dynamic functional connectivity structures, known as graph mode decomposition (GMD). The existing method within the graph signal processing (GSP) framework yields static connectivity structures, limiting its real-life applicability and relying heavily on the user-defined parameter of the total number of existing modes in the signal K. We present a novel method to overcome these limitations, offering dynamic multi-scale connectivity structures and amplitude-frequency components. The approach formulates a variational optimization problem, integrating a prior for time-varying edge weights, and employs a successive scheme for optimization, eliminating the need for a priori specification of the number of components K. The performance of the method is validated on both synthetic and real datasets.
Authors
- Mojtaba Nazari (ORCID: https://orcid.org/0000-0003-4937-302X)
- Naveed ur Rehman (ORCID: https://orcid.org/0000-0002-3700-5839)
- Anders Rosendal Korsh⊘j
Institutions
- Aarhus University (DK)
- Aarhus University Hospital (DK)
Publication Details
- Published
- 2024-09-12
- DOI
- https://doi.org/10.1109/icfsp62546.2024.10785500
- Primary Topic
- Machine Learning in Bioinformatics
- Type
- article
- Field-Weighted Citation Impact
- 0.00