一种八谱段滤光片成像系统设计

针对多光谱滤光片阵列成像采样率低,原始(Raw)数据稀疏所导致的重建图像模糊,高频信息丢失等问题,提出了一种新八谱段滤光片阵列分布方案,利用基于邻域梯度延伸方法对光谱Raw图像进行重建.首先基于二叉树生成法,在重复排列的4×4阵列中设计了一种等空间概率比的八谱段滤光片分布方案;然后针对传感器直接获取的稀疏Raw图像,计算各谱段采样点的梯度信息,在保持图像结构特征和纹理信息的基础上,利用邻域采样点的像素值和梯度值对未采样点进行重建,从而获得完整的光谱图像信息;最后,基于已重建的八谱段光谱图像,采用伪逆矩阵法重构各像素位置的31波段光谱值.结果表明,相对于主流图像重建方法,本文算法提高了重建八谱段光谱图像的峰值信噪比、复合峰值信噪比,降低了光谱均方差,更好地保留了图像的纹理和边缘,有效降低了多光谱滤光片阵列成像中的颜色伪影和图像模糊等现象.     

基于谱间和帧内差分脉冲编码调制的超光谱图像无损压缩

以超光谱遥感图像为研究对象,分析了干涉成像光谱仪获取图像的谱间和空间相关性,提出一种三维差分脉冲编码调制（ DPCM）无损压缩方案。首先进行了谱间DPCM预测;然后,对残差图像进行帧内DPCM预测;最后,对差分码流进行二值自适应算术编码。实验表明,该算法可实现无损压缩,压缩比平均可达1.662,较二维整数小波变换算法提高了15.6％,且算法复杂度较低,仅有加减和移位运算,易于硬件实现。     

一种结合JPEG压缩编码的彩色图像加密算法

为了研究针对联合图像专家小组压缩标准（joint photographic experts group,JPEG）彩色图像特点的加密算法,综合选择加密和在编码过程中加密两种思路,提出了一种空域和频域结合的加密算法. 首先在空域对8×8分块进行扩散置乱,然后利用边缘检测手段找出包含细节信息较多的重要分块,先加密所有分块中的直流（direct current,DC）系数,再选择重要分块中的一部分交流（alternating current,AC）系数进行加密,最后将分块重要性标记信息嵌入AC系数中进行传输. 通过理论分析和大量实验证明,算法格式兼容,密文图像视觉效果好、色彩分布均匀;算法密钥空间大,密钥敏感性强,安全性良好. 关键词： JPEG彩色图像 边缘检测 选择加密 结合编码加密     

基于Wedgelet的分层图像压缩

提出了一种分层图像压缩框架:图像=边缘轮廓+纹理。对原图像进行了一种自适应的多尺度Wedgelet分析,抽取并编码了图像的边缘轮廓。基于Wedgelet分析了在残差图像中引入的伪迹所具有的局部振荡特性,采用自适应局部余弦变换分析了以纹理为主要内容的残差图像,在将变换系数重组成与小波系数类似的树形结构后,采用零树编码获得了嵌入式码流。实验结果表明,该算法的重建图像质量优于SPIHT算法,在较好地保留原图像边缘轮廓和有效地减少边缘附近振铃伪迹的同时,较清晰的保留了原图像的纹理特征。     

环境卫星多光谱图像压缩算法

基于环境卫星多光谱图像特点的分析,提出了一种新的基于三维等级树集合划分算法(3D-SPI HT)和感兴趣区域(ROI)编码相结合的多光谱图像压缩算法。首先在谱间采用两种小波基相结合的三维离散小波变换(3D-DWT),去除多光谱图像在空间和谱间的冗余信息,减少恢复光谱的误差值,然后采用部分三维等级树集合划分算法和小波系数提升的感兴趣区域编码相结合的方法。该方法对小波系数从空间方向树上按对恢复光谱信息的重要性不同进行合理的码率分配,使得恢复光谱具有更好的分辨率,并依据比特平面层中重要系数的统计概率来自适应地进行3种编码模式的选择,提高了编码效率。实验数据结果表明,该算法比传统算法更好地保护了多光谱图像中的光谱信息,在压缩比为8∶1的情况下,满足了环境卫星多光谱图像压缩系统的要求。     

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

针对多光谱图像存储和传输安全性问题,提出一种将混沌思想、小波变换和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以上。可见,该算法可行,且特别适合对压缩比要求较高的场合,并在频谱保真方面具有较好的效果。     

基于谱间DPCM和整数小波变换的超光谱图像无损压缩

分析了干涉成像光谱仪所获取图像的谱间和空间相关性,提出了一种混合无损压缩方案.首先进行谱间DPCM预测,再对残差图像采用整数小波变换,最后对小波系数进行二值自适应算术编码.实验结果表明,该算法可实现无损压缩,压缩比平均可达2.018,较二维整数小波变换算法提高40.3%.并且算法复杂度较低,只有加减和移位运算,易于硬件实现.     

