分组Karhun-Loeve变换/整数小波变换高光谱影像准无损压缩新方法

提出了分组Karhunen-Leove变换(KLT)和整数小波变换(IWT)的高光谱图像数据压缩方法,并采用整数小波变换技术和Set Partitioning in Hierarchical Trees(SPIHT)压缩编码,实现了对分组Karhun-Loeve变换后的数据压缩。该压缩编码方法与现有压缩方法相比,既保留了Karhun-Loeve变换压缩性能和整数小波变换高压缩比的特点,也宜于实时传输。实验结果表明,分组Karhun-Loeve变换/整数小波变换/SPIHT在相同压缩比下,峰值信噪比比Karhun-Loeve变换/小波变换/WSFCVQ、Karhun-Loeve变换/小波变换/改进的对块零树编码压缩和Karhun-Loeve变换/WT/FSVQ分别提高了6 dB,9 dB和8 dB,运算时间减少一半,整体压缩性能有了较大的提高。     

Degradative encryption: An efficient way to protect SPIHT compressed images

Degradative encryption, a new selective image encryption paradigm, is proposed to encrypt only a small part of image data to make the detail blurred but keep the skeleton discernible. The efficiency is further optimized by combining compression and encryption. A format-compliant degradative encryption algorithm based on set partitioning in hierarchical trees (SPIHT) is then proposed, and the scheme is designed to work in progressive mode for gaining a tradeoff between efficiency and security. Extensive experiments are conducted to evaluate the strength and efficiency of the scheme, and it is found that less than 10% data need to be encrypted for a secure degradation. In security analysis, the scheme is verified to be immune to cryptographic attacks as well as those adversaries utilizing image processing techniques. The scheme can find its wide applications in online try-and-buy service on mobile devices, searchable multimedia encryption in cloud computing, etc.     

Joint Lossless Image Compression and Encryption Scheme Based on CALIC and Hyperchaotic System

For efficiency and security of image transmission and storage, the joint image compression and encryption method that performs compression and encryption in a single step is a promising solution due to better security. Moreover, on some important occasions, it is necessary to save images in high quality by lossless compression. Thus, a joint lossless image compression and encryption scheme based on a context-based adaptive lossless image codec (CALIC) and hyperchaotic system is proposed to achieve lossless image encryption and compression simultaneously. Making use of the characteristics of CALIC, four encryption locations are designed to realize joint image compression and encryption: encryption for the predicted values of pixels based on gradient-adjusted prediction (GAP), encryption for the final prediction error, encryption for two lines of pixel values needed by prediction mode and encryption for the entropy coding file. Moreover, a new four-dimensional hyperchaotic system and plaintext-related encryption based on table lookup are all used to enhance the security. The security tests show information entropy, correlation and key sensitivity of the proposed methods reach 7.997, 0.01 and 0.4998, respectively. This indicates that the proposed methods have good security. Meanwhile, compared to original CALIC without security, the proposed methods increase the security and reduce the compression ratio by only 6.3%. The test results indicate that the proposed methods have high security and good lossless compression performance.     

基于三维集合分裂嵌入式零块编码算法的超光谱图像压缩

基于超光谱图像的特点,提出了一种三维集合分裂嵌入式零块编码(3D SPEZBC)的超光谱图像压缩算法。该算法首先采用三维小波包变换有效地去除超光谱图像的空间和谱间相关性,然后对于所生成的每个二维子带利用基于集合分裂的方法进行零块编码,最后再采用基于上下文的自适应算术编码来进一步提高编码性能。实验结果表明,3D SPEZBC算法具有与三维嵌入式零块编码(3D EZBC)算法相同的压缩编码性能,在各比特率下编码性能均明显优于三维集合分裂嵌入式块编码(3D SPECK)、三维等级树集合分裂(3D SPIHT)和非对称三维等级树集合分裂(AT-3D SPIHT)算法,并且略好于多分量JPEG2000编码(JPEG2000-MC)算法。此外,3D SPEZBC编码算法不但可以提供较好的率失真性能,而且相对于3D EZBC编码算法可以节省大量的存储空间。     

An improved partial SPIHT with classified weighted rate-distortion optimization for interferential multispectral image compression

