This paper is mainly to deal with the problem of direction of arrival(DOA) estimations of multiple narrow-band sources impinging on a uniform linear array under impulsive noise environments. By modeling the impulsive ...This paper is mainly to deal with the problem of direction of arrival(DOA) estimations of multiple narrow-band sources impinging on a uniform linear array under impulsive noise environments. By modeling the impulsive noise as α-stable distribution, new methods which combine the sparse signal representation technique and fractional lower order statistics theory are proposed. In the new algorithms, the fractional lower order statistics vectors of the array output signal are sparsely represented on an overcomplete basis and the DOAs can be effectively estimated by searching the sparsest coefficients. To enhance the robustness performance of the proposed algorithms,the improved algorithms are advanced by eliminating the fractional lower order statistics of the noise from the fractional lower order statistics vector of the array output through a linear transformation. Simulation results have shown the effectiveness of the proposed methods for a wide range of highly impulsive environments.展开更多
This paper considers multi-frequency passive radar and develops a multi-frequency joint direction of arrival(DOA)estimation algorithm to improve estimation accuracy and resolution.The developed algorithm exploits the ...This paper considers multi-frequency passive radar and develops a multi-frequency joint direction of arrival(DOA)estimation algorithm to improve estimation accuracy and resolution.The developed algorithm exploits the sparsity of targets in the spatial domain.Specifically,we first extract the required frequency channel data and acquire the snapshot data through a series of preprocessing such as clutter suppression,coherent integration,beamforming,and constant false alarm rate(CFAR)detection.Then,based on the framework of sparse Bayesian learning,the target’s DOA is estimated by jointly extracting the multi-frequency data via evidence maximization.Simulation results show that the developed algorithm has better estimation accuracy and resolution than other existing multi-frequency DOA estimation algorithms,especially under the scenarios of low signalto-noise ratio(SNR)and small snapshots.Furthermore,the effectiveness is verified by the field experimental data of a multi-frequency FM-based passive radar.展开更多
The method of recovering a low-rank matrix with an unknown fraction whose entries are arbitrarily corrupted is known as the robust principal component analysis (RPCA). This RPCA problem, under some conditions, can b...The method of recovering a low-rank matrix with an unknown fraction whose entries are arbitrarily corrupted is known as the robust principal component analysis (RPCA). This RPCA problem, under some conditions, can be exactly solved via convex optimization by minimizing a combination of the nuclear norm and the 11 norm. In this paper, an algorithm based on the Douglas-Rachford splitting method is proposed for solving the RPCA problem. First, the convex optimization problem is solved by canceling the constraint of the variables, and ~hen the proximity operators of the objective function are computed alternately. The new algorithm can exactly recover the low-rank and sparse components simultaneously, and it is proved to be convergent. Numerical simulations demonstrate the practical utility of the proposed algorithm.展开更多
Machine learning of partial differential equations(PDEs)from data is a potential breakthrough for addressing the lack of physical equations in complex dynamic systems.Recently,sparse regression has emerged as an attra...Machine learning of partial differential equations(PDEs)from data is a potential breakthrough for addressing the lack of physical equations in complex dynamic systems.Recently,sparse regression has emerged as an attractive approach.However,noise presents the biggest challenge in sparse regression for identifying equations,as it relies on local derivative evaluations of noisy data.This study proposes a simple and general approach that significantly improves noise robustness by projecting the evaluated time derivative and partial differential term into a subspace with less noise.This method enables accurate reconstruction of PDEs involving high-order derivatives,even from data with considerable noise.Additionally,we discuss and compare the effects of the proposed method based on Fourier subspace and POD(proper orthogonal decomposition)subspace.Generally,the latter yields better results since it preserves the maximum amount of information.展开更多
Unconstrained face images are interfered by many factors such as illumination,posture,expression,occlusion,age,accessories and so on,resulting in the randomness of the noise pollution implied in the original samples.I...Unconstrained face images are interfered by many factors such as illumination,posture,expression,occlusion,age,accessories and so on,resulting in the randomness of the noise pollution implied in the original samples.In order to improve the sample quality,a weighted block cooperative sparse representation algorithm is proposed based on visual saliency dictionary.First,the algorithm uses the biological visual attention mechanism to quickly and accurately obtain the face salient target and constructs the visual salient dictionary.Then,a block cooperation framework is presented to perform sparse coding for different local structures of human face,and the weighted regular term is introduced in the sparse representation process to enhance the identification of information hidden in the coding coefficients.Finally,by synthesising the sparse representation results of all visual salient block dictionaries,the global coding residual is obtained and the class label is given.The experimental results on four databases,that is,AR,extended Yale B,LFW and PubFig,indicate that the combination of visual saliency dictionary,block cooperative sparse representation and weighted constraint coding can effectively enhance the accuracy of sparse representation of the samples to be tested and improve the performance of unconstrained face recognition.展开更多
Inverse synthetic aperture radar (ISAR) image can be represented and reconstructed by sparse recovery (SR) approaches. However, the existing SR algorithms, which are used for ISAR imaging, have suffered from high comp...Inverse synthetic aperture radar (ISAR) image can be represented and reconstructed by sparse recovery (SR) approaches. However, the existing SR algorithms, which are used for ISAR imaging, have suffered from high computational cost and poor imaging quality under a low signal to noise ratio (SNR) condition. This paper proposes a fast decoupled ISAR imaging method by exploiting the inherent structural sparse information of the targets. Firstly, the ISAR imaging problem is decoupled into two sub-problems. One is range direction imaging and the other is azimuth direction focusing. Secondly, an efficient two-stage SR method is proposed to obtain higher resolution range profiles by using jointly sparse information. Finally, the residual linear Bregman iteration via fast Fourier transforms (RLBI-FFT) is proposed to perform the azimuth focusing on low SNR efficiently. Theoretical analysis and simulation results show that the proposed method has better performence to efficiently implement higher-resolution ISAR imaging under the low SNR condition.展开更多
The transformation of basic functions is one of the most commonly used techniques for seismic denoising,which employs sparse representation of seismic data in the transform domain. The choice of transform base functio...The transformation of basic functions is one of the most commonly used techniques for seismic denoising,which employs sparse representation of seismic data in the transform domain. The choice of transform base functions has an influence on denoising results. We propose a learning-type overcomplete dictionary based on the K-singular value decomposition( K-SVD) algorithm. To construct the dictionary and use it for random seismic noise attenuation,we replace fixed transform base functions with an overcomplete redundancy function library. Owing to the adaptability to data characteristics,the learning-type dictionary describes essential data characteristics much better than conventional denoising methods. The sparsest representation of signals is obtained by the learning and training of seismic data. By comparing the same seismic data obtained using the learning-type overcomplete dictionary based on K-SVD and the data obtained using other denoising methods,we find that the learning-type overcomplete dictionary based on the K-SVD algorithm represents the seismic data more sparsely,effectively suppressing the random noise and improving the signal-to-noise ratio.展开更多
针对现实场景中人脸存在较为随机的局部遮挡的情形,创建了多种遮挡类型并存的过完备字典,并提出改进的稀疏表示分类方法。此算法在稀疏表示分类(Sparse Representation Based Classification,SRC)的基础上引入噪声补偿,通过对测试图像...针对现实场景中人脸存在较为随机的局部遮挡的情形,创建了多种遮挡类型并存的过完备字典,并提出改进的稀疏表示分类方法。此算法在稀疏表示分类(Sparse Representation Based Classification,SRC)的基础上引入噪声补偿,通过对测试图像与去噪图像间噪声差的调节来控制重构图像的生成,进而实现对重构图像与测试图像间残差的控制,以达到准确分类识别的效果。实验结果表明,改进后的算法稳定性好、识别率高,对于局部遮挡图像的识别有较好的鲁棒性。展开更多
Compressed sensing(CS) has achieved great success in single noise removal. However, it cannot restore the images contaminated with mixed noise efficiently. This paper introduces nonlocal similarity and cosparsity insp...Compressed sensing(CS) has achieved great success in single noise removal. However, it cannot restore the images contaminated with mixed noise efficiently. This paper introduces nonlocal similarity and cosparsity inspired by compressed sensing to overcome the difficulties in mixed noise removal, in which nonlocal similarity explores the signal sparsity from similar patches, and cosparsity assumes that the signal is sparse after a possibly redundant transform. Meanwhile, an adaptive scheme is designed to keep the balance between mixed noise removal and detail preservation based on local variance. Finally, IRLSM and RACoSaMP are adopted to solve the objective function. Experimental results demonstrate that the proposed method is superior to conventional CS methods, like K-SVD and state-of-art method nonlocally centralized sparse representation(NCSR), in terms of both visual results and quantitative measures.展开更多
基金supported in part by the National Natural Science Foundation of China(61301228,61371091)the Fundamental Research Funds for the Central Universities(3132014212)
文摘This paper is mainly to deal with the problem of direction of arrival(DOA) estimations of multiple narrow-band sources impinging on a uniform linear array under impulsive noise environments. By modeling the impulsive noise as α-stable distribution, new methods which combine the sparse signal representation technique and fractional lower order statistics theory are proposed. In the new algorithms, the fractional lower order statistics vectors of the array output signal are sparsely represented on an overcomplete basis and the DOAs can be effectively estimated by searching the sparsest coefficients. To enhance the robustness performance of the proposed algorithms,the improved algorithms are advanced by eliminating the fractional lower order statistics of the noise from the fractional lower order statistics vector of the array output through a linear transformation. Simulation results have shown the effectiveness of the proposed methods for a wide range of highly impulsive environments.
基金supported by the National Natural Science Foundation of China(62071335,61931015,61831009)the Technological Innovation Project of Hubei Province of China(2019AAA061).
文摘This paper considers multi-frequency passive radar and develops a multi-frequency joint direction of arrival(DOA)estimation algorithm to improve estimation accuracy and resolution.The developed algorithm exploits the sparsity of targets in the spatial domain.Specifically,we first extract the required frequency channel data and acquire the snapshot data through a series of preprocessing such as clutter suppression,coherent integration,beamforming,and constant false alarm rate(CFAR)detection.Then,based on the framework of sparse Bayesian learning,the target’s DOA is estimated by jointly extracting the multi-frequency data via evidence maximization.Simulation results show that the developed algorithm has better estimation accuracy and resolution than other existing multi-frequency DOA estimation algorithms,especially under the scenarios of low signalto-noise ratio(SNR)and small snapshots.Furthermore,the effectiveness is verified by the field experimental data of a multi-frequency FM-based passive radar.
基金supported by the National Natural Science Foundation of China(No.61271014)the Specialized Research Fund for the Doctoral Program of Higher Education(No.20124301110003)the Graduated Students Innovation Fund of Hunan Province(No.CX2012B238)
文摘The method of recovering a low-rank matrix with an unknown fraction whose entries are arbitrarily corrupted is known as the robust principal component analysis (RPCA). This RPCA problem, under some conditions, can be exactly solved via convex optimization by minimizing a combination of the nuclear norm and the 11 norm. In this paper, an algorithm based on the Douglas-Rachford splitting method is proposed for solving the RPCA problem. First, the convex optimization problem is solved by canceling the constraint of the variables, and ~hen the proximity operators of the objective function are computed alternately. The new algorithm can exactly recover the low-rank and sparse components simultaneously, and it is proved to be convergent. Numerical simulations demonstrate the practical utility of the proposed algorithm.
基金the support of the National Natural Science Foundation of China(Grant No.92152301)。
文摘Machine learning of partial differential equations(PDEs)from data is a potential breakthrough for addressing the lack of physical equations in complex dynamic systems.Recently,sparse regression has emerged as an attractive approach.However,noise presents the biggest challenge in sparse regression for identifying equations,as it relies on local derivative evaluations of noisy data.This study proposes a simple and general approach that significantly improves noise robustness by projecting the evaluated time derivative and partial differential term into a subspace with less noise.This method enables accurate reconstruction of PDEs involving high-order derivatives,even from data with considerable noise.Additionally,we discuss and compare the effects of the proposed method based on Fourier subspace and POD(proper orthogonal decomposition)subspace.Generally,the latter yields better results since it preserves the maximum amount of information.
基金Natural Science Foundation of Jiangsu Province,Grant/Award Number:BK20170765National Natural Science Foundation of China,Grant/Award Number:61703201+1 种基金Future Network Scientific Research Fund Project,Grant/Award Number:FNSRFP2021YB26Science Foundation of Nanjing Institute of Technology,Grant/Award Numbers:ZKJ202002,ZKJ202003,and YKJ202019。
文摘Unconstrained face images are interfered by many factors such as illumination,posture,expression,occlusion,age,accessories and so on,resulting in the randomness of the noise pollution implied in the original samples.In order to improve the sample quality,a weighted block cooperative sparse representation algorithm is proposed based on visual saliency dictionary.First,the algorithm uses the biological visual attention mechanism to quickly and accurately obtain the face salient target and constructs the visual salient dictionary.Then,a block cooperation framework is presented to perform sparse coding for different local structures of human face,and the weighted regular term is introduced in the sparse representation process to enhance the identification of information hidden in the coding coefficients.Finally,by synthesising the sparse representation results of all visual salient block dictionaries,the global coding residual is obtained and the class label is given.The experimental results on four databases,that is,AR,extended Yale B,LFW and PubFig,indicate that the combination of visual saliency dictionary,block cooperative sparse representation and weighted constraint coding can effectively enhance the accuracy of sparse representation of the samples to be tested and improve the performance of unconstrained face recognition.
基金supported by the National Natural Science Foundation of China(61671469)
文摘Inverse synthetic aperture radar (ISAR) image can be represented and reconstructed by sparse recovery (SR) approaches. However, the existing SR algorithms, which are used for ISAR imaging, have suffered from high computational cost and poor imaging quality under a low signal to noise ratio (SNR) condition. This paper proposes a fast decoupled ISAR imaging method by exploiting the inherent structural sparse information of the targets. Firstly, the ISAR imaging problem is decoupled into two sub-problems. One is range direction imaging and the other is azimuth direction focusing. Secondly, an efficient two-stage SR method is proposed to obtain higher resolution range profiles by using jointly sparse information. Finally, the residual linear Bregman iteration via fast Fourier transforms (RLBI-FFT) is proposed to perform the azimuth focusing on low SNR efficiently. Theoretical analysis and simulation results show that the proposed method has better performence to efficiently implement higher-resolution ISAR imaging under the low SNR condition.
基金Supported by the National"863"Project(No.2014AA06A605)
文摘The transformation of basic functions is one of the most commonly used techniques for seismic denoising,which employs sparse representation of seismic data in the transform domain. The choice of transform base functions has an influence on denoising results. We propose a learning-type overcomplete dictionary based on the K-singular value decomposition( K-SVD) algorithm. To construct the dictionary and use it for random seismic noise attenuation,we replace fixed transform base functions with an overcomplete redundancy function library. Owing to the adaptability to data characteristics,the learning-type dictionary describes essential data characteristics much better than conventional denoising methods. The sparsest representation of signals is obtained by the learning and training of seismic data. By comparing the same seismic data obtained using the learning-type overcomplete dictionary based on K-SVD and the data obtained using other denoising methods,we find that the learning-type overcomplete dictionary based on the K-SVD algorithm represents the seismic data more sparsely,effectively suppressing the random noise and improving the signal-to-noise ratio.
文摘针对现实场景中人脸存在较为随机的局部遮挡的情形,创建了多种遮挡类型并存的过完备字典,并提出改进的稀疏表示分类方法。此算法在稀疏表示分类(Sparse Representation Based Classification,SRC)的基础上引入噪声补偿,通过对测试图像与去噪图像间噪声差的调节来控制重构图像的生成,进而实现对重构图像与测试图像间残差的控制,以达到准确分类识别的效果。实验结果表明,改进后的算法稳定性好、识别率高,对于局部遮挡图像的识别有较好的鲁棒性。
基金supported by the National Natural Science Foundation of China(Nos.61403146 and 61603105)the Fundamental Research Funds for the Central Universities(No.2015ZM128)the Science and Technology Program of Guangzhou in China(Nos.201707010054 and 201704030072)
文摘Compressed sensing(CS) has achieved great success in single noise removal. However, it cannot restore the images contaminated with mixed noise efficiently. This paper introduces nonlocal similarity and cosparsity inspired by compressed sensing to overcome the difficulties in mixed noise removal, in which nonlocal similarity explores the signal sparsity from similar patches, and cosparsity assumes that the signal is sparse after a possibly redundant transform. Meanwhile, an adaptive scheme is designed to keep the balance between mixed noise removal and detail preservation based on local variance. Finally, IRLSM and RACoSaMP are adopted to solve the objective function. Experimental results demonstrate that the proposed method is superior to conventional CS methods, like K-SVD and state-of-art method nonlocally centralized sparse representation(NCSR), in terms of both visual results and quantitative measures.