基于Karhunen-Loève变换和小波谱特征矢量量化的三维谱像数据压缩

提出了基于Karhunen Lo埁ｖｅ变换的小波谱特征矢量量化三维谱像数据压缩方法耍幔颍瑁酰睿澹?Lo埁ｖｅ变换 /小波变换 /小波谱特征矢量量化方法应用了Karhunen Lo埁ｖｅ变换的消除谱相关性优良性能 ,应用二维小波变换消除空间相关性 ,在小波变换域内应用二维集分割嵌入块编码和一维谱特征矢量量化对三维谱像数据压缩 ,获得较高的压缩性能。实验结果表明 :Karhunen Lo埁ｖｅ变换 /小波变换 /小波谱特征矢量量化编码比Karhunen Lo埁ｖｅ变换 /小波变换 /改进对块零树编码和Karhunen Lo埁ｖｅ变换 /小波变换 /快速矢量量化编码方法在同样压缩比条件下 ,峰值信噪比提高 2dB和 1dB以上 ,而速度提高了 1.5和 8倍 ,整体压缩性能有较大的提高     

基于可逆整数变换的高光谱图像无损压缩

将变换矩阵分解为三角可逆矩阵(TERM)实现的整数Karhunen-Loève变换(IKLT),具有结构简单、完全可逆和同址运算的优点.将整数KLT和整数小波结合(IWT),提出了一种基于可逆整数变换的去相关方法：将KLT用于去除谱间冗余,并在对KLT的变换矩阵进行TERM分解的过程中,提出基于全局最大值选择主元的优化分解方法,保证了IKLT的准确度,同时明显降低了计算量；空间维的去相关变换采用基于提升结构的整数小波变换,同样保证了变换的完全可逆.采用不同编码策略,对不同场景的高光谱图像数据压缩的实验结果表明,基于整数混合变换的去相关方法能明显提高无损压缩比.     

改进的对块零树编码压缩方法对超光谱数据压缩

提出了对块零树的预测二值标量量化压缩编码方法，给出了压缩比公式，并应用此压缩编码实现了对超细光谱数据的压缩，该压缩编码方法既具有小波零树压缩编码高压缩比和宜于实时实现的特点，同时具有编码，解码速度快和易于实时传输等优点，实验结果表明，改进的对块零树编码压缩（IBBZTC）方法在不传输剩余误差的情况下，达到190倍的压缩比时，峰值信噪比仍然在30dB以上，压缩性能优于KL变换－静止图像压缩（KLT－JPEG），小波变换－矢量量化（WT－VQ），小波变换一零树矢量量化（WT－ZTVQ）和对块零树编码压缩方法。     

基于二进制小波变换和改进SPIHT算法的图像编码方法

提出了一种基于二进制小波变换和改进SPIHT算法的图像编码方法.二进制小波变换将图像从实数域变换到实数域,消除像素之间的空间冗余性,得到了具有整数准确度的紧致描述.针对传统SPIHT算法解码图像视觉效果差的缺点,提出了改进方法.根据图像分析结果,将二进制小波变换变换系数按视觉重要性重新排序,通过对视觉重要系数优先编码,把量化误差集中在视觉不敏感区域,从而在不影响编码率失真性能的同时,有效地提高了解码图像的视觉效果.实验结果表明,和其它流行的编码算法相比,本文算法对不同性质的图像具有最优的编码性能和视觉效果.     

基于改进提升小波变换SPIHT的图像压缩算法

通过对提升小波变换的SPIHT算法进行改进和优化,提出了一种适用于无线多媒体传感器网络(WMSNs)的简单、高效、节能的有损图像压缩算法;该算法采用只包含加法和移位操作的整数小波提升算法,使得小波分解的计算量减半,大大提高了变换速度;采用量化截断的预处理技术,省去大量不重要高频系数的量化编码,解决了提升变换后SPIHT算法编码效率低的问题;去除了最外层高频系数的分解和编码,有效地减少了变换和编码的能耗;理论分析和仿真结果均表明,在保证一定重建图像质量的前提下,该算法大大降低了图像压缩能耗,提高了算法的压缩效率和执行效率,非常适合于资源受限的WMSNs中的图像压缩。     

