In order to improve the efficiency of speech emotion recognition across corpora,a speech emotion transfer learning method based on the deep sparse auto-encoder is proposed.The algorithm first reconstructs a small amou...In order to improve the efficiency of speech emotion recognition across corpora,a speech emotion transfer learning method based on the deep sparse auto-encoder is proposed.The algorithm first reconstructs a small amount of data in the target domain by training the deep sparse auto-encoder,so that the encoder can learn the low-dimensional structural representation of the target domain data.Then,the source domain data and the target domain data are coded by the trained deep sparse auto-encoder to obtain the reconstruction data of the low-dimensional structural representation close to the target domain.Finally,a part of the reconstructed tagged target domain data is mixed with the reconstructed source domain data to jointly train the classifier.This part of the target domain data is used to guide the source domain data.Experiments on the CASIA,SoutheastLab corpus show that the model recognition rate after a small amount of data transferred reached 89.2%and 72.4%on the DNN.Compared to the training results of the complete original corpus,it only decreased by 2%in the CASIA corpus,and only 3.4%in the SoutheastLab corpus.Experiments show that the algorithm can achieve the effect of labeling all data in the extreme case that the data set has only a small amount of data tagged.展开更多
A two-level Bregmanized method with graph regularized sparse coding （TBGSC） is presented for image interpolation. The outer-level Bregman iterative procedure enforces the observation data constraints, while the inne...A two-level Bregmanized method with graph regularized sparse coding （TBGSC） is presented for image interpolation. The outer-level Bregman iterative procedure enforces the observation data constraints, while the inner-level Bregmanized method devotes to dictionary updating and sparse represention of small overlapping image patches. The introduced constraint of graph regularized sparse coding can capture local image features effectively, and consequently enables accurate reconstruction from highly undersampled partial data. Furthermore, modified sparse coding and simple dictionary updating applied in the inner minimization make the proposed algorithm converge within a relatively small number of iterations. Experimental results demonstrate that the proposed algorithm can effectively reconstruct images and it outperforms the current state-of-the-art approaches in terms of visual comparisons and quantitative measures.展开更多
This paper concentrates on super-resolution imaging of the ship target under the sparse aperture situation.Firstly,a multi-static configuration is utilized to solve the coherent processing interval(CPI)problem caused ...This paper concentrates on super-resolution imaging of the ship target under the sparse aperture situation.Firstly,a multi-static configuration is utilized to solve the coherent processing interval(CPI)problem caused by the slow-speed motion of ship targets.Then,we realize signal restoration and image reconstruction with the alternating direction method of multipliers(ADMM).Furthermore,we adopt the interferometric technique to produce the three-dimensional(3D)images of ship targets,namely interferometric inverse synthetic aperture radar(InISAR)imaging.Experiments based on the simulated data are utilized to verify the validity of the proposed method.展开更多
The imaging speed is a bottleneck for magnetic resonance imaging( MRI) since it appears. To alleviate this difficulty,a novel graph regularized sparse coding method for highly undersampled MRI reconstruction( GSCMRI) ...The imaging speed is a bottleneck for magnetic resonance imaging( MRI) since it appears. To alleviate this difficulty,a novel graph regularized sparse coding method for highly undersampled MRI reconstruction( GSCMRI) was proposed. The graph regularized sparse coding showed the potential in maintaining the geometrical information of the data. In this study, it was incorporated with two-level Bregman iterative procedure that updated the data term in outer-level and learned dictionary in innerlevel. Moreover,the graph regularized sparse coding and simple dictionary updating stages derived by the inner minimization made the proposed algorithm converge in few iterations, meanwhile achieving superior reconstruction performance. Extensive experimental results have demonstrated GSCMRI can consistently recover both real-valued MR images and complex-valued MR data efficiently,and outperform the current state-of-the-art approaches in terms of higher PSNR and lower HFEN values.展开更多
Motivated by local coordinate coding(LCC) theory in nonlinear manifold learning, a new image representation model called local sparse representation(LSR) for astronomical image denoising was proposed. Borrowing ideas ...Motivated by local coordinate coding(LCC) theory in nonlinear manifold learning, a new image representation model called local sparse representation(LSR) for astronomical image denoising was proposed. Borrowing ideas from surrogate function and applying the iterative shrinkage-thresholding algorithm(ISTA), an iterative shrinkage operator for LSR was derived. Meanwhile, a fast approximated LSR method by first performing a K-nearest-neighbor search and then solving a l1optimization problem was presented under the guarantee of denoising performance. In addition, the LSR model and adaptive dictionary learning were incorporated into a unified optimization framework, which explicitly established the inner connection of them. Such processing allows us to simultaneously update sparse coding vectors and the dictionary by alternating optimization method. The experimental results show that the proposed method is superior to the traditional denoising method and reaches state-of-the-art performance on astronomical image.展开更多
The concept of structured sparse coding noise is introduced to exploit the spatial correlations and nonlocal constraint of the local structure. Then the model of nonlocally centralized simultaneous sparse coding(NCSSC...The concept of structured sparse coding noise is introduced to exploit the spatial correlations and nonlocal constraint of the local structure. Then the model of nonlocally centralized simultaneous sparse coding(NCSSC)is proposed for reconstructing the original image, and an algorithm is proposed to transform the simultaneous sparse coding into reweighted low-rank approximation. Experimental results on image denoisng, deblurring and super-resolution demonstrate the advantage of the proposed NC-SSC method over the state-of-the-art image restoration methods.展开更多
Image denoising is a well-studied problem closely related to sparse coding. Noticing that the Laplacian distribution has a strong sparseness, we use Laplacian scale mixture to model sparse coefficients. With the obser...Image denoising is a well-studied problem closely related to sparse coding. Noticing that the Laplacian distribution has a strong sparseness, we use Laplacian scale mixture to model sparse coefficients. With the observation that prior information of an image is relevant to the estimation of sparse coefficients, we introduce the prior information into maximum a posteriori（MAP） estimation of sparse coefficients by an appropriate estimate of the probability density function. Extending to structured sparsity, a nonlocal image denoising model： Improved Simultaneous Sparse Coding with Laplacian Scale Mixture（ISSC-LSM） is proposed. The centering preprocessing, which admits biased-mean of sparse coefficients and saves expensive computation, is done firstly. By alternating minimization and learning an orthogonal PCA dictionary, an efficient algorithm with closed-form solutions is proposed. When applied to noise removal, our proposed ISSC-LSM can capture structured image features, and the adoption of image prior information leads to highly competitive denoising performance. Experimental results show that the proposed method often provides higher subjective and objective qualities than other competing approaches. Our method is most suitable for processing images with abundant self-repeating patterns by effectively suppressing undesirable artifacts while maintaining the textures and edges.展开更多
In practice,simultaneous impact localization and time history reconstruction can hardly be achieved,due to the illposed and under-determined problems induced by the constrained and harsh measuring conditions.Although ...In practice,simultaneous impact localization and time history reconstruction can hardly be achieved,due to the illposed and under-determined problems induced by the constrained and harsh measuring conditions.Although l_(1) regularization can be used to obtain sparse solutions,it tends to underestimate solution amplitudes as a biased estimator.To address this issue,a novel impact force identification method with l_(p) regularization is proposed in this paper,using the alternating direction method of multipliers(ADMM).By decomposing the complex primal problem into sub-problems solvable in parallel via proximal operators,ADMM can address the challenge effectively.To mitigate the sensitivity to regularization parameters,an adaptive regularization parameter is derived based on the K-sparsity strategy.Then,an ADMM-based sparse regularization method is developed,which is capable of handling l_(p) regularization with arbitrary p values using adaptively-updated parameters.The effectiveness and performance of the proposed method are validated on an aircraft skin-like composite structure.Additionally,an investigation into the optimal p value for achieving high-accuracy solutions via l_(p) regularization is conducted.It turns out that l_(0.6)regularization consistently yields sparser and more accurate solutions for impact force identification compared to the classic l_(1) regularization method.The impact force identification method proposed in this paper can simultaneously reconstruct impact time history with high accuracy and accurately localize the impact using an under-determined sensor configuration.展开更多
In this paper, a two-level Bregman method is presented with graph regularized sparse coding for highly undersampled magnetic resonance image reconstruction. The graph regularized sparse coding is incorporated with the...In this paper, a two-level Bregman method is presented with graph regularized sparse coding for highly undersampled magnetic resonance image reconstruction. The graph regularized sparse coding is incorporated with the two-level Bregman iterative procedure which enforces the sampled data constraints in the outer level and updates dictionary and sparse representation in the inner level. Graph regularized sparse coding and simple dictionary updating applied in the inner minimization make the proposed algorithm converge with a relatively small number of iterations. Experimental results demonstrate that the proposed algorithm can consistently reconstruct both simulated MR images and real MR data efficiently, and outperforms the current state-of-the-art approaches in terms of visual comparisons and quantitative measures.展开更多
The sparse phase retrieval aims to recover the sparse signal from quadratic measurements. However, the measurements are often affected by outliers and asymmetric distribution noise. This paper introduces a novel metho...The sparse phase retrieval aims to recover the sparse signal from quadratic measurements. However, the measurements are often affected by outliers and asymmetric distribution noise. This paper introduces a novel method that combines the quantile regression and the L<sub>1/2</sub>-regularizer. It is a non-convex, non-smooth, non-Lipschitz optimization problem. We propose an efficient algorithm based on the Alternating Direction Methods of Multiplier (ADMM) to solve the corresponding optimization problem. Numerous numerical experiments show that this method can recover sparse signals with fewer measurements and is robust to dense bounded noise and Laplace noise.展开更多
We consider a convex relaxation of sparse principal component analysisproposed by d' Aspremont et al. (SIAM Rev. 49:434 448, 2007). This convex relax-ation is a nonsmooth semidefinite programming problem in which ...We consider a convex relaxation of sparse principal component analysisproposed by d' Aspremont et al. (SIAM Rev. 49:434 448, 2007). This convex relax-ation is a nonsmooth semidefinite programming problem in which the ξ1 norm of thedesired matrix is imposed in either the objective function or the constraint to improvethe sparsity of the resulting matrix. The sparse principal component is obtained by arank- one decomposition of the resulting sparse matrix. We propose an alternating di-rection method based on a variable-splitting technique and an augmented I agrangianframework for solving this nonsmooth semidefinite programming problem. In con-trast to the first-order method proposed in d' Aspremont et al. (SIAM Rev. 49:434448, 2007), which solves approximately the dual problem of the original semidefiniteprogramming problem, our method deals with the primal problem directly and solvesit exactly, which guarantees that the resulting matrix is a sparse matrix. A globalconvergence result is established for the proposed method. Numerical results on bothsynthetic problems and the real applications from classification of text data and senatevoting data are reported to demonstrate the efficacy of our method.展开更多
瑞雷波勘探主要利用瑞雷波的频散特征,揭示地下介质的性质和结构变化.近年来主要用于解决地质结构识别、介质特性分析、地震风险评估、矿产资源勘探等问题.瑞雷波频散曲线反演存在收敛速度慢、噪声干扰、陷入局部极小值等问题.本文尝试...瑞雷波勘探主要利用瑞雷波的频散特征,揭示地下介质的性质和结构变化.近年来主要用于解决地质结构识别、介质特性分析、地震风险评估、矿产资源勘探等问题.瑞雷波频散曲线反演存在收敛速度慢、噪声干扰、陷入局部极小值等问题.本文尝试提出一种针对瑞雷波频散曲线反演的Tikhonov正则化与优化算法:在反演建模过程中引入模型的L1范数施加稀疏正则化约束,增强模型的泛化能力,以减少分层精细化产生的误差,提高反演精度,使反演结果更贴近实际模型.针对稀疏正则化模型,在求解最小化问题上,利用交替方向乘子法(Alternating Direction Method of Multipliers,ADMM)求解最小值.使用理论地质模型和实际数据进行测试,实验结果表明,本文提出的方法与最小二乘法相比,反演结果精度更高、稳定性更好.展开更多
真实的高光谱图像HSI(Hyperspectral Image)容易遭受高强度混合噪声的破坏,如何精确地对噪声进行建模在后续处理任务中至关重要。非对称拉普拉斯噪声建模方法具有较好的混合噪声去除效果,该类方法优点是考虑到噪声的重尾性和非对称性,...真实的高光谱图像HSI(Hyperspectral Image)容易遭受高强度混合噪声的破坏,如何精确地对噪声进行建模在后续处理任务中至关重要。非对称拉普拉斯噪声建模方法具有较好的混合噪声去除效果,该类方法优点是考虑到噪声的重尾性和非对称性,对不同波段的不同噪声进行建模,然而却忽略了HSI梯度基空间的内在分布特征,导致噪声残留。针对此问题,本研究提出基空间非对称拉普拉斯全变分BSALTV(Base Space Asymmetric Laplacian Total Variational)的HSI去噪模型。此外,梯度基空间Ui充分保留了原始梯度图的先验信息,能够更好地反映HSI梯度的稀疏先验分布特征,并且在不同波段上呈现出独特的非对称分布。本研究通过对梯度基Ui和噪声的非对称分布进行探索,精确挖掘了图像的全局低秩信息和不同波段的噪声分布特征,从而在保持图像边缘和纹理的同时减少噪声,避免了图像失真和过度平滑。最后,通过交替方向乘子法ADMM(Alternating Direction Method of Multipliers)算法求解模型,与其他对比方法进行对比,验证本研究提出模型,在合成和真实数据集上的实验结果表明,本研究所提方法优于对比的其他先进的降噪方法。展开更多
基金The National Natural Science Foundation of China(No.61871213,61673108,61571106)Six Talent Peaks Project in Jiangsu Province(No.2016-DZXX-023)
文摘In order to improve the efficiency of speech emotion recognition across corpora,a speech emotion transfer learning method based on the deep sparse auto-encoder is proposed.The algorithm first reconstructs a small amount of data in the target domain by training the deep sparse auto-encoder,so that the encoder can learn the low-dimensional structural representation of the target domain data.Then,the source domain data and the target domain data are coded by the trained deep sparse auto-encoder to obtain the reconstruction data of the low-dimensional structural representation close to the target domain.Finally,a part of the reconstructed tagged target domain data is mixed with the reconstructed source domain data to jointly train the classifier.This part of the target domain data is used to guide the source domain data.Experiments on the CASIA,SoutheastLab corpus show that the model recognition rate after a small amount of data transferred reached 89.2%and 72.4%on the DNN.Compared to the training results of the complete original corpus,it only decreased by 2%in the CASIA corpus,and only 3.4%in the SoutheastLab corpus.Experiments show that the algorithm can achieve the effect of labeling all data in the extreme case that the data set has only a small amount of data tagged.
基金The National Natural Science Foundation of China (No.61362001,61102043,61262084,20132BAB211030,20122BAB211015)the Basic Research Program of Shenzhen(No.JC201104220219A)
文摘A two-level Bregmanized method with graph regularized sparse coding （TBGSC） is presented for image interpolation. The outer-level Bregman iterative procedure enforces the observation data constraints, while the inner-level Bregmanized method devotes to dictionary updating and sparse represention of small overlapping image patches. The introduced constraint of graph regularized sparse coding can capture local image features effectively, and consequently enables accurate reconstruction from highly undersampled partial data. Furthermore, modified sparse coding and simple dictionary updating applied in the inner minimization make the proposed algorithm converge within a relatively small number of iterations. Experimental results demonstrate that the proposed algorithm can effectively reconstruct images and it outperforms the current state-of-the-art approaches in terms of visual comparisons and quantitative measures.
基金This work was supported by the National Natural Science Foundation of China(61871146).
文摘This paper concentrates on super-resolution imaging of the ship target under the sparse aperture situation.Firstly,a multi-static configuration is utilized to solve the coherent processing interval(CPI)problem caused by the slow-speed motion of ship targets.Then,we realize signal restoration and image reconstruction with the alternating direction method of multipliers(ADMM).Furthermore,we adopt the interferometric technique to produce the three-dimensional(3D)images of ship targets,namely interferometric inverse synthetic aperture radar(InISAR)imaging.Experiments based on the simulated data are utilized to verify the validity of the proposed method.
基金National Natural Science Foundations of China(Nos.61362001,61102043,61262084)Technology Foundations of Department of Education of Jiangxi Province,China(Nos.GJJ12006,GJJ14196)Natural Science Foundations of Jiangxi Province,China(Nos.20132BAB211030,20122BAB211015)
文摘The imaging speed is a bottleneck for magnetic resonance imaging( MRI) since it appears. To alleviate this difficulty,a novel graph regularized sparse coding method for highly undersampled MRI reconstruction( GSCMRI) was proposed. The graph regularized sparse coding showed the potential in maintaining the geometrical information of the data. In this study, it was incorporated with two-level Bregman iterative procedure that updated the data term in outer-level and learned dictionary in innerlevel. Moreover,the graph regularized sparse coding and simple dictionary updating stages derived by the inner minimization made the proposed algorithm converge in few iterations, meanwhile achieving superior reconstruction performance. Extensive experimental results have demonstrated GSCMRI can consistently recover both real-valued MR images and complex-valued MR data efficiently,and outperform the current state-of-the-art approaches in terms of higher PSNR and lower HFEN values.
基金Project(60972114) supported by the National Natural Science Foundation of ChinaProject(2012M512168) supported by China Postdoctoral Science Foundation
文摘Motivated by local coordinate coding(LCC) theory in nonlinear manifold learning, a new image representation model called local sparse representation(LSR) for astronomical image denoising was proposed. Borrowing ideas from surrogate function and applying the iterative shrinkage-thresholding algorithm(ISTA), an iterative shrinkage operator for LSR was derived. Meanwhile, a fast approximated LSR method by first performing a K-nearest-neighbor search and then solving a l1optimization problem was presented under the guarantee of denoising performance. In addition, the LSR model and adaptive dictionary learning were incorporated into a unified optimization framework, which explicitly established the inner connection of them. Such processing allows us to simultaneously update sparse coding vectors and the dictionary by alternating optimization method. The experimental results show that the proposed method is superior to the traditional denoising method and reaches state-of-the-art performance on astronomical image.
基金Supported by the National Natural Science Foundation of China(No.61379014)
文摘The concept of structured sparse coding noise is introduced to exploit the spatial correlations and nonlocal constraint of the local structure. Then the model of nonlocally centralized simultaneous sparse coding(NCSSC)is proposed for reconstructing the original image, and an algorithm is proposed to transform the simultaneous sparse coding into reweighted low-rank approximation. Experimental results on image denoisng, deblurring and super-resolution demonstrate the advantage of the proposed NC-SSC method over the state-of-the-art image restoration methods.
基金Manuscript received February 13, 2016 accepted December 7, 2016. This work was supported by the National Natural Science Foundation of China （61362001, 61661031）, Jiangxi Province Innovation Projects for Postgraduate Funds （YC2016-S006）, the International Postdoctoral Exchange Fellowship Program, and Jiangxi Advanced Project for Post-Doctoral Research Fund （2014KY02）.
基金Supported by the National Natural Science Foundation of China(61573014)
文摘Image denoising is a well-studied problem closely related to sparse coding. Noticing that the Laplacian distribution has a strong sparseness, we use Laplacian scale mixture to model sparse coefficients. With the observation that prior information of an image is relevant to the estimation of sparse coefficients, we introduce the prior information into maximum a posteriori（MAP） estimation of sparse coefficients by an appropriate estimate of the probability density function. Extending to structured sparsity, a nonlocal image denoising model： Improved Simultaneous Sparse Coding with Laplacian Scale Mixture（ISSC-LSM） is proposed. The centering preprocessing, which admits biased-mean of sparse coefficients and saves expensive computation, is done firstly. By alternating minimization and learning an orthogonal PCA dictionary, an efficient algorithm with closed-form solutions is proposed. When applied to noise removal, our proposed ISSC-LSM can capture structured image features, and the adoption of image prior information leads to highly competitive denoising performance. Experimental results show that the proposed method often provides higher subjective and objective qualities than other competing approaches. Our method is most suitable for processing images with abundant self-repeating patterns by effectively suppressing undesirable artifacts while maintaining the textures and edges.
基金Supported by National Natural Science Foundation of China (Grant Nos.52305127,52075414)China Postdoctoral Science Foundation (Grant No.2021M702595)。
文摘In practice,simultaneous impact localization and time history reconstruction can hardly be achieved,due to the illposed and under-determined problems induced by the constrained and harsh measuring conditions.Although l_(1) regularization can be used to obtain sparse solutions,it tends to underestimate solution amplitudes as a biased estimator.To address this issue,a novel impact force identification method with l_(p) regularization is proposed in this paper,using the alternating direction method of multipliers(ADMM).By decomposing the complex primal problem into sub-problems solvable in parallel via proximal operators,ADMM can address the challenge effectively.To mitigate the sensitivity to regularization parameters,an adaptive regularization parameter is derived based on the K-sparsity strategy.Then,an ADMM-based sparse regularization method is developed,which is capable of handling l_(p) regularization with arbitrary p values using adaptively-updated parameters.The effectiveness and performance of the proposed method are validated on an aircraft skin-like composite structure.Additionally,an investigation into the optimal p value for achieving high-accuracy solutions via l_(p) regularization is conducted.It turns out that l_(0.6)regularization consistently yields sparser and more accurate solutions for impact force identification compared to the classic l_(1) regularization method.The impact force identification method proposed in this paper can simultaneously reconstruct impact time history with high accuracy and accurately localize the impact using an under-determined sensor configuration.
基金Supported by the National Natural Science Foundation of China(No.61261010No.61362001+7 种基金No.61365013No.61262084No.51165033)Technology Foundation of Department of Education in Jiangxi Province(GJJ13061GJJ14196)Young Scientists Training Plan of Jiangxi Province(No.20133ACB21007No.20142BCB23001)National Post-Doctoral Research Fund(No.2014M551867)and Jiangxi Advanced Project for Post-Doctoral Research Fund(No.2014KY02)
文摘In this paper, a two-level Bregman method is presented with graph regularized sparse coding for highly undersampled magnetic resonance image reconstruction. The graph regularized sparse coding is incorporated with the two-level Bregman iterative procedure which enforces the sampled data constraints in the outer level and updates dictionary and sparse representation in the inner level. Graph regularized sparse coding and simple dictionary updating applied in the inner minimization make the proposed algorithm converge with a relatively small number of iterations. Experimental results demonstrate that the proposed algorithm can consistently reconstruct both simulated MR images and real MR data efficiently, and outperforms the current state-of-the-art approaches in terms of visual comparisons and quantitative measures.
文摘The sparse phase retrieval aims to recover the sparse signal from quadratic measurements. However, the measurements are often affected by outliers and asymmetric distribution noise. This paper introduces a novel method that combines the quantile regression and the L<sub>1/2</sub>-regularizer. It is a non-convex, non-smooth, non-Lipschitz optimization problem. We propose an efficient algorithm based on the Alternating Direction Methods of Multiplier (ADMM) to solve the corresponding optimization problem. Numerous numerical experiments show that this method can recover sparse signals with fewer measurements and is robust to dense bounded noise and Laplace noise.
文摘We consider a convex relaxation of sparse principal component analysisproposed by d' Aspremont et al. (SIAM Rev. 49:434 448, 2007). This convex relax-ation is a nonsmooth semidefinite programming problem in which the ξ1 norm of thedesired matrix is imposed in either the objective function or the constraint to improvethe sparsity of the resulting matrix. The sparse principal component is obtained by arank- one decomposition of the resulting sparse matrix. We propose an alternating di-rection method based on a variable-splitting technique and an augmented I agrangianframework for solving this nonsmooth semidefinite programming problem. In con-trast to the first-order method proposed in d' Aspremont et al. (SIAM Rev. 49:434448, 2007), which solves approximately the dual problem of the original semidefiniteprogramming problem, our method deals with the primal problem directly and solvesit exactly, which guarantees that the resulting matrix is a sparse matrix. A globalconvergence result is established for the proposed method. Numerical results on bothsynthetic problems and the real applications from classification of text data and senatevoting data are reported to demonstrate the efficacy of our method.
文摘瑞雷波勘探主要利用瑞雷波的频散特征,揭示地下介质的性质和结构变化.近年来主要用于解决地质结构识别、介质特性分析、地震风险评估、矿产资源勘探等问题.瑞雷波频散曲线反演存在收敛速度慢、噪声干扰、陷入局部极小值等问题.本文尝试提出一种针对瑞雷波频散曲线反演的Tikhonov正则化与优化算法:在反演建模过程中引入模型的L1范数施加稀疏正则化约束,增强模型的泛化能力,以减少分层精细化产生的误差,提高反演精度,使反演结果更贴近实际模型.针对稀疏正则化模型,在求解最小化问题上,利用交替方向乘子法(Alternating Direction Method of Multipliers,ADMM)求解最小值.使用理论地质模型和实际数据进行测试,实验结果表明,本文提出的方法与最小二乘法相比,反演结果精度更高、稳定性更好.
文摘真实的高光谱图像HSI(Hyperspectral Image)容易遭受高强度混合噪声的破坏,如何精确地对噪声进行建模在后续处理任务中至关重要。非对称拉普拉斯噪声建模方法具有较好的混合噪声去除效果,该类方法优点是考虑到噪声的重尾性和非对称性,对不同波段的不同噪声进行建模,然而却忽略了HSI梯度基空间的内在分布特征,导致噪声残留。针对此问题,本研究提出基空间非对称拉普拉斯全变分BSALTV(Base Space Asymmetric Laplacian Total Variational)的HSI去噪模型。此外,梯度基空间Ui充分保留了原始梯度图的先验信息,能够更好地反映HSI梯度的稀疏先验分布特征,并且在不同波段上呈现出独特的非对称分布。本研究通过对梯度基Ui和噪声的非对称分布进行探索,精确挖掘了图像的全局低秩信息和不同波段的噪声分布特征,从而在保持图像边缘和纹理的同时减少噪声,避免了图像失真和过度平滑。最后,通过交替方向乘子法ADMM(Alternating Direction Method of Multipliers)算法求解模型,与其他对比方法进行对比,验证本研究提出模型,在合成和真实数据集上的实验结果表明,本研究所提方法优于对比的其他先进的降噪方法。