光子计数集成成像的压缩与重构

集成成像技术作为一种重要的裸眼三维显示技术,在完整记录三维场景信息的同时,庞大的数据量给传输和存储带来了压力。为了实现图像的有效压缩和重构,根据光子计数集成成像的特点,基于分布式压缩感知理论,提出用于图像压缩与重构的方案。该方案将图像分为参考图像和非参考图像两类,对其设置不同的测量率并分别进行重构。为保证非参考图像的重构质量,提出一种联合重构算法。该算法首先对非参考图像进行分块测量,依据与参考图像之间的相关性进行图像块分类,然后结合参考图像测量值信息构建新的测量矢量,利用新的测量矢量完成初次图像重构。为了进一步提升图像重构质量,对初次重构结果进行二次残差补偿重构,获得最终重构结果。最后通过设置不同的测量率进行了大量实验,实验结果表明,所提算法在测量率为0.25时,图像重构质量可以达到30 dB,测量率为0.4时,图像质量可以达到35 dB,算法性能具有一定的优越性。     

基于提升方案的多光谱遥感图像有损压缩算法

在分析多光谱遥感图像谱间和空间数据特点的基础上,提出了一种DPCM线性预测与基于提升方案的整数小波变换相结合的多光谱遥感图像有损压缩算法。在谱间采用DPCM预测去除谱间相关性;在谱内采用整数小波变换去除空间相关性,根据不同子带对目标识别的重要程度,选择不同的量化阈值和量化步长进行量化,并分别对各个子带量化后的数据和重要图表采用固定比特平面编码和游程编码,实现高效的多光谱遥感图像压缩。实验结果表明,该算法在一定的压缩比下,重构图像具有较高的峰值信噪比,并且算法硬件实现简单,对内存的需求低。     

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.     

Curvelet based image compression via core vector machine

In this paper, a novel curvelet based digital image compression scheme is proposed. Aiming at achieving high compression ratio, the proposed scheme embeds a representative machine learning method, core vector machine (CVM), in the encoding process of the image compression technique. The core vector machine (CVM) has been introduced as an extremely fast classifier which is demonstrably superior to standard support vector machine (SVM) on very large datasets. In this scheme, we appropriately utilize the characteristic of CVM to reduce huge numbers of curvelet coefficients. Compared with image compression algorithms do not use CVM and methods based on wavelet transform, experimental results show that the compression performance of our method gains much improvement in peak-signal-to-noise-ratio (PSNR) and CPU time. Moreover, the algorithm works fairly well for declining block effect at higher compression ratios.     

基于Gabor小波变换的ICA火灾图像纹理识别算法

针对火灾图像纹理识别问题,提出了基于Gabor小波变换的ICA火灾图像纹理识别算法,并根据火灾图像纹理识别特点进行了优化。首先用不同尺度和方向的Gabor滤波器对待识别图像滤波,得到其特征图像,然后将特征图像转化成特征向量作为ICA的输入,得到基矢量子空间,再将测试图像经过Gabor滤波器的特征向量投影到ICA子空间中得到系数向量作为目标识别特征,最后用支持向量机进行识别。通过与Gabor滤波器法和ICA方法的对比实验,表明该算法可以在火灾纹理图像的识别率上比传统方法提高5%以上,为火灾图像识别提供了一种新思路。     

一种适于空间多光谱TDICCD图像压缩算法

针对传统遥感图像压缩算法中小波变换和位平面编码没有考虑图像内容特点而导致多光谱各谱段图像边缘和纹理的模糊的问题,提出一种适于成像谱段数相对较少多光谱TDICCD图像压缩算法。提出的自适应提升DWT可以自适应的选择最佳的提升方向,同时根据图像局部特征使用拉格朗日插值策略进行预测,这种方法可以充分的利用图像的纹理信息。提出的码率控制算法可以根据图像纹理复杂程度进行自适应的码率分配。实验结果表明,提出的压缩算法具有良好压缩性能,对于平滑的图像与传统算法相当,对于边缘和纹理程度复杂的图像,性能高于传统算法,在正常工作压缩比为8∶1时,平均信噪比比传统方法平均提高了3.53 dB。有效的保护了多光谱图像的边缘和纹理信息,非常适于纹理复杂的空间多光谱CCD图像压缩应用。     

A color image watermarking scheme based on hybrid classification method: Particle swarm optimization and k-nearest neighbor algorithm

In this paper, a novel robust watermarking technique using particle swarm optimization and k-nearest neighbor algorithm is introduced to protect the intellectual property rights of color images in the spatial domain. In the embedding process, the color image is separated into non-overlapping blocks and each bit of the binary watermark is embedded into the individual blocks. Then, in order to extract the embedded watermark, features are obtained from watermark embedded blocks using the symmetric cross-shape kernel. These features are used to generate two centroids belonging to each binary (1 and 0) value of the watermark implementing particle swarm optimization. Subsequently, the embedded watermark is extracted by evaluating these centroids utilizing k-nearest neighbor algorithm. According to the test results, embedded watermark is extracted successfully even if the watermarked image is exposed to various image processing attacks.     