基于直方图变换的多光谱图像3D SPIHT压缩编码算法

提出了新的多光谱图像压缩方案,直方图变换的三维分层树的集划分(3D SPIHT)压缩编码算法。基于多光谱图像的成像特点,在去相关之前,提出一种可逆的直方图变换方法对多光谱各波段图像灰度值进行调整,来提高各波段间的相关性,然后再对变换后的图像利用K_L和二维小波变换去除谱间冗余和空间冗余。小波编码采用两种编码方案:3D_SPIHT以及对它进行改进后的三维位平面的SPIHT算法,并对两者进行了比较。实验表明,采用直方图变换的这两种方法都获得了良好的效果,比没变换前有更好的图像质量和压缩性能。     

一种基于高分辨力遥感器的星上数据压缩方法

随着航天技术的发展,遥感器星上数据压缩变得越来越重要。提出了一种基于小波变换的压缩编码方法。首先对遥感图像进行双正交小波变换;然后在分析SPIHT、矢量量化、分形三种具有代表性的编码方法的基础上,提出了“带固定零区间的标量量化+改进游程编码”的编码方法;最后进行了试验。此方法具有以下特点:图像重构后具有较高的PSNR(40dB);算法简单,易于硬件的实现,实时性好;压缩比约为5∶1,但仍有提升的空间。此方法可满足高分辨力遥感图像对测量精度和实时性的要求,压缩比虽然未达到8∶1,但高于法国SPOT5的3∶1和美国Ikonos_2的11∶2.6。     

二维提升的CDF(1,3)小波结合改进的SPIHT的渐进性无损图像压缩方法

针对传统小波变换计算复杂的缺点和多级树集合分裂算法(SPIHT)编码过程重复运算、存储量大的问题,提出了一种二维提升的CDF(1,3)小波结合改进的SPIHT的渐进性无损图像压缩方法。对整数CDF(1,3)双正交小波变换实现二维提升,利用提升的小波对图像做变换,提高了运算速度、便于硬件实现。对SPIHT算法加以改进,根据各个子图像的不同特点,改变扫描路线,采用四路并行分块处理的方法,提高了编码速度,降低了编解码过程的运算复杂度和时间消耗。利用提升的CDF(1,3)小波变换结合改进的SPIHT实现了渐进性无损图像压缩,证明了二维提升方案的有效性。     

实时数字图像无损压缩的研究

针对实时数字图像的无损压缩方法进行了分析,采用三级5-3整数提升小波变换,小波变换的高频和低频系数分别采用不同的编码方法。进行了基于DSP和FPGA的压缩系统结构设计,提出了软、硬件并行的方法。进行三级小波变换时,硬件结构能够实现在对当前级小波变换的同时进行前一级小波变换的高频系数编码,提高了压缩系统的实时性。并对压缩系统的关键技术进行了研究。可以对80MB/s的数字图像进行无损压缩,压缩比可以达到1.68~1.8左右。     

基于混沌与快速小波变换的多光谱图像压缩加密算法