Based on the property analysis of interferential multispectral images, a novel compression algorithm of partial set partitioning in hierarchical trees (SPIHT) with classified weighted rate-distortion optimization is presented.After wavelet decomposition, partial SPIHT is applied to each zero tree independently by adaptively selecting one of three coding modes according to the probability of the significant coefficients in each bitplane.Meanwhile the interferential multispectral image is partitioned into two kinds of regions in terms of luminous intensity, and the rate-distortion slopes of zero trees are then lifted with classified weights according to their distortion contribution to the constructed spectrum.Finally a global ratedistortion optimization truncation is performed.Compared with the conventional methods, the proposed algorithm not only improves the performance in spatial domain but also reduces the distortion in spectral domain.     

基于聚类和小波变换的多光谱图像压缩算法

针对多光谱图像压缩算法现存的时空复杂度高、光谱特性利用不充分等问题,研究了多光谱图像的谱间稀疏等价表示及其聚类实现途径,进而设计了一种基于谱间自适应聚类和小波变换的多光谱图像压缩算法。算法利用吸引力传播聚类产生多光谱图像的谱间稀疏等价表示、在低复杂度下去除图像的谱间冗余,使用二维小波变换去除稀疏表示成分的空间冗余,采用分层树集合分割排序算法(SPIHT)进行压缩编码,并通过误差补偿机制提高多光谱图像重建质量。实验表明,该算法在保证较低时间和空间复杂度的基础上,较SPIHT等同类经典压缩算法,在相同的压缩比下,明显提高了重建图像的峰值信噪比,是一种通用有效的多光谱图像压缩算法。     

基于K-means聚类和SPIHT编码的红外图像压缩算法研究

提出了基于K-means聚类和SPIHT编码的红外图像压缩算法。通过采用小波域系数的SPIHT编码压缩,克服了JPEG标准压缩算法在低比特率下严重的方块效应;通过K-means聚类算法,克服了嵌入式零树编码算法（EZW）没有充分考虑到图像小波系数同一子带中相邻元素之间相关性的缺陷。实验结果表明,此算法对红外图像具有很好的边缘和纹理保持性能。     

基于加权率失真优化SPIHT算法的干涉多光谱图像压缩

基于空间调制型成像光谱仪的成像特点,提出了一种适合于干涉多光谱图像的加权率失真优化多级树集合分裂(SPIHT)光谱压缩算法。该算法根据干涉多光谱图像在时域和频域的特点,推导出时域中随着光程差的增大,干涉图像对频域中光谱曲线的形状影响越大。因此,在光程差方向上,逐渐提升率失真函数的斜率,增大对图像的保护程度,不仅弥补了SPIHT算法在码率分配上的不足,而且有效地保护了频域中的光谱信息。实验结果表明,无论在时域还是频域,该算法与现有算法相比,性能有明显改进。     

基于独立分量分析的高光谱图像压缩

在对原始数据进行虚拟维数估计的基础上,提出了一种基于最大距离端元提取+独立分量分析(Independent Component Analysis,ICA)的高光谱图像有损压缩方案.该方案首先应用最大距离端元抽取法提取高光谱数据各端元矢量,然后用快速独立分量分析生成独立分量,最后使用2维分层树集合分裂(Set Partitioning In Hierarchical Trees,SPIHT)算法对各独立分量图进行编码.计算机仿真结果证明,该算法在取得高压缩率的同时,能很好地保持数据的谱特征,是一种高效的三维数据压缩方法.     

基于小波的干涉多光谱卫星图像压缩方法

分析了干涉多光谱卫星遥感图像的成像特性,并根据该类图像对压缩效果的要求提出了一种基于小波分层树集合分割排序（Set Partitioning Hierarchical Trees,SPIHT）的局部图像优先编码方法,通过对图像小波域系数的局部增强,获得了对图像重要数据优先编码的特性,在8倍压缩比的条件下获得了满意的效果。用该方法对多幅干涉多光谱图像进行了测试,测试结果表明：该方法性能优于其他多光 谱卫星遥感图像编码方法,并有利于在实时图像编码系统中得到应用。     

适合DSP处理的低内存并行SPIHT算法

