A Disturbance Localization Method for Power System Based on Group Sparse Representation and Entropy Weight Method

This paper addresses the problem of complex and challenging disturbance localization in the current power system operation environment by proposing a disturbance localization method for power systems based on group sparse representation and entropy weight method.Three different electrical quantities are selected as observations in the compressed sensing algorithm.The entropy weighting method is employed to calculate the weights of different observations based on their relative disturbance levels.Subsequently,by leveraging the topological information of the power system and pre-designing an overcomplete dictionary of disturbances based on the corresponding system parameter variations caused by disturbances,an improved Joint Generalized Orthogonal Matching Pursuit(J-GOMP)algorithm is utilized for reconstruction.The reconstructed sparse vectors are divided into three parts.If at least two parts have consistent node identifiers,the node is identified as the disturbance node.If the node identifiers in all three parts are inconsistent,further analysis is conducted considering the weights to determine the disturbance node.Simulation results based on the IEEE 39-bus system model demonstrate that the proposed method,utilizing electrical quantity information from only 8 measurement points,effectively locates disturbance positions and is applicable to various disturbance types with strong noise resistance.

Image denoising method with tree-structured group sparse modeling of wavelet coefficients

In order to enhance the image contrast and quality, inspired by the interesting observation that an increase in noise intensity tends to narrow the dynamic range of the local standard deviation (LSD) of an image, a tree-structured group sparse optimization model in the wavelet domain is proposed for image denoising. The compressed dynamic range of LSD caused by noise leads to a contrast reduction in the image, as well as the degradation of image quality. To equalize the LSD distribution, sparsity on the LSD matrix is enforced by employing a mixed norm as a regularizer in the image denoising model. This mixed norm introduces a coupling between wavelet coefficients and provides a tree-structured group scheme. The alternating direction method of multipliers (ADMM) and the fast iterative shrinkage-thresholding algorithm (FISTA) are applied to solve the group sparse model based on different cases. Several experiments are conducted to verify the effectiveness of the proposed model. The experimental results indicate that the proposed group sparse model can efficiently equalize the LSD distribution and therefore can improve the image contrast and quality.

Group Sparsity Residual Constraint Image Denoising Model with l_(1)/l_(2)Regularization

Group sparse residual constraint with non-local priors(GSRC)has achieved great success in image restoration producing stateof-the-art performance.In the GSRC model,the l_(1)norm minimization is employed to reduce the group sparse residual.In recent years,nonconvex regularization terms have been widely used in image denoising problems,which have achieved better results in denoising than convex regularization terms.In this paper,we use the ratio of the l_(1)and l_(2)norm instead of the l_(1)norm to propose a new image denoising model,i.e.,a group sparse residual constraint model with l_(1)/l_(2)minimization(GSRC-l_(1)/l_(2)).Due to the computational difficulties arisen from the non-convexity and non-linearity,we focus on a constrained optimization problem that can be solved by alternative direction method of multipliers(ADMM).Experimental results of image denoising show that the pro-posed model outperforms several state-of-the-art image denoising methods both visually and quantitatively.

静息态人脑功能超网络模型鲁棒性对比分析

鲁棒性作为一种动态行为也是超网络领域的研究热点,对构建鲁棒网络具有重要的现实意义。尽管对超网络的研究越来越多,但对其动态研究相对较少,尤其是在神经影像领域。在现有的脑功能超网络研究中,大多是探究网络的静态拓扑属性,并没有相关研究对脑功能超网络的动力学特性——鲁棒性展开分析。针对这些问题,文中首先引入lasso,group lasso和sparse group lasso方法来求解稀疏线性回归模型以构建超网络;然后基于蓄意攻击中的节点度和节点介数攻击两种实验模型,利用全局效率和最大连通子图相对大小探究脑功能超网络在应对攻击时的节点失效网络的鲁棒性,最后通过实验进行对比分析,以探究更为稳定的网络。实验结果表明,在蓄意攻击模式下,group lasso和sparse group lasso方法构建的超网络的鲁棒性更强一些。同时,综合来看,group lasso方法构建的超网络最稳定。

On the Linear Convergence of a Proximal Gradient Method for a Class of Nonsmooth Convex Minimization Problems

We consider a class of nonsmooth convex optimization problems where the objective function is the composition of a strongly convex differentiable function with a linear mapping,regularized by the sum of both l1-norm and l2-norm of the optimization variables.This class of problems arise naturally from applications in sparse group Lasso,which is a popular technique for variable selection.An effective approach to solve such problems is by the Proximal Gradient Method(PGM).In this paper we prove a local error bound around the optimal solution set for this problem and use it to establish the linear convergence of the PGM method without assuming strong convexity of the overall objective function.

基于组合稀疏Lasso的投资策略研究

为了利用因子排序组合的信息并保证组合权重具有一定的稀疏性,基于Sparse Group Lasso (SGLasso)和经典的均值-方差(mean-variance,MV)投资组合策略,构建了能够对高维资产数据集进行投资的SGLasso-MV策略.与Lasso和GLasso相比,SGLasso能够同时实现组内和组间的稀疏性,并利用了特征分组信息,因此适用于改进MV策略输出权重的不稳定性和高误差性问题.在实证数据方面,利用A股1997年至2019年所有可用A股股票的日际实证数据集,进行了不固定成分股的滚动投资,以避免样本选择性偏误,并将SGLasso-MV与几种经典的投资组合策略进行了比较.结果显示,相比其他同样包含期望收益率估计量的策略,SGLasso-MV的权重能够在样本外实现显著更低的标准差风险和更低的换手率.