Image Statistics Preserving Encrypt-then-Compress Scheme Dedicated for JPEG Compression Standard

In this paper, the authors analyze in more details an image encryption scheme, proposed by the authors in their earlier work, which preserves input image statistics and can be used in connection with the JPEG compression standard. The image encryption process takes advantage of fast linear transforms parametrized with private keys and is carried out prior to the compression stage in a way that does not alter those statistical characteristics of the input image that are crucial from the point of view of the subsequent compression. This feature makes the encryption process transparent to the compression stage and enables the JPEG algorithm to maintain its full compression capabilities even though it operates on the encrypted image data. The main advantage of the considered approach is the fact that the JPEG algorithm can be used without any modifications as a part of the encrypt-then-compress image processing framework. The paper includes a detailed mathematical model of the examined scheme allowing for theoretical analysis of the impact of the image encryption step on the effectiveness of the compression process. The combinatorial and statistical analysis of the encryption process is also included and it allows to evaluate its cryptographic strength. In addition, the paper considers several practical use-case scenarios with different characteristics of the compression and encryption stages. The final part of the paper contains the additional results of the experimental studies regarding general effectiveness of the presented scheme. The results show that for a wide range of compression ratios the considered scheme performs comparably to the JPEG algorithm alone, that is, without the encryption stage, in terms of the quality measures of reconstructed images. Moreover, the results of statistical analysis as well as those obtained with generally approved quality measures of image cryptographic systems, prove high strength and efficiency of the scheme’s encryption stage.     

基于分形的小波分析压缩编码

分析了小波及分形在图形压缩编码中的特点 ,构造了Haar小波树 ,提出基于分形的小波域图像压缩编码的算法。实验证明 :该方法在相近的压缩比的情况下 ,使重建图像的PSNR增加 4 1,图像压缩速度明显提高 ,并且重建图像的主观视觉质量也优于JPEG。     

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

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

凸面光栅成像光谱仪图像数据实时压缩技术

凸面光栅成像光谱仪图像数据量巨大,给数据的传输和存储带来了压力,因此要对图像数据进行实时压缩。首先根据成像原理对图像数据的特点进行了分析,得出去除空间相关性和谱间相关性的压缩途径;然后,进行了压缩算法分析,提出了在谱间进行一阶线性预测、谱内进行JPEG2000压缩的三维压缩方案;最后,设计了基于FPGA+ADV212的实时压缩系统,其中FPGA用于逻辑控制和预测算法实现,ADV212用于JPEG2000压缩。分析结果表明:该系统具备无损和有损压缩能力,能够实现图像数据实时压缩。     

A Gabor subband decomposition ICA and MRF hybrid algorithm for infrared image reconstruction from subpixel shifted sequences

An image blind reconstruction, as a blind source separation problem, has been solved recently by independent component analysis (ICA). Based on ICA theory, in this paper, a high resolution image is reconstructed from low resolution and subpixel shifted sequences captured by infrared microscan imaging system. The algorithm has the attractive feature that neither the prior knowledge of the blur kernel nor the value of subpixel misregistrations between the input channels is required. The statistical independence in the image domain is improved by the multiscale Gabor subband decompositions, which are designed for the best ability to cover the whole spatial frequency and to avoid overlapping between the subbands. The mutual information is employed to locate a subband with the least dependent components. In terms of MAP estimator, we combine the super-Gaussian with Markov random field to form a hybrid image distribution. This strategy helps to estimate the separating matrix reasonable to extract the sources with the image properties, that is, sharp enough as well as correlative in local area. The proposed algorithm is capable of performing high resolution image sources which are not strictly independent, and its viability is proved by the computer simulations and real experiments.     

An adaptive OPD and dislocation prediction used characteristic of interference pattern for interference hyperspectral image compression

According to the imaging principle and characteristic of LASIS (Large Aperture Static Interference Imaging Spectrometer), we discovered that the 3D (three dimensional) image sequences formed by different interference pattern frames, which were formed in the imaging process of LASIS Interference hyperspectral image, had much stronger correlation than the original interference hyperspectral image sequences, either in 2D (two dimensional) spatial domain or in the spectral domain. We put this characteristic into image compression and proposed an adaptive OPD (optical path difference) and dislocation prediction algorithm for interference hyperspectral image compression. Compared the new algorithm proposed in this paper with Dual-Direction Prediction [1] proposed in 2009, lots of experimental results showed that the prediction error entropy of the new algorithm was much smaller. In the prediction step of lifting wavelet transform, this characteristic would also reduce the entropy of coefficients in high frequency significantly, which would be more advantageous for quantification coding [2].