压缩感知(compressed sensing,CS)是一种全新的信息采集与处理的理论框架,借助信号内在的稀疏性或可压缩性,可以从小规模的线性、非自适应的测量中通过求解非线性优化问题重构原信号.块稀疏信号是一种具有块结构的信号,即信号的非零元...压缩感知(compressed sensing,CS)是一种全新的信息采集与处理的理论框架,借助信号内在的稀疏性或可压缩性,可以从小规模的线性、非自适应的测量中通过求解非线性优化问题重构原信号.块稀疏信号是一种具有块结构的信号,即信号的非零元是成块出现的.受YIN Peng-hang,LOU Yi-fei,HE Qi等提出的l_1-2范数最小化方法的启发,将基于l_1-l_2范数的稀疏重构算法推广到块稀疏模型,证明了块稀疏模型下l_1-l_2范数的相关性质,建立了基于l_1-l_2范数的块稀疏信号精确重构的充分条件,并通过DCA(difference of convex functions algorithm)和ADMM(alternating direction method of multipliers)给出了求解块稀疏模型下l_1-l_2范数的迭代方法.数值实验表明,基于l_1-l_2范数的块稀疏重构算法比其他块稀疏重构算法具有更高的重构成功率.展开更多
针对图像重建过程中噪声去除问题,提出一种自适应加权编码L1/2正则化重建算法。首先,考虑到许多真实图像中不仅含有高斯噪声,而且含有拉普拉斯噪声,设计一种改进的L1-L2混合误差模型(IHEM)算法,该算法兼顾了L1范数与L2范数的各自优点;其...针对图像重建过程中噪声去除问题,提出一种自适应加权编码L1/2正则化重建算法。首先,考虑到许多真实图像中不仅含有高斯噪声,而且含有拉普拉斯噪声,设计一种改进的L1-L2混合误差模型(IHEM)算法,该算法兼顾了L1范数与L2范数的各自优点;其次,由于迭代过程中噪声分布会发生改变,设计一种自适应隶属度算法,该算法可以减少迭代次数和运算时间;利用一种自适应加权编码方法,该方法可以有效地去除含有重尾分布特性的拉普拉斯噪声;另外,设计一种L1/2正则化算法,该算法可以得到较稀疏的解。实验结果表明,相比IHEM算法,自适应L1/2正则化图像重建算法的峰值信噪比(PSNR)平均提高了3.46 d B,结构相似度(SSIM)平均提高了0.02,对含有多种噪声的图像处理具有比较理想的效果。展开更多
In recent years,the nuclear norm minimization(NNM)as a convex relaxation of the rank minimization has attracted great research interest.By assigning different weights to singular values,the weighted nuclear norm minim...In recent years,the nuclear norm minimization(NNM)as a convex relaxation of the rank minimization has attracted great research interest.By assigning different weights to singular values,the weighted nuclear norm minimization(WNNM)has been utilized in many applications.However,most of the work on WNNM is combined with the l 2-data-fidelity term,which is under additive Gaussian noise assumption.In this paper,we introduce the L1-WNNM model,which incorporates the l 1-data-fidelity term and the regularization from WNNM.We apply the alternating direction method of multipliers(ADMM)to solve the non-convex minimization problem in this model.We exploit the low rank prior on the patch matrices extracted based on the image non-local self-similarity and apply the L1-WNNM model on patch matrices to restore the image corrupted by impulse noise.Numerical results show that our method can effectively remove impulse noise.展开更多
Motion deblurring is a basic problem in the field of image processing and analysis. This paper proposes a new method of single image blind deblurring which can be significant to kernel estimation and non-blind deconvo...Motion deblurring is a basic problem in the field of image processing and analysis. This paper proposes a new method of single image blind deblurring which can be significant to kernel estimation and non-blind deconvolution. Experiments show that the details of the image destroy the structure of the kernel, especially when the blur kernel is large. So we extract the image structure with salient edges by the method based on RTV. In addition, the traditional method for motion blur kernel estimation based on sparse priors is conducive to gain a sparse blur kernel. But these priors do not ensure the continuity of blur kernel and sometimes induce noisy estimated results. Therefore we propose the kernel refinement method based on L0 to overcome the above shortcomings. In terms of non-blind deconvolution we adopt the L1/L2 regularization term. Compared with the traditional method, the method based on L1/L2 norm has better adaptability to image structure, and the constructed energy functional can better describe the sharp image. For this model, an effective algorithm is presented based on alternating minimization algorithm.展开更多
We consider efficient methods for the recovery of block sparse signals from underdetermined system of linear equations. We show that if the measurement matrix satisfies the block RIP with δ2s 〈 0.4931, then every bl...We consider efficient methods for the recovery of block sparse signals from underdetermined system of linear equations. We show that if the measurement matrix satisfies the block RIP with δ2s 〈 0.4931, then every block s-sparse signal can be recovered through the proposed mixed l2/ll-minimization approach in the noiseless case and is stably recovered in the presence of noise and mismodeling error. This improves the result of Eldar and Mishali （in IEEE Trans. Inform. Theory 55： 5302-5316, 2009）. We also give another sufficient condition on block RIP for such recovery method： 58 〈 0.307.展开更多
In this paper,we investigate truncated l2\l1-2 minimization and its associated alternating direction method of multipliers(ADMM)algorithm for recovering the block sparse signals.Based on the block restricted isometry ...In this paper,we investigate truncated l2\l1-2 minimization and its associated alternating direction method of multipliers(ADMM)algorithm for recovering the block sparse signals.Based on the block restricted isometry property(Block-RIP),a theoretical analysis is presen ted to guarantee the validity of proposed method.Our theore tical resul ts not only show a less error upper bound,but also promote the former recovery condition of truncated l1-2 method for sparse signal recovery.Besides,the algorithm has been compared with some state-of-the-art algorithms and numerical experiments have shown excellent performances on recovering the block sparse signals.展开更多
High-dimensional and sparse(HiDS)matrices commonly arise in various industrial applications,e.g.,recommender systems(RSs),social networks,and wireless sensor networks.Since they contain rich information,how to accurat...High-dimensional and sparse(HiDS)matrices commonly arise in various industrial applications,e.g.,recommender systems(RSs),social networks,and wireless sensor networks.Since they contain rich information,how to accurately represent them is of great significance.A latent factor(LF)model is one of the most popular and successful ways to address this issue.Current LF models mostly adopt L2-norm-oriented Loss to represent an HiDS matrix,i.e.,they sum the errors between observed data and predicted ones with L2-norm.Yet L2-norm is sensitive to outlier data.Unfortunately,outlier data usually exist in such matrices.For example,an HiDS matrix from RSs commonly contains many outlier ratings due to some heedless/malicious users.To address this issue,this work proposes a smooth L1-norm-oriented latent factor(SL-LF)model.Its main idea is to adopt smooth L1-norm rather than L2-norm to form its Loss,making it have both strong robustness and high accuracy in predicting the missing data of an HiDS matrix.Experimental results on eight HiDS matrices generated by industrial applications verify that the proposed SL-LF model not only is robust to the outlier data but also has significantly higher prediction accuracy than state-of-the-art models when they are used to predict the missing data of HiDS matrices.展开更多
文摘压缩感知(compressed sensing,CS)是一种全新的信息采集与处理的理论框架,借助信号内在的稀疏性或可压缩性,可以从小规模的线性、非自适应的测量中通过求解非线性优化问题重构原信号.块稀疏信号是一种具有块结构的信号,即信号的非零元是成块出现的.受YIN Peng-hang,LOU Yi-fei,HE Qi等提出的l_1-2范数最小化方法的启发,将基于l_1-l_2范数的稀疏重构算法推广到块稀疏模型,证明了块稀疏模型下l_1-l_2范数的相关性质,建立了基于l_1-l_2范数的块稀疏信号精确重构的充分条件,并通过DCA(difference of convex functions algorithm)和ADMM(alternating direction method of multipliers)给出了求解块稀疏模型下l_1-l_2范数的迭代方法.数值实验表明,基于l_1-l_2范数的块稀疏重构算法比其他块稀疏重构算法具有更高的重构成功率.
文摘针对图像重建过程中噪声去除问题,提出一种自适应加权编码L1/2正则化重建算法。首先,考虑到许多真实图像中不仅含有高斯噪声,而且含有拉普拉斯噪声,设计一种改进的L1-L2混合误差模型(IHEM)算法,该算法兼顾了L1范数与L2范数的各自优点;其次,由于迭代过程中噪声分布会发生改变,设计一种自适应隶属度算法,该算法可以减少迭代次数和运算时间;利用一种自适应加权编码方法,该方法可以有效地去除含有重尾分布特性的拉普拉斯噪声;另外,设计一种L1/2正则化算法,该算法可以得到较稀疏的解。实验结果表明,相比IHEM算法,自适应L1/2正则化图像重建算法的峰值信噪比(PSNR)平均提高了3.46 d B,结构相似度(SSIM)平均提高了0.02,对含有多种噪声的图像处理具有比较理想的效果。
基金supported by the National Natural Science Foundation of China under grants U21A20455,61972265,11871348 and 11701388by the Natural Science Foundation of Guangdong Province of China under grant 2020B1515310008by the Educational Commission of Guangdong Province of China under grant 2019KZDZX1007.
文摘In recent years,the nuclear norm minimization(NNM)as a convex relaxation of the rank minimization has attracted great research interest.By assigning different weights to singular values,the weighted nuclear norm minimization(WNNM)has been utilized in many applications.However,most of the work on WNNM is combined with the l 2-data-fidelity term,which is under additive Gaussian noise assumption.In this paper,we introduce the L1-WNNM model,which incorporates the l 1-data-fidelity term and the regularization from WNNM.We apply the alternating direction method of multipliers(ADMM)to solve the non-convex minimization problem in this model.We exploit the low rank prior on the patch matrices extracted based on the image non-local self-similarity and apply the L1-WNNM model on patch matrices to restore the image corrupted by impulse noise.Numerical results show that our method can effectively remove impulse noise.
基金Partially Supported by National Natural Science Foundation of China(No.61173102)
文摘Motion deblurring is a basic problem in the field of image processing and analysis. This paper proposes a new method of single image blind deblurring which can be significant to kernel estimation and non-blind deconvolution. Experiments show that the details of the image destroy the structure of the kernel, especially when the blur kernel is large. So we extract the image structure with salient edges by the method based on RTV. In addition, the traditional method for motion blur kernel estimation based on sparse priors is conducive to gain a sparse blur kernel. But these priors do not ensure the continuity of blur kernel and sometimes induce noisy estimated results. Therefore we propose the kernel refinement method based on L0 to overcome the above shortcomings. In terms of non-blind deconvolution we adopt the L1/L2 regularization term. Compared with the traditional method, the method based on L1/L2 norm has better adaptability to image structure, and the constructed energy functional can better describe the sharp image. For this model, an effective algorithm is presented based on alternating minimization algorithm.
基金Supported by National Natural Science Foundation of China (Grant Nos. 11171299 and 91130009)Natural Science Foundation of Zhejiang Province of China (Grant No. Y6090091)
文摘We consider efficient methods for the recovery of block sparse signals from underdetermined system of linear equations. We show that if the measurement matrix satisfies the block RIP with δ2s 〈 0.4931, then every block s-sparse signal can be recovered through the proposed mixed l2/ll-minimization approach in the noiseless case and is stably recovered in the presence of noise and mismodeling error. This improves the result of Eldar and Mishali （in IEEE Trans. Inform. Theory 55： 5302-5316, 2009）. We also give another sufficient condition on block RIP for such recovery method： 58 〈 0.307.
基金The authors would like to thank reviewers for valuable comments.This work was supported by Natural Science Foundation of China(Grant Nos.61673015,61273020)Fundamental Research Funds for the Central Universities(Grant Nos.XDJK2015A007,XDJK 2018C076,SWU1809002).
文摘In this paper,we investigate truncated l2\l1-2 minimization and its associated alternating direction method of multipliers(ADMM)algorithm for recovering the block sparse signals.Based on the block restricted isometry property(Block-RIP),a theoretical analysis is presen ted to guarantee the validity of proposed method.Our theore tical resul ts not only show a less error upper bound,but also promote the former recovery condition of truncated l1-2 method for sparse signal recovery.Besides,the algorithm has been compared with some state-of-the-art algorithms and numerical experiments have shown excellent performances on recovering the block sparse signals.
基金supported in part by the National Natural Science Foundation of China(61702475,61772493,61902370,62002337)in part by the Natural Science Foundation of Chongqing,China(cstc2019jcyj-msxmX0578,cstc2019jcyjjqX0013)+1 种基金in part by the Chinese Academy of Sciences“Light of West China”Program,in part by the Pioneer Hundred Talents Program of Chinese Academy of Sciencesby Technology Innovation and Application Development Project of Chongqing,China(cstc2019jscx-fxydX0027)。
文摘High-dimensional and sparse(HiDS)matrices commonly arise in various industrial applications,e.g.,recommender systems(RSs),social networks,and wireless sensor networks.Since they contain rich information,how to accurately represent them is of great significance.A latent factor(LF)model is one of the most popular and successful ways to address this issue.Current LF models mostly adopt L2-norm-oriented Loss to represent an HiDS matrix,i.e.,they sum the errors between observed data and predicted ones with L2-norm.Yet L2-norm is sensitive to outlier data.Unfortunately,outlier data usually exist in such matrices.For example,an HiDS matrix from RSs commonly contains many outlier ratings due to some heedless/malicious users.To address this issue,this work proposes a smooth L1-norm-oriented latent factor(SL-LF)model.Its main idea is to adopt smooth L1-norm rather than L2-norm to form its Loss,making it have both strong robustness and high accuracy in predicting the missing data of an HiDS matrix.Experimental results on eight HiDS matrices generated by industrial applications verify that the proposed SL-LF model not only is robust to the outlier data but also has significantly higher prediction accuracy than state-of-the-art models when they are used to predict the missing data of HiDS matrices.
