Sparse representation has been highly successful in various tasks related to image processing and computer vision.For ancient mural image inpainting,traditional group sparse representation models usually lead to struc...Sparse representation has been highly successful in various tasks related to image processing and computer vision.For ancient mural image inpainting,traditional group sparse representation models usually lead to structure blur and line discontinuity due to the construction of similarity group solely based on the Euclidean distance and the randomness of dictionary initialization.To address the aforementioned issues,an improved curvature Gabor transform and group sparse representation(CGabor-GSR)model for ancient Dunhuang mural inpainting is proposed.To begin with,mutual information is introduced to weight the Euclidean distance,and then the weighted Euclidean distance acts as a new standard of similarity group.Subsequently,to mitigate the randomness of dictionary initialization,a curvature Gabor wavelet transform is proposed to extract the features and initialize the feature dictionary with dimension reduction based on principal component analysis(PCA).Ultimately,singular value decomposition(SVD)and split Bregman iteration(SBI)can be used to resolve the CGabor-GSR model to reconstruct the mural images.Experimental results on Dunhuang mural inpainting demonstrate tha the proposed CGabor-GSR achieves a better performance than compared algorithms in both objective and visual evaluation.展开更多
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 sp...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.展开更多
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 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.展开更多
基金supported by National Natural Science Foundation of China(No.61963023)Humanities and Social Sciences Youth Foundation of Ministry of Education(No.19YJC760012)Lanzhou Jiaotong University Basic Top-Notch Personnel Project(No.2022JC36).
文摘Sparse representation has been highly successful in various tasks related to image processing and computer vision.For ancient mural image inpainting,traditional group sparse representation models usually lead to structure blur and line discontinuity due to the construction of similarity group solely based on the Euclidean distance and the randomness of dictionary initialization.To address the aforementioned issues,an improved curvature Gabor transform and group sparse representation(CGabor-GSR)model for ancient Dunhuang mural inpainting is proposed.To begin with,mutual information is introduced to weight the Euclidean distance,and then the weighted Euclidean distance acts as a new standard of similarity group.Subsequently,to mitigate the randomness of dictionary initialization,a curvature Gabor wavelet transform is proposed to extract the features and initialize the feature dictionary with dimension reduction based on principal component analysis(PCA).Ultimately,singular value decomposition(SVD)and split Bregman iteration(SBI)can be used to resolve the CGabor-GSR model to reconstruct the mural images.Experimental results on Dunhuang mural inpainting demonstrate tha the proposed CGabor-GSR achieves a better performance than compared algorithms in both objective and visual evaluation.
基金funded by the State Grid Jilin Economic Research Institute’s 2022 Practical Re-Search Project on the Construction of Long-Term Power Supply Guarantee Mechanism in Provincial Capital Cities under the New Situation,Grant Number SGJLJY00GPJS2200041.
文摘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.
基金Supported by the Open Fund of Key Laboratory of Anhui Higher Education Institutes(CS2021-07)the National Natural Science Foundation of China(61701004),the Outstanding Young Talents Support Program of Anhui Province(GXYQ 2021178)University Natural Science Research Project of Anhui Province of China(KJ2020A0238)。
文摘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.
