A New Approach for Graph Signal Separation Based on Smoothness
Mohammad Hassan Ahmad Yarandi, Massoud Babaie‐Zadeh
Sharif University of Technology
阅读操作
确认中在文库中上传 PDF 后可生成中文音频讲解。
摘要与影响
Blind source separation (BSS) is a signal processing subject that has recently been extended to graph signals. Graph signals that are smooth on their own graphs provide an opportunity to separate them from their summation by knowing their underlying graphs, which is different from the conventional BSS that requires at least two mixtures of source signals. In this paper, we introduce an approach to separate smooth graph signals whose energy is concentrated on their first frequency components. This approach tries to decompose the summation signal into signals that are as smooth as possible on their underlying graphs and non-smooth on the other graphs. Moreover, in the case that the number of source signals is two, the uniqueness of our separation approach is shown, up to the uncertainty of the average value of the signals. Furthermore, we interpret the solution of our approach in the case of complement graphs by deriving exact error formulas. Finally, simulations demonstrate the efficiency of the proposed approach and its superiority over other approaches in this setting.
逐年被引趋势
关键指标
同类平均 = 1
同领域 · 同年份 · 同类型
Google Scholar 与 OpenAlex 的被引统计范围不同,数值存在差异属正常。
AI 辅助阅读
依据:摘要
可就本文提问;依据不足时会说明。
学术脉络
学科主题
计算机 / AIBlind Source Separation Techniques
Sparse and Compressive Sensing Techniques · Advanced Graph Neural Networks