Blind Demixing of Diffused Graph Signals
원문 초록
Using graphs to model irregular information domains is an effective approach to deal with some of the intricacies of contemporary (network) data. A key aspect is how the data, represented as graph signals, depend on the topology of the graph. Widely-used approaches assume that the observed signals can be viewed as outputs of graph filters (i.e., polynomials of a matrix representation of the graph) whose inputs have a particular structure. Diffused graph signals, which correspond to an originally sparse (node-localized) signal percolated through the graph via filtering, fall into this class. In that context, this paper deals with the problem of jointly identifying graph filters and separating their (sparse) input signals from a mixture of diffused graph signals, thus generalizing to the graph signal processing framework the classical blind demixing (blind source separation) of temporal and spatial signals. We first consider the scenario where the supporting graphs are different across the signals, providing a theorem for demixing feasibility along with probabilistic bounds on successful recovery. Additionally, an analysis of the degenerate problem of demixing with a single graph is also presented. Numerical experiments with synthetic and real-world graphs empirically illustrating the main theoretical findings close the paper.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Towards Reliable Objective Evaluation Metrics for Generative Singing Voice Separation Models
Self-Supervised Autoencoder Network for Robust Heart Rate Extraction from Noisy Photoplethysmogram: Applying Blind Source Separation to Biosignal Analysis
Revisiting convolutive blind source separation for identifying spiking motor neuron activity: From theory to practice
Unsupervised Composable Representations for Audio
$S^3$ -- Semantic Signal Separation
Enhancing Deep Learning Models through Tensorization: A Comprehensive Survey and Framework
토론
이 논문과 연결된 포럼 글이 아직 없습니다.