针对SPIHT(set partitioning in hierarchical trees)算法的编码过程具有重复运算、存储量大等问题,提出了一种适合于DSP(digital signal processors)处理的低内存并行SPIHT算法。该算法采用乒乓缓存策略,使得数据的传输和编码能够同时进行。通过引入基于行的整型提升方案,使得只需经少量行变换就能进行列变换,提高了小波的变换速度。根据DSP的并行特性和SPIHT算法的缺点,采用“改进的最大幅值求取方法”、“误差位数以及绝对零值和绝对零集合”、“最大值与零值图”和“单棵零树编码”等多种方法对其进行了改进,大大缓解了对内存的压力,减少了算法的运算量。该算法与LZC(listless zerotree coding)算法相比,重构图像的峰值信噪比相当,但速度提高了2倍,能满足一般的实时压缩要求。     

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

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

基于SPIHT的图像加密与压缩关联算法

为了研究图像压缩与加密同步进行问题, 本文提出了一种在变换域下的图像加密与压缩关联算法在该算法中, 加密过程发生在小波变换与SPIHT编码之间它充分利用了离散小波变换和基于层次树的集合划分(set partitioning in hierarchical trees, SPIHT)编码属性, 扩散过程被限制在单个子带内部. 此外, 混淆过程保留了SPIHT编码中两个最重要的位和符号位, 它包含了图像的重要信息. 实验结果表明, 算法具有良好的安全性、图像重构视觉质量以及很高的加/解密速度.     

Image Encryption Scheme with Compressed Sensing Based on a New Six-Dimensional Non-Degenerate Discrete Hyperchaotic System and Plaintext-Related Scrambling

Digital images can be large in size and contain sensitive information that needs protection. Compression using compressed sensing performs well, but the measurement matrix directly affects the signal compression and reconstruction performance. The good cryptographic characteristics of chaotic systems mean that using one to construct the measurement matrix has obvious advantages. However, existing low-dimensional chaotic systems have low complexity and generate sequences with poor randomness. Hence, a new six-dimensional non-degenerate discrete hyperchaotic system with six positive Lyapunov exponents is proposed in this paper. Using this chaotic system to design the measurement matrix can improve the performance of image compression and reconstruction. Because image encryption using compressed sensing cannot resist known- and chosen-plaintext attacks, the chaotic system proposed in this paper is introduced into the compressed sensing encryption framework. A scrambling algorithm and two-way diffusion algorithm for the plaintext are used to encrypt the measured value matrix. The security of the encryption system is further improved by generating the SHA-256 value of the original image to calculate the initial conditions of the chaotic map. A simulation and performance analysis shows that the proposed image compression-encryption scheme has high compression and reconstruction performance and the ability to resist known- and chosen-plaintext attacks.     

A joint image encryption and watermarking algorithm based on compressive sensing and chaotic map

In this paper,a compressive sensing(CS) and chaotic map-based joint image encryption and watermarking algorithm is proposed.The transform domain coefficients of the original image are scrambled by Arnold map firstly.Then the watermark is adhered to the scrambled data.By compressive sensing,a set of watermarked measurements is obtained as the watermarked cipher image.In this algorithm,watermark embedding and data compression can be performed without knowing the original image;similarly,watermark extraction will not interfere with decryption.Due to the characteristics of CS,this algorithm features compressible cipher image size,flexible watermark capacity,and lossless watermark extraction from the compressed cipher image as well as robustness against packet loss.Simulation results and analyses show that the algorithm achieves good performance in the sense of security,watermark capacity,extraction accuracy,reconstruction,robustness,etc.     

Optical image compression based on adaptive directional prediction discrete wavelet transform

The traditional lifting wavelet transform cannot effectively reconstruct the nonhorizontal and nonvertical high-frequency information of an image. In this paper, we present a new image compression method based on adaptive directional prediction discrete wavelet transform (ADP-DWT). We first design a directional prediction model to obtain the optimal transform direction of the lifting wavelet. Then, we execute the directional lifting transform along the optimal transform direction. The edge and texture energy can be reduced in the nonhorizontal and nonvertical directions of the high-frequency sub-bands. Finally, the wavelet coefficients are coded with the set partitioning in hierarchical trees (SPIHT) algorithm. The new method holds the advantages of both adaptive directional lifting (ADL) and direction-adaptive discrete wavelet transform (DA-DWT), and the computational complexity is far lower than that in these methods. For the images containing regular and fine textures or edges, the coding preformance of ADP-DWT is better than that of ADL and DA-DWT.     

