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.展开更多
The localized faults of rolling bearings can be diagnosed by its vibration impulsive signals.However,it is always a challenge to extract the impulsive feature under background noise and non-stationary conditions.This ...The localized faults of rolling bearings can be diagnosed by its vibration impulsive signals.However,it is always a challenge to extract the impulsive feature under background noise and non-stationary conditions.This paper investigates impulsive signals detection of a single-point defect rolling bearing and presents a novel data-driven detection approach based on dictionary learning.To overcome the effects harmonic and noise components,we propose an autoregressive-minimum entropy deconvolution model to separate harmonic and deconvolve the effect of the transmission path.To address the shortcomings of conventional sparse representation under the changeable operation environment,we propose an approach that combines K-clustering with singular value decomposition(K-SVD)and split-Bregman to extract impulsive components precisely.Via experiments on synthetic signals and real run-to-failure signals,the excellent performance for different impulsive signals detection verifies the effectiveness and robustness of the proposed approach.Meanwhile,a comparison with the state-of-the-art methods is illustrated,which shows that the proposed approach can provide more accurate detected impulsive signals.展开更多
To address the issue of finegrained classification of Internet multimedia traffic from a Quality of Service(QoS) perspective with a suitable granularity, this paper defines a new set of QoS classes and presents a modi...To address the issue of finegrained classification of Internet multimedia traffic from a Quality of Service(QoS) perspective with a suitable granularity, this paper defines a new set of QoS classes and presents a modified K-Singular Value Decomposition(K-SVD) method for multimedia identification. After analyzing several instances of typical Internet multimedia traffic captured in a campus network, this paper defines a new set of QoS classes according to the difference in downstream/upstream rates and proposes a modified K-SVD method that can automatically search for underlying structural patterns in the QoS characteristic space. We define bagQoS-words as the set of specific QoS local patterns, which can be expressed by core QoS characteristics. After the dictionary is constructed with an excess quantity of bag-QoSwords, Locality Constrained Feature Coding(LCFC) features of QoS classes are extracted. By associating a set of characteristics with a percentage of error, an objective function is formulated. In accordance with the modified K-SVD, Internet multimedia traffic can be classified into a corresponding QoS class with a linear Support Vector Machines(SVM) clas-sifier. Our experimental results demonstrate the feasibility of the proposed classification method.展开更多
近年来K-SVD字典学习去噪算法因其耗时短、去噪效果好的特点得到广泛关注和应用,但该算法的适用条件为图像的噪声为加性噪声且噪声标准差已知。针对这一情况,先提出一种平滑图像块筛选方法,并将其与奇异值分解(singular value decomposi...近年来K-SVD字典学习去噪算法因其耗时短、去噪效果好的特点得到广泛关注和应用,但该算法的适用条件为图像的噪声为加性噪声且噪声标准差已知。针对这一情况,先提出一种平滑图像块筛选方法,并将其与奇异值分解(singular value decomposition,SVD)相结合实现对图像的噪声标准差估计;再将得到的噪声估计方法与K-SVD字典学习去噪算法结合起来,提出一种具备噪声估计特性的K-SVD字典学习去噪算法。对多种图像的去噪实验结果表明,与Donoho小波软阈值去噪算法、全变分(total variation,TV)去噪算法相比,该算法不仅能够使去噪后图像的峰值信噪比提升1~3 dB,并且能较好地保留图像的细节信息和边缘特征。展开更多
针对磁共振(magnetic resonance,MR)幅度图像中带有不易去除的与信号相关的莱斯(Rician)噪声问题,利用其复数图像中的实部与虚部所含噪声为不相关的加性高斯白噪声这一特性,代替对幅度图像直接去噪,提出将原始对偶字典学习(predual dict...针对磁共振(magnetic resonance,MR)幅度图像中带有不易去除的与信号相关的莱斯(Rician)噪声问题,利用其复数图像中的实部与虚部所含噪声为不相关的加性高斯白噪声这一特性,代替对幅度图像直接去噪,提出将原始对偶字典学习(predual dictionary learning,PDL)算法用于对MR复数图像的实部与虚部分别进行去噪,然后组合得到幅度图像的方法.经仿真实验和在HT-MRSI50-50(50 mm)1.2 T小动物核磁共振系统中的实际应用,证明所提方法较直接对幅度图像去噪取得更好的效果,在有效去除MR图像噪声的同时能较好地保持图像中的细节.与经典的字典学习算法核奇异值分解(kernel singular value decomposition,K-SVD)相比,PDL算法去噪效果优于K-SVD算法,而运算速度提高约5倍.与经典的基于非局部相似块的三维块匹配滤波(block-matching and 3D filtering,BM3D)算法相比,在噪声水平较低时PDL算法略优于BM3D算法,噪声水平较高时BM3D算法略优于PDL算法,两者总体比较接近.展开更多
提出了一种新的图像压缩算法,该算法在K奇异值分解(K-SVD)的基础上,将图像分解成4×4像素的图像块,进行字典学习和稀疏表示,完成图像压缩编码存储;在图像恢复的过程中,通过使用字典学习前保留的边缘,对恢复图像进行修复。实验表明:...提出了一种新的图像压缩算法,该算法在K奇异值分解(K-SVD)的基础上,将图像分解成4×4像素的图像块,进行字典学习和稀疏表示,完成图像压缩编码存储;在图像恢复的过程中,通过使用字典学习前保留的边缘,对恢复图像进行修复。实验表明:在压缩比为20:1时,该算法的峰值信噪比(PSNR)较JPEG算法高出4 d B;用边缘信息修复后,较JPEG算法高出近10 d B,比JPEG2000算法高出3 d B。展开更多
Behind the prevalence of multimedia technology,digital copyright disputes are becoming increasingly serious.The digital watermarking prevention technique against the copyright infringement needs to be improved urgentl...Behind the prevalence of multimedia technology,digital copyright disputes are becoming increasingly serious.The digital watermarking prevention technique against the copyright infringement needs to be improved urgently.Among the proposed technologies,zero-watermarking has been favored recently.In order to improve the robustness of the zero-watermarking,a novel robust audio zerowatermarking method based on sparse representation is proposed.The proposed scheme is mainly based on the K-singular value decomposition(K-SVD)algorithm to construct an optimal over complete dictionary from the background audio signal.After that,the orthogonal matching pursuit(OMP)algorithm is used to calculate the sparse coefficient of the segmented test audio and generate the corresponding sparse coefficient matrix.Then,the mean value of absolute sparse coefficients in the sparse matrix of segmented speech is calculated and selected,and then comparing the mean absolute coefficient of segmented speech with the average value of the selected coefficients to realize the embedding of zero-watermarking.Experimental results show that the proposed audio zerowatermarking algorithm based on sparse representation performs effectively in resisting various common attacks.Compared with the baseline works,the proposed method has better robustness.展开更多
基金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.
基金This work was supported by the National Natural Science Foundation of China(61773080,61633005)the Fundamental Research Funds for the Central Universities(2019CDYGZD001)Scientific Reserve Talent Programs of Chongqing University(cqu2018CDHB1B04).
文摘The localized faults of rolling bearings can be diagnosed by its vibration impulsive signals.However,it is always a challenge to extract the impulsive feature under background noise and non-stationary conditions.This paper investigates impulsive signals detection of a single-point defect rolling bearing and presents a novel data-driven detection approach based on dictionary learning.To overcome the effects harmonic and noise components,we propose an autoregressive-minimum entropy deconvolution model to separate harmonic and deconvolve the effect of the transmission path.To address the shortcomings of conventional sparse representation under the changeable operation environment,we propose an approach that combines K-clustering with singular value decomposition(K-SVD)and split-Bregman to extract impulsive components precisely.Via experiments on synthetic signals and real run-to-failure signals,the excellent performance for different impulsive signals detection verifies the effectiveness and robustness of the proposed approach.Meanwhile,a comparison with the state-of-the-art methods is illustrated,which shows that the proposed approach can provide more accurate detected impulsive signals.
基金supported in part by the National Natural Science Foundation of China (NO. 61401004, 61271233, 60972038)Plan of introduction and cultivation of university leading talents in Anhui (No.gxfxZ D2016013)+3 种基金the Natural Science Foundation of the Higher Education Institutions of Anhui Province, China (No. KJ2010B357)Startup Project of Anhui Normal University Doctor Scientific Research (No.2016XJJ129)the US National Science Foundation under grants CNS1702957 and ACI-1642133the Wireless Engineering Research and Education Center at Auburn University
文摘To address the issue of finegrained classification of Internet multimedia traffic from a Quality of Service(QoS) perspective with a suitable granularity, this paper defines a new set of QoS classes and presents a modified K-Singular Value Decomposition(K-SVD) method for multimedia identification. After analyzing several instances of typical Internet multimedia traffic captured in a campus network, this paper defines a new set of QoS classes according to the difference in downstream/upstream rates and proposes a modified K-SVD method that can automatically search for underlying structural patterns in the QoS characteristic space. We define bagQoS-words as the set of specific QoS local patterns, which can be expressed by core QoS characteristics. After the dictionary is constructed with an excess quantity of bag-QoSwords, Locality Constrained Feature Coding(LCFC) features of QoS classes are extracted. By associating a set of characteristics with a percentage of error, an objective function is formulated. In accordance with the modified K-SVD, Internet multimedia traffic can be classified into a corresponding QoS class with a linear Support Vector Machines(SVM) clas-sifier. Our experimental results demonstrate the feasibility of the proposed classification method.
文摘近年来K-SVD字典学习去噪算法因其耗时短、去噪效果好的特点得到广泛关注和应用,但该算法的适用条件为图像的噪声为加性噪声且噪声标准差已知。针对这一情况,先提出一种平滑图像块筛选方法,并将其与奇异值分解(singular value decomposition,SVD)相结合实现对图像的噪声标准差估计;再将得到的噪声估计方法与K-SVD字典学习去噪算法结合起来,提出一种具备噪声估计特性的K-SVD字典学习去噪算法。对多种图像的去噪实验结果表明,与Donoho小波软阈值去噪算法、全变分(total variation,TV)去噪算法相比,该算法不仅能够使去噪后图像的峰值信噪比提升1~3 dB,并且能较好地保留图像的细节信息和边缘特征。
文摘针对磁共振(magnetic resonance,MR)幅度图像中带有不易去除的与信号相关的莱斯(Rician)噪声问题,利用其复数图像中的实部与虚部所含噪声为不相关的加性高斯白噪声这一特性,代替对幅度图像直接去噪,提出将原始对偶字典学习(predual dictionary learning,PDL)算法用于对MR复数图像的实部与虚部分别进行去噪,然后组合得到幅度图像的方法.经仿真实验和在HT-MRSI50-50(50 mm)1.2 T小动物核磁共振系统中的实际应用,证明所提方法较直接对幅度图像去噪取得更好的效果,在有效去除MR图像噪声的同时能较好地保持图像中的细节.与经典的字典学习算法核奇异值分解(kernel singular value decomposition,K-SVD)相比,PDL算法去噪效果优于K-SVD算法,而运算速度提高约5倍.与经典的基于非局部相似块的三维块匹配滤波(block-matching and 3D filtering,BM3D)算法相比,在噪声水平较低时PDL算法略优于BM3D算法,噪声水平较高时BM3D算法略优于PDL算法,两者总体比较接近.
文摘提出了一种新的图像压缩算法,该算法在K奇异值分解(K-SVD)的基础上,将图像分解成4×4像素的图像块,进行字典学习和稀疏表示,完成图像压缩编码存储;在图像恢复的过程中,通过使用字典学习前保留的边缘,对恢复图像进行修复。实验表明:在压缩比为20:1时,该算法的峰值信噪比(PSNR)较JPEG算法高出4 d B;用边缘信息修复后,较JPEG算法高出近10 d B,比JPEG2000算法高出3 d B。
基金the National Natural Science Foundation of China(No.62001100)the Fundamental Research Funds for the Central Universities(No.2232019D3-52)Shanghai Sailing Program.(No.19YF1402000).
文摘Behind the prevalence of multimedia technology,digital copyright disputes are becoming increasingly serious.The digital watermarking prevention technique against the copyright infringement needs to be improved urgently.Among the proposed technologies,zero-watermarking has been favored recently.In order to improve the robustness of the zero-watermarking,a novel robust audio zerowatermarking method based on sparse representation is proposed.The proposed scheme is mainly based on the K-singular value decomposition(K-SVD)algorithm to construct an optimal over complete dictionary from the background audio signal.After that,the orthogonal matching pursuit(OMP)algorithm is used to calculate the sparse coefficient of the segmented test audio and generate the corresponding sparse coefficient matrix.Then,the mean value of absolute sparse coefficients in the sparse matrix of segmented speech is calculated and selected,and then comparing the mean absolute coefficient of segmented speech with the average value of the selected coefficients to realize the embedding of zero-watermarking.Experimental results show that the proposed audio zerowatermarking algorithm based on sparse representation performs effectively in resisting various common attacks.Compared with the baseline works,the proposed method has better robustness.