In this paper,we propose a novel graph signal processing convolution recurrent network(GSP CRN)for signal enhancement against high suppressive interference(HSI)in wireless communications.GSPCRN consists of the short-t...In this paper,we propose a novel graph signal processing convolution recurrent network(GSP CRN)for signal enhancement against high suppressive interference(HSI)in wireless communications.GSPCRN consists of the short-time graph signal processing(SGSP)approach and a modified convolution recurrent network.Similar to the traditional shorttime time-frequency transformation,SGSP frames the complex-valued communication signal and transforms it to the graph-domain representations,where the connection and weight flexibility of each vertex are fully taken into account.In the presence of HSI,SGSP can extract signal features from new graph-domain dimensions and empower neural networks for weak signal enhancement.Two SGSP methods,adjacency singular value decomposition and implicit graph transformation,are designed to capture relationships among the sampling points in the segmented signals.Simulation results demonstrate that our proposed GSPCRN outperforms existing classic methods in extracting weak signals from the HSI environment.When the interference-to-signal ratio exceeds 27dB,only our proposed GSPCRN can achieve the interference mitigation.展开更多
Identifying influential nodes in complex networks is of both theoretical and practical importance. Existing methods identify influential nodes based on their positions in the network and assume that the nodes are homo...Identifying influential nodes in complex networks is of both theoretical and practical importance. Existing methods identify influential nodes based on their positions in the network and assume that the nodes are homogeneous. However, node heterogeneity （i.e., different attributes such as interest, energy, age, and so on ） ubiquitously exists and needs to be taken into consideration. In this paper, we conduct an investigation into node attributes and propose a graph signal pro- cessing based centrality （GSPC） method to identify influential nodes considering both the node attributes and the network topology. We first evaluate our GSPC method using two real-world datasets. The results show that our GSPC method effectively identifies influential nodes, which correspond well with the underlying ground truth. This is compatible to the previous eigenvector centrality and principal component centrality methods under circumstances where the nodes are homogeneous. In addition, spreading analysis shows that the GSPC method has a positive effect on the spreading dynamics.展开更多
The networks are fundamental to our modern world and they appear throughout science and society.Access to a massive amount of data presents a unique opportunity to the researcher’s community.As networks grow in size ...The networks are fundamental to our modern world and they appear throughout science and society.Access to a massive amount of data presents a unique opportunity to the researcher’s community.As networks grow in size the complexity increases and our ability to analyze them using the current state of the art is at severe risk of failing to keep pace.Therefore,this paper initiates a discussion on graph signal processing for large-scale data analysis.We first provide a comprehensive overview of core ideas in Graph signal processing(GSP)and their connection to conventional digital signal processing(DSP).We then summarize recent developments in developing basic GSP tools,including methods for graph filtering or graph learning,graph signal,graph Fourier transform(GFT),spectrum,graph frequency,etc.Graph filtering is a basic task that allows for isolating the contribution of individual frequencies and therefore enables the removal of noise.We then consider a graph filter as a model that helps to extend the application of GSP methods to large datasets.To show the suitability and the effeteness,we first created a noisy graph signal and then applied it to the filter.After several rounds of simulation results.We see that the filtered signal appears to be smoother and is closer to the original noise-free distance-based signal.By using this example application,we thoroughly demonstrated that graph filtration is efficient for big data analytics.展开更多
In the graph signal processing(GSP)framework,distributed algorithms are highly desirable in processing signals defined on large-scale networks.However,in most existing distributed algorithms,all nodes homogeneously pe...In the graph signal processing(GSP)framework,distributed algorithms are highly desirable in processing signals defined on large-scale networks.However,in most existing distributed algorithms,all nodes homogeneously perform the local computation,which calls for heavy computational and communication costs.Moreover,in many real-world networks,such as those with straggling nodes,the homogeneous manner may result in serious delay or even failure.To this end,we propose active network decomposition algorithms to select non-straggling nodes(normal nodes)that perform the main computation and communication across the network.To accommodate the decomposition in different kinds of networks,two different approaches are developed,one is centralized decomposition that leverages the adjacency of the network and the other is distributed decomposition that employs the indicator message transmission between neighboring nodes,which constitutes the main contribution of this paper.By incorporating the active decomposition scheme,a distributed Newton method is employed to solve the least squares problem in GSP,where the Hessian inverse is approximately evaluated by patching a series of inverses of local Hessian matrices each of which is governed by one normal node.The proposed algorithm inherits the fast convergence of the second-order algorithms while maintains low computational and communication cost.Numerical examples demonstrate the effectiveness of the proposed algorithm.展开更多
Owing to the constraints of depth sensing technology,images acquired by depth cameras are inevitably mixed with various noises.For depth maps presented in gray values,this research proposes a novel denoising model,ter...Owing to the constraints of depth sensing technology,images acquired by depth cameras are inevitably mixed with various noises.For depth maps presented in gray values,this research proposes a novel denoising model,termed graph-based transform(GBT)and dual graph Laplacian regularization(DGLR)(DGLR-GBT).This model specifically aims to remove Gaussian white noise by capitalizing on the nonlocal self-similarity(NSS)and the piecewise smoothness properties intrinsic to depth maps.Within the group sparse coding(GSC)framework,a combination of GBT and DGLR is implemented.Firstly,within each group,the graph is constructed by using estimates of the true values of the averaged blocks instead of the observations.Secondly,the graph Laplacian regular terms are constructed based on rows and columns of similar block groups,respectively.Lastly,the solution is obtained effectively by combining the alternating direction multiplication method(ADMM)with the weighted thresholding method within the domain of GBT.展开更多
针对雷达、微波辐射计及无线通信系统中大阵元最小冗余线性阵列(minimum redundancy linear array,MRLA)的获取难题——计算机长时间运算仅得有限解、易遗漏适配应用的最优阵列,通过分析L上元素最少的受限差基、最大连续基线长为L的MRL...针对雷达、微波辐射计及无线通信系统中大阵元最小冗余线性阵列(minimum redundancy linear array,MRLA)的获取难题——计算机长时间运算仅得有限解、易遗漏适配应用的最优阵列,通过分析L上元素最少的受限差基、最大连续基线长为L的MRLA、长度是L的完美稀疏尺的刻度值、L条边的极小优美图顶点标号各自定义的条件,经循环论证,证明四者数学等价;证明得到:线性阵列成对存在;线性阵列的冗余度≥1,阵元数超过4时冗余度>1;若MRLA最大连续基线长度为L且阵元数为n,则最大连续基线长度为L+1的MRLA阵元数不超过n+1.基于大规模MRLA数据分析,提出假设:冗余度≤1.5的线性阵列可视为MRLA.研究还发现了两类新型线性阵列解析公式,能高效筛选出无穷多的MRLA配置模式(即均为完美稀疏尺的刻度数值),并可根据实际需求灵活设定线性阵列冗余度的筛选阈值,为MRLA的应用和完美稀疏尺的设计提供了理论支撑.展开更多
船舶在运行过程中,易因设备老化、操作失误或其他突发事件影响造成电力系统通信系统损伤,导致电力系统关键数据缺失,影响系统的正常运行和安全态势的准确感知。针对现有电力系统缺失数据恢复算法速度较慢且还原精度较低的问题,提出一种...船舶在运行过程中,易因设备老化、操作失误或其他突发事件影响造成电力系统通信系统损伤,导致电力系统关键数据缺失,影响系统的正常运行和安全态势的准确感知。针对现有电力系统缺失数据恢复算法速度较慢且还原精度较低的问题,提出一种基于少量量测信息的超分辨率量测生成方法。根据电力系统量测配置分布空间分布不均且量测精度不同的特点构建电力系统空间稀疏量测状态方程,结合图傅里叶分解技术构建电压的低维近似等式来减少参数量,进而实现低阶线性的近似利用,通过引入掩码概念,构造基于图信号处理的状态估计优化方程,实现了配电网电压的快速重建并提高了全局电压的质量。通过IEEE-85节点算例验证,所提方法相较半正定规划最小二乘法(Semi-Definite Programming Least Squares,SDP-SE)、矩阵补全方法在不同量测数量下的电压恢复精度平均提升50%,相较SDP-SE在运算时间上从分钟级降低至秒级,支持系统在线运行。在Cloudpss中搭建船舶电力系统模型并进行实验,在2 s内实现了缺失电压的数据恢复,且电压的平均绝对误差为0.88%,验证了该方法在船舶电力系统通信系统部分损毁的情况下,能够准确掌握全局信息,提高系统的抗干扰能力和自愈能力。展开更多
无线光通信网络的隐蔽窃听攻击具有高度的隐蔽性和复杂性,其中包含的复杂数据模式和特征,加大了无线光通信网络隐蔽窃听攻击检测难度。故提出无线光通信网络隐蔽窃听攻击自适应检测研究。采用图信号处理方法全面监测无线光通信网络,捕...无线光通信网络的隐蔽窃听攻击具有高度的隐蔽性和复杂性,其中包含的复杂数据模式和特征,加大了无线光通信网络隐蔽窃听攻击检测难度。故提出无线光通信网络隐蔽窃听攻击自适应检测研究。采用图信号处理方法全面监测无线光通信网络,捕捉异常信号范围;利用人工智能技术识别隐蔽窃听攻击特征;建立基于混合核最小二乘支持向量机(hybridkernel least-squares support vector machine,HKLSSVM)的窃听攻击检测模型,通过引入混合核函数将数据映射到更高维的特征空间中,识别出的隐蔽窃听攻击特征,并通过鲸鱼提升算法选择最优的惩罚参数和内核参数,实现无线光通信网络隐蔽窃听攻击自适应检测。实验结果表明,所提方法能准确获取异常信号范围和异常信号,在保证计算稳定性的同时,提高攻击检测性能。展开更多
首先论述新型图信号处理(Graph Signal Processing,GSP)技术的基本概念和相关研究进展,其中包括图拓扑结构、图傅里叶变换、滤波及图学习。鉴于语音信号是一种非平稳和非线性的信号,为此,文中研究基于GSP技术的语音信号的图映射理论,即...首先论述新型图信号处理(Graph Signal Processing,GSP)技术的基本概念和相关研究进展,其中包括图拓扑结构、图傅里叶变换、滤波及图学习。鉴于语音信号是一种非平稳和非线性的信号,为此,文中研究基于GSP技术的语音信号的图映射理论,即将时域语音信号映射为图域的语音图信号,通过设计语音图信号的图拓扑结构和图邻接矩阵来研究语音图信号的内在潜藏关系,进而设计优于经典DSP的语音图信号消噪算法和系统。在此研究基础上,进一步讨论相关实际应用问题,例如麦克风阵列环境下如何通过GSP技术处理麦克风阵列声源(说话人)的定位及追踪问题。期望基于GSP技术语音图信号处理理论,为语音识别、合成、编码、增强等各个领域的图信号处理奠定理论基础。展开更多
基金supported by he National Social Science Found of China(2022-SKJJ-B-112).
文摘In this paper,we propose a novel graph signal processing convolution recurrent network(GSP CRN)for signal enhancement against high suppressive interference(HSI)in wireless communications.GSPCRN consists of the short-time graph signal processing(SGSP)approach and a modified convolution recurrent network.Similar to the traditional shorttime time-frequency transformation,SGSP frames the complex-valued communication signal and transforms it to the graph-domain representations,where the connection and weight flexibility of each vertex are fully taken into account.In the presence of HSI,SGSP can extract signal features from new graph-domain dimensions and empower neural networks for weak signal enhancement.Two SGSP methods,adjacency singular value decomposition and implicit graph transformation,are designed to capture relationships among the sampling points in the segmented signals.Simulation results demonstrate that our proposed GSPCRN outperforms existing classic methods in extracting weak signals from the HSI environment.When the interference-to-signal ratio exceeds 27dB,only our proposed GSPCRN can achieve the interference mitigation.
基金supported by the National Natural Science Foundation of China(Grant No.61231010)the Fundamental Research Funds for the Central Universities,China(Grant No.HUST No.2012QN076)
文摘Identifying influential nodes in complex networks is of both theoretical and practical importance. Existing methods identify influential nodes based on their positions in the network and assume that the nodes are homogeneous. However, node heterogeneity （i.e., different attributes such as interest, energy, age, and so on ） ubiquitously exists and needs to be taken into consideration. In this paper, we conduct an investigation into node attributes and propose a graph signal pro- cessing based centrality （GSPC） method to identify influential nodes considering both the node attributes and the network topology. We first evaluate our GSPC method using two real-world datasets. The results show that our GSPC method effectively identifies influential nodes, which correspond well with the underlying ground truth. This is compatible to the previous eigenvector centrality and principal component centrality methods under circumstances where the nodes are homogeneous. In addition, spreading analysis shows that the GSPC method has a positive effect on the spreading dynamics.
基金supported in part by Basic Science Research Program through the National Research Foundation of Korea(NRF)funded by the Ministry of Education(NRF-2019R1A2C1006159)and(NRF-2021R1A6A1A03039493)by the 2021 Yeungnam University Research Grant.
文摘The networks are fundamental to our modern world and they appear throughout science and society.Access to a massive amount of data presents a unique opportunity to the researcher’s community.As networks grow in size the complexity increases and our ability to analyze them using the current state of the art is at severe risk of failing to keep pace.Therefore,this paper initiates a discussion on graph signal processing for large-scale data analysis.We first provide a comprehensive overview of core ideas in Graph signal processing(GSP)and their connection to conventional digital signal processing(DSP).We then summarize recent developments in developing basic GSP tools,including methods for graph filtering or graph learning,graph signal,graph Fourier transform(GFT),spectrum,graph frequency,etc.Graph filtering is a basic task that allows for isolating the contribution of individual frequencies and therefore enables the removal of noise.We then consider a graph filter as a model that helps to extend the application of GSP methods to large datasets.To show the suitability and the effeteness,we first created a noisy graph signal and then applied it to the filter.After several rounds of simulation results.We see that the filtered signal appears to be smoother and is closer to the original noise-free distance-based signal.By using this example application,we thoroughly demonstrated that graph filtration is efficient for big data analytics.
基金supported by National Natural Science Foundation of China(Grant No.61761011)Natural Science Foundation of Guangxi(Grant No.2020GXNSFBA297078).
文摘In the graph signal processing(GSP)framework,distributed algorithms are highly desirable in processing signals defined on large-scale networks.However,in most existing distributed algorithms,all nodes homogeneously perform the local computation,which calls for heavy computational and communication costs.Moreover,in many real-world networks,such as those with straggling nodes,the homogeneous manner may result in serious delay or even failure.To this end,we propose active network decomposition algorithms to select non-straggling nodes(normal nodes)that perform the main computation and communication across the network.To accommodate the decomposition in different kinds of networks,two different approaches are developed,one is centralized decomposition that leverages the adjacency of the network and the other is distributed decomposition that employs the indicator message transmission between neighboring nodes,which constitutes the main contribution of this paper.By incorporating the active decomposition scheme,a distributed Newton method is employed to solve the least squares problem in GSP,where the Hessian inverse is approximately evaluated by patching a series of inverses of local Hessian matrices each of which is governed by one normal node.The proposed algorithm inherits the fast convergence of the second-order algorithms while maintains low computational and communication cost.Numerical examples demonstrate the effectiveness of the proposed algorithm.
基金National Natural Science Foundation of China(No.62372100)。
文摘Owing to the constraints of depth sensing technology,images acquired by depth cameras are inevitably mixed with various noises.For depth maps presented in gray values,this research proposes a novel denoising model,termed graph-based transform(GBT)and dual graph Laplacian regularization(DGLR)(DGLR-GBT).This model specifically aims to remove Gaussian white noise by capitalizing on the nonlocal self-similarity(NSS)and the piecewise smoothness properties intrinsic to depth maps.Within the group sparse coding(GSC)framework,a combination of GBT and DGLR is implemented.Firstly,within each group,the graph is constructed by using estimates of the true values of the averaged blocks instead of the observations.Secondly,the graph Laplacian regular terms are constructed based on rows and columns of similar block groups,respectively.Lastly,the solution is obtained effectively by combining the alternating direction multiplication method(ADMM)with the weighted thresholding method within the domain of GBT.
文摘针对雷达、微波辐射计及无线通信系统中大阵元最小冗余线性阵列(minimum redundancy linear array,MRLA)的获取难题——计算机长时间运算仅得有限解、易遗漏适配应用的最优阵列,通过分析L上元素最少的受限差基、最大连续基线长为L的MRLA、长度是L的完美稀疏尺的刻度值、L条边的极小优美图顶点标号各自定义的条件,经循环论证,证明四者数学等价;证明得到:线性阵列成对存在;线性阵列的冗余度≥1,阵元数超过4时冗余度>1;若MRLA最大连续基线长度为L且阵元数为n,则最大连续基线长度为L+1的MRLA阵元数不超过n+1.基于大规模MRLA数据分析,提出假设:冗余度≤1.5的线性阵列可视为MRLA.研究还发现了两类新型线性阵列解析公式,能高效筛选出无穷多的MRLA配置模式(即均为完美稀疏尺的刻度数值),并可根据实际需求灵活设定线性阵列冗余度的筛选阈值,为MRLA的应用和完美稀疏尺的设计提供了理论支撑.
文摘船舶在运行过程中,易因设备老化、操作失误或其他突发事件影响造成电力系统通信系统损伤,导致电力系统关键数据缺失,影响系统的正常运行和安全态势的准确感知。针对现有电力系统缺失数据恢复算法速度较慢且还原精度较低的问题,提出一种基于少量量测信息的超分辨率量测生成方法。根据电力系统量测配置分布空间分布不均且量测精度不同的特点构建电力系统空间稀疏量测状态方程,结合图傅里叶分解技术构建电压的低维近似等式来减少参数量,进而实现低阶线性的近似利用,通过引入掩码概念,构造基于图信号处理的状态估计优化方程,实现了配电网电压的快速重建并提高了全局电压的质量。通过IEEE-85节点算例验证,所提方法相较半正定规划最小二乘法(Semi-Definite Programming Least Squares,SDP-SE)、矩阵补全方法在不同量测数量下的电压恢复精度平均提升50%,相较SDP-SE在运算时间上从分钟级降低至秒级,支持系统在线运行。在Cloudpss中搭建船舶电力系统模型并进行实验,在2 s内实现了缺失电压的数据恢复,且电压的平均绝对误差为0.88%,验证了该方法在船舶电力系统通信系统部分损毁的情况下,能够准确掌握全局信息,提高系统的抗干扰能力和自愈能力。
文摘无线光通信网络的隐蔽窃听攻击具有高度的隐蔽性和复杂性,其中包含的复杂数据模式和特征,加大了无线光通信网络隐蔽窃听攻击检测难度。故提出无线光通信网络隐蔽窃听攻击自适应检测研究。采用图信号处理方法全面监测无线光通信网络,捕捉异常信号范围;利用人工智能技术识别隐蔽窃听攻击特征;建立基于混合核最小二乘支持向量机(hybridkernel least-squares support vector machine,HKLSSVM)的窃听攻击检测模型,通过引入混合核函数将数据映射到更高维的特征空间中,识别出的隐蔽窃听攻击特征,并通过鲸鱼提升算法选择最优的惩罚参数和内核参数,实现无线光通信网络隐蔽窃听攻击自适应检测。实验结果表明,所提方法能准确获取异常信号范围和异常信号,在保证计算稳定性的同时,提高攻击检测性能。
文摘首先论述新型图信号处理(Graph Signal Processing,GSP)技术的基本概念和相关研究进展,其中包括图拓扑结构、图傅里叶变换、滤波及图学习。鉴于语音信号是一种非平稳和非线性的信号,为此,文中研究基于GSP技术的语音信号的图映射理论,即将时域语音信号映射为图域的语音图信号,通过设计语音图信号的图拓扑结构和图邻接矩阵来研究语音图信号的内在潜藏关系,进而设计优于经典DSP的语音图信号消噪算法和系统。在此研究基础上,进一步讨论相关实际应用问题,例如麦克风阵列环境下如何通过GSP技术处理麦克风阵列声源(说话人)的定位及追踪问题。期望基于GSP技术语音图信号处理理论,为语音识别、合成、编码、增强等各个领域的图信号处理奠定理论基础。