针对多光谱图像存储和传输安全性问题,提出一种将混沌思想、小波变换和KL（karhunen-loeve）变换相结合的多光谱图像压缩加密算法。首先,采用K-means聚类方案将多光谱图像聚类为通用像素,通过选择合适的K值使算法的性能最优,同时便于后续处理;然后对通用像素进行二维离散9/7小波变换,对变换后的系数进行Arnold变换以及加密处理,消除多光谱图像大部分空间冗余,减少压缩过程中的块效应;之后对产生的小波系数进行改进的KL变换,消除残余空间冗余和光谱冗余;最后采用差分脉冲滤波器对系数进行编码,并采用Tent映射对码流进行混淆扩散加密。通过实验可知,本算法的信息熵达到11.794 3（选取12位多光谱图像）,信息熵更接近最大值12,优于现有算法,可以更好的隐藏原图特征;该算法的像素变化率（NPCR）和归一化平均变化强度(UACI)分别为99.81%和34.19,优于现有的其他算法,本算法可以更好的抵御差分攻击;输出比特流变化率保持在47.62%～47.71%之间,密文比特流变化率保持在47.45%～47.52%,本算法具有较好的密钥敏感性;在压缩比为4∶1～32∶1范围内,系统PSNR在42 dB以上,具有很高的压缩性能。在4∶1～32∶1范围内,本压缩算法达到很高的峰值信噪比,优于现有的压缩算法,在正常工作压缩比为16∶1时,比现有压缩算法的信噪比提高了0.64 dB以上。为进一步验证算法在高压缩比情况下的压缩性能,该研究测试了压缩比为128∶1时系统的信噪比为31.28,此时,重建后的图像较为清晰,优于现有算法1 dB以上。可见,该算法可行,且特别适合对压缩比要求较高的场合,并在频谱保真方面具有较好的效果。     

An Improved 3D SPIHT Coding for Hyperspectral Imagery Data Compression

1　Ｉｎｔｒｏｄｕｃｔｉｏｎ　　Ｃｏｍｐｒｅｓｓｉｏｎｃａｎｂｅａｃｈｉｅｖｅｄｂｙｅｎｃｏｄｉｎｇｔｈｅｔｒａｎｓｆｏｒｍｅｄｄａｔａ .Ａｆｕｎｄａｍｅｎｔａｌｇｏａｌｏｆｄａｔａｃｏｍｐｒｅｓｓｉｏｎｉｓｔｏｒｅｄｕｃｅｔｈｅｂｉｔｒａｔｅｆｏｒｔｒａｎｓｍｉｓｓｉｏｎｏｒｓｔｏｒａｇｅｗｈｉｌｅｍａｉｎｔａｉｎｉｎｇａｎａｃｃｅｐｔａｂｌｅｆｉｄｅｌｉｔｙｏｒｉｍａｇｅｑｕａｌｉｔｙ,ｅｓｐｅｃｉａｌｌｙａｖｏｌｕｍｅｏｆ 3Ｄｈｙｐｅｒｓｐｅｃｔｒａｌｉｍａｇｅｒｙｄａｔａｎｅｅｄｓｕｃｈｐ…     

An Improved 3D SPIHT Coding for Hyperspectral Imagery Data Compression

In this paper, an improved 3D SPIHT compression coding method, naming 3D BCSPIHT, based on wavelet zero tree compression coding (EZW), is used to exploit redundancy in 3D hyperspectral imagery data. The experimental results show that this method can obtain the compression ratio 200 for 224 spectral band data without any K-L transformation (KLT) to remove the spectral correlation, and the total compression performance of this method is better than the method of KLT and other two dimensional transformation (such as 2D DCT and 2DWT) to remove the spectral correlation and spatial redundancy. To compare with the total compression ratio of KLT+JPEG method and KLT+BBZTC method, this method reaches 200 folds at the average PSNR of 32.531 dB. This method enhances 2～5 dB in PSNR at same compression ratio to KLT+BBZTC method, and the average compression rate improves above 15 fold.     

Joint image encryption and compression scheme based on IWT and SPIHT

A joint lossless image encryption and compression scheme based on integer wavelet transform (IWT) and set partitioning in hierarchical trees (SPIHT) is proposed to achieve lossless image encryption and compression simultaneously. Making use of the properties of IWT and SPIHT, encryption and compression are combined. Moreover, the proposed secure set partitioning in hierarchical trees (SSPIHT) via the addition of encryption in the SPIHT coding process has no effect on compression performance. A hyper-chaotic system, nonlinear inverse operation, Secure Hash Algorithm-256(SHA-256), and plaintext-based keystream are all used to enhance the security. The test results indicate that the proposed methods have high security and good lossless compression performance.     

Multispectral image compression using three-dimensional transform zeroblock coding