A low complexity block-based adaptive lossless image compression

For low power and lossless image compression, in this paper, a low complexity, block-based decomposition of subbands technology is proposed for embedded compression (EC) algorithm, which is ready for being implemented on a single-chip of FPGA. The proposed algorithm is based on high-speed pipeline architecture of 2-D lossless integer wavelet transformation (IWT) with 2-D Lossless Hadamard Transformation (LHT). In the proposed algorithm, the coefficients of a 2-D IWT are decomposed by 4 × 4 blocks to further remove redundancy, compared with direct encoder by EBCOT of JPEG2000. Considering the feature of the 2-D IWT, a different strategy is designed for LL-subband and non-LL subbands, which denotes DC prediction (DCP) and adaptive transformation method (ATM), respectively. DCP is used to remove the correlation between two adjacent blocks of LL-subband, and ATM is used to transform non-LL subbands by 2-D LHT selectivity. After further transformation, the coefficients are decomposed as truncated integer part (TIP) and truncated residue parts (TRP), considering the complexity of hardware implementation, TIP is encoded by Zero Running Length (ZRL) and Exp-Golomb (EG). TRP is encoded by a fixed length (FL) encoder after removed redundancy by the feature of 2-D LHT, when seen as bit patterns [1]. Experimental results show that the proposed EC algorithm can achieve a good compression performance as JPEG2000, and the coding latency can be decreased at an average of 43.9%. Another innovation of this paper is EC's hardware-friendly feature and easy hardware implementation, which are presented by a simple addition or subtraction of the LIWT and LHT, and need a small on-chip memory.     

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

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

基于多模光纤散斑的压缩感知在光学图像加密中的应用

为了安全高效地对图像信息进行传输,提出了一种新颖的基于多模光纤散斑的压缩感知结合双随机相位编码的光学图像加密方法.多模光纤产生的光斑作为压缩感知的测量矩阵,完成对图像的第一次压缩和加密,并且充当第一级密钥;再利用双随机相位编码技术进行第二次加密,实现对图像的完整加密过程,随机相位掩模板充当第二级密钥,解密过程与此相反.通过将光斑测量矩阵与用于压缩感知的常用随机测量矩阵进行对比研究后发现,使用光斑测量矩阵解密后的图像质量更好,而且相比于其他随机测量矩阵在硬件实现上的复杂性与高成本,光斑矩阵可以很容易地通过简单的光学器件来获得,且可以利用工作波长的改变来进行变换,也即第一级密钥非常容易变换.同时经研究表明,本文方法可以有效抵抗统计分析、噪声干扰和剪切等攻击,且对密钥敏感性高,具有良好的鲁棒性和安全性.因此,本文提出的这种基于光斑矩阵的压缩感知与双随机相位编码结合起来的加密方法,可以获得良好的加密效果与极大的密钥空间,并且易于在光学领域整合.     

基于非冗余轮廓波的图像质量可伸缩编码算法

提出一种用非冗余轮廓波的中低比特率图像质量可伸缩编码算法。该算法采用双正交小波分解和方向滤波器组(DFB)实现图像的非冗余稀疏表示, 不但具有轮廓波对图像中线状奇异性边缘和纹理细节的稀疏表示特点, 而且克服了轮廓波变换系数4/3冗余的缺点。算法中对图像非冗余轮廓波系数各子带系数分布进行统计分析, 通过对变换系数的重新组合, 构造了有利于图像编码的空间方向树结构, 并统计验证了其零树特性, 采用分级树集合分裂和阈值量化达到图像质量可伸缩的嵌入式编码。实验结果表明,其解码算法在中低比特率压缩情况下, 压缩后重构图像的感知质量明显优于小波域SPIHT,JPEG2000编码标准, 峰值信噪比PSNR值与JPEG2000相当, 而图像纹理和边缘细节的视觉效果优于JPEG2000和小波域SPIHT算法。