为了改善小波变换的图像稀疏表示性能,提出了一种小波域的灰色关联度图像压缩算法.首先,利用小波变换对测试图像进行分解,获得不同区域的小波系数;然后,利用小波系数特点,将灰色关联度用于系数关联度的刻画中,并计算不同尺度间系数的灰...为了改善小波变换的图像稀疏表示性能,提出了一种小波域的灰色关联度图像压缩算法.首先,利用小波变换对测试图像进行分解,获得不同区域的小波系数;然后,利用小波系数特点,将灰色关联度用于系数关联度的刻画中,并计算不同尺度间系数的灰色关联度;根据小波系数区域特征,将小波系数进行分类,构造出不同系数类型下的稀疏表示方法;最后,将该算法应用于图像压缩.实验结果表明,在相同压缩率下,所提算法的客观评价指标峰值信噪比较现有同类算法提高了1.04~3.65 d B,图像主观视觉质量明显提高.所提算法能够结合系数特征和视觉特性自适应地构造字典,提高了图像稀疏表示能力,进一步提高了图像压缩性能.展开更多
数字图像取证是计算机取证、信息安全领域的一门新学科。为实现照片图像与真实感计算机图形的可靠识别,提出一种基于图像稀疏表示的数字图像取证方法,该方法在抵抗压缩方面具有较好性能,从而保证图像压缩不会改变照片图像与真实感计算...数字图像取证是计算机取证、信息安全领域的一门新学科。为实现照片图像与真实感计算机图形的可靠识别,提出一种基于图像稀疏表示的数字图像取证方法,该方法在抵抗压缩方面具有较好性能,从而保证图像压缩不会改变照片图像与真实感计算机图形的真实性本质。Tetrolet变换为保护图像局部几何结构,在L1-范数最小约束下搜索4×4图像块的最优覆盖(Covering)形式,获得图像的稀疏表示。观察自适应值c的统计分布,得到一幅图像中117种Covering出现次数的归一化直方图,从而得到图像的HoC(histogram of covering)特征。实验结果表明,在饱和度(S)分量提取的HoC特征能够很好地刻画照片图像与真实感计算机图形在局部几何结构上的不同统计特性,算法在识别能力、泛化能力,尤其是抵抗压缩能力上表现出良好性能,能够应用于图像真实性检测及照片图像与计算机图形的自动分类。展开更多
In conventional linear spectral mixture analysis model,a class is represented by a single endmember.However,the intra-class spectral variability is usually very large,which makes it difficult to represent a class,and ...In conventional linear spectral mixture analysis model,a class is represented by a single endmember.However,the intra-class spectral variability is usually very large,which makes it difficult to represent a class,and in this case,it leads to incorrect unmixing results. Some proposed algorithms play a positive role in overcoming the endmember variability,but there are shortcomings on computation intensive,unsatisfactory unmixing results and so on. Recently,sparse regression has been applied to unmixing,assuming each mixed pixel can be expressed as a linear combination of only a few spectra in a spectral library. It is essentially the same as multiple endmember spectral unmixing. OMP( orthogonal matching pursuit),a sparse reconstruction algorithm,has advantages of simple structure and high efficiency. However,it does not take into account the constraints of abundance non-negativity and abundance sum-to-one( ANC and ASC),leading to undesirable unmixing results. In order to solve these issues,this paper presents an improved OMP algorithm( fully constraint OMP,FOMP) for multiple endmember hyperspectral sparse unmixing. The proposed algorithm overcomes the shortcomings of OMP,and on the other hand,it solves the problem of endmember variability.The ANC and ASC constraints are firstly added into the OMP algorithm,and then the endmember set is refined by the relative increase in root-mean-square-error( RMSE) to avoid over-fitting,finally pixels are unmixed by their optimal endmember set. The simulated and real hyperspectral data experiments show that FOPM unmixing results are ideally comparable and abundance RMSE reduces much lower than OMP and simple spectral mixture analysis( s SMA),and has a strong anti-noise performance. It proves that multiple endmember spectral mixture analysis is more reasonable.展开更多
It is often necessary to recognize human mouth-states for detecting the number of audio sources and improving the speech recognition capability of an intelligent robot auditory system. A human mouth-state recognition ...It is often necessary to recognize human mouth-states for detecting the number of audio sources and improving the speech recognition capability of an intelligent robot auditory system. A human mouth-state recognition method based on image warping and sparse representation( SR) combined with homotopy is proposed.Using properly warped training mouth-state images as atoms of the overcomplete dictionary overcomes the impact of the diversity of the mouths' scales,shapes and positions so that further improvement of the robustness can be achieved and the requirement for a large number of training samples can be relieved. The homotopy method is employed to compute the expansion coefficients effectively,i. e.,for sparse coding. The orthogonal matching pursuit( OMP) is also tested and compared with the homototy method. Experimental results and comparisons with the state-of-the-art methods have proved the effectiveness of the proposed approach.展开更多
文摘为了改善小波变换的图像稀疏表示性能,提出了一种小波域的灰色关联度图像压缩算法.首先,利用小波变换对测试图像进行分解,获得不同区域的小波系数;然后,利用小波系数特点,将灰色关联度用于系数关联度的刻画中,并计算不同尺度间系数的灰色关联度;根据小波系数区域特征,将小波系数进行分类,构造出不同系数类型下的稀疏表示方法;最后,将该算法应用于图像压缩.实验结果表明,在相同压缩率下,所提算法的客观评价指标峰值信噪比较现有同类算法提高了1.04~3.65 d B,图像主观视觉质量明显提高.所提算法能够结合系数特征和视觉特性自适应地构造字典,提高了图像稀疏表示能力,进一步提高了图像压缩性能.
文摘数字图像取证是计算机取证、信息安全领域的一门新学科。为实现照片图像与真实感计算机图形的可靠识别,提出一种基于图像稀疏表示的数字图像取证方法,该方法在抵抗压缩方面具有较好性能,从而保证图像压缩不会改变照片图像与真实感计算机图形的真实性本质。Tetrolet变换为保护图像局部几何结构,在L1-范数最小约束下搜索4×4图像块的最优覆盖(Covering)形式,获得图像的稀疏表示。观察自适应值c的统计分布,得到一幅图像中117种Covering出现次数的归一化直方图,从而得到图像的HoC(histogram of covering)特征。实验结果表明,在饱和度(S)分量提取的HoC特征能够很好地刻画照片图像与真实感计算机图形在局部几何结构上的不同统计特性,算法在识别能力、泛化能力,尤其是抵抗压缩能力上表现出良好性能,能够应用于图像真实性检测及照片图像与计算机图形的自动分类。
基金Sponsored by the National Natural Science Foundation of China(Grant No.61405041,61571145)the Key Program of Heilongjiang Natural Science Foundation(Grant No.ZD201216)+2 种基金the Program Excellent Academic Leaders of Harbin(Grant No.RC2013XK009003)the China Postdoctoral Science Foundation(Grant No.2014M551221)the Heilongjiang Postdoctoral Science Found(Grant No.LBH-Z13057)
文摘In conventional linear spectral mixture analysis model,a class is represented by a single endmember.However,the intra-class spectral variability is usually very large,which makes it difficult to represent a class,and in this case,it leads to incorrect unmixing results. Some proposed algorithms play a positive role in overcoming the endmember variability,but there are shortcomings on computation intensive,unsatisfactory unmixing results and so on. Recently,sparse regression has been applied to unmixing,assuming each mixed pixel can be expressed as a linear combination of only a few spectra in a spectral library. It is essentially the same as multiple endmember spectral unmixing. OMP( orthogonal matching pursuit),a sparse reconstruction algorithm,has advantages of simple structure and high efficiency. However,it does not take into account the constraints of abundance non-negativity and abundance sum-to-one( ANC and ASC),leading to undesirable unmixing results. In order to solve these issues,this paper presents an improved OMP algorithm( fully constraint OMP,FOMP) for multiple endmember hyperspectral sparse unmixing. The proposed algorithm overcomes the shortcomings of OMP,and on the other hand,it solves the problem of endmember variability.The ANC and ASC constraints are firstly added into the OMP algorithm,and then the endmember set is refined by the relative increase in root-mean-square-error( RMSE) to avoid over-fitting,finally pixels are unmixed by their optimal endmember set. The simulated and real hyperspectral data experiments show that FOPM unmixing results are ideally comparable and abundance RMSE reduces much lower than OMP and simple spectral mixture analysis( s SMA),and has a strong anti-noise performance. It proves that multiple endmember spectral mixture analysis is more reasonable.
基金National Natural Science Foundation of China(No.61210306074)Natural Science Foundation of Jiangxi Province,China(No.2012BAB201025)the Scientific Program of Jiangxi Provincial Education Department,China(Nos.GJJ14583,GJJ13008)
文摘It is often necessary to recognize human mouth-states for detecting the number of audio sources and improving the speech recognition capability of an intelligent robot auditory system. A human mouth-state recognition method based on image warping and sparse representation( SR) combined with homotopy is proposed.Using properly warped training mouth-state images as atoms of the overcomplete dictionary overcomes the impact of the diversity of the mouths' scales,shapes and positions so that further improvement of the robustness can be achieved and the requirement for a large number of training samples can be relieved. The homotopy method is employed to compute the expansion coefficients effectively,i. e.,for sparse coding. The orthogonal matching pursuit( OMP) is also tested and compared with the homototy method. Experimental results and comparisons with the state-of-the-art methods have proved the effectiveness of the proposed approach.