This paper proposes a new multispectral image data compression algorithm (KLT/WT-3DEZB). The proposed coding strategy consists of three main steps. Firstly, a wavelet transform (WT) is applied to reduce the spatial redundancies. Then, a Karhunen-Loeve transform (KLT) is used to reduce the redundancies in the spectral domain. Finally, a modified SPECK algorithm-three-dimensional embedded zeroblock (3DEZB) algorithm is proposed and used to encode the transformed coefficients. Numerical experiments show that the reconstructed images using the proposed algorithm exhibite a better quality and a higher compression ratio than those obtained by traditional KLT/WT-3DSPIHT, 3DSPIHT, and 3DSPECK algorithms.     

SFCVQ and EZW coding method based on Karhunen-Loeve transformation and integer wavelet transformation

A new hyperspectral image compression method of spectral feature classification vector quantization (SFCVQ) and embedded zero-tree of wavelet (EZW) based on Karhunen-Loeve transformation (KLT) and integer wavelet transformation is represented. In comparison with the other methods, this method not only keeps the characteristics of high compression ratio and easy real-time transmission, but also has the advantage of high computation speed. After lifting based integer wavelet and SFCVQ coding are introduced, a system of nearly lossless compression of hyperspectral images is designed. KLT is used to remove the correlation of spectral redundancy as one-dimensional (1D) linear transform, and SFCVQ coding is applied to enhance compression ratio. The two-dimensional (2D) integer wavelet transformation is adopted for the decorrelation of 2D spatial redundancy. EZW coding method is applied to compress data in wavelet domain. Experimental results show that in comparison with the method of wavelet SFCVQ (WSFCVQ),the method of improved BiBlock zero tree coding (IBBZTC) and the method of feature spectral vector quantization (FSVQ), the peak signal-to-noise ratio (PSNR) of this method can enhance over 9 dB, and the total compression performance is improved greatly.     

A Biblock Wavelet Zero Tree Coding for Hyperspectral Imagery Data Compression

1　ＩｎｔｒｏｄｕｃｔｉｏｎＤｉｇｉｔｉｚｅｄｉｍａｇｅｓｎｅｅｄｓｔｏｒｉｎｇ ,ｔｒａｎｓｍｉｔｔｉｎｇａｎｄｐｒｏｃｅｓｓｉｎｇ ,ａｎｄｄａｔａｃｏｍｐｒｅｓｓｉｏｎｉｓｕｓｕａｌｌｙｉｍｐｌｅｍｅｎｔｅｄ ,ｏｂｔａｉｎｉｎｇｔｈｅｂｉｔｒａｔｅａｎｄｍａｉｎｔａｉｎｉｎｇａｎａｃｃｅｐｔａｂｌｅｆｉｄｅｌｉｔｙｏｒｉｍａｇｅｑｕａｌｉｔｙ .Ｃｏｍｐｒｅｓｓｉｏｎｃａｎｂｅａｃｈｉｅｖｅｄｂｙｔｒａｎｓｆｏｒｍｉｎｇｔｈｅｄａｔａ,ｐｒｏｊｅｃｔｉｎｇｉｔｏｎａｂａｓｉｓｏｆｆｕｎｃｔｉｏｎｓ…     

A Biblock Wavelet Zero Tree Coding for Hyperspectral Imagery Data Compression

In this paper, a biblock zero tree compression coding (BBZTC) method, based on wavelet zero tree compression coding (ZTC), is used to exploit redundancy in hyperspectral imagery data. Because of ZTC scanning every wavelet zero tree coefficients with low efficiency, BBZTC method outperforms ZTC in the aspects of high compression ratio, simple real-time implementing, and higher coding/decoding speed, and convenient real-time transmission. The experimental results show that this method can obtain the compression ratio 17～40 times of 224 spectral bands to remove the spectral correlation without any coding by using KLT, and the total compression performance of KLT+BBZTC method is better than the method of KLT and other one dimensional transformation (such as DCT) to remove the spectral correlation. To compare with the total compression ratio of KLT+JPEG method and SFCVQ method, this method reaches 180 at the PSNR of 33.6 db. This method is superior to the present any other method at compression rate.