基于自适应预测的高光谱遥感图像无损压缩算法

针对高光谱遥感图像细节丰富纹理复杂、空间相关性弱、难于压缩的特点,充分利用高光谱遥感图像的谱间相关性,使用多个波段的像素来自适应预测当前波段的像素。因为待预测像素的最优预测是其条件期望,用分段积分的方法将条件期望转化为可计算的表达式,并与其它波段的像素关联起来。选取与待预测像素有较强因果关系的相邻像素自适应地估计出各参数的值,得到残差图像,消除了大部分的谱间冗余和空间冗余,再用JPEG-LS进一步去除残差图像的空间相关性。实验表明,该算法能有效去除高光谱图像间的相关性,较其它压缩算法压缩比有很大提高,且算法简单,便于硬件实现。      

基于波段分组的3D-SPIHT高光谱图像

波段间隔为纳米级的高光谱图像具有很强的谱间相关性,但不同频谱波段图像之间的相关性不同,本文提出了一种基于波段分组的3D-SPIHT(set partitioning in hierarchical trees)高光谱图像无损压缩方法.对高光谱图像按照谱段类型进行分组,接着通过3维整型小波变换,对图像组去除空间相关性和光谱维相关性,最后以3DSPIHT的空间方向树组织方式来进行编码,去除小波变换后子带间系数的冗余.实验结果表明,该方法能够有效地去除空间和谱间相关性,在算法复杂度和计算时间上较整体处理有一定优势,同时可获得较好的无损压缩结果.     

基于三维整数小波与自适应预测的高光谱图像压缩研究

高光谱图像作为一种三维图像,其海量数据给存储和传输带来极大困难,必须对其进行有效压缩。根据高光谱图像的特点,本文提出了一种基于三维整数小波与自适应预测的无损压缩算法。首先利用三维整数小波变换充分消除高光谱图像的谱间冗余和空间冗余,自适应预测编码可以进一步消除变换后低频子带之间的冗余,从而进一步提高压缩性能;最后利用JPEG-LS标准和SPIHT算法分别对数据进行无损压缩。通过改变小波基,也可实现有损压缩。实验结果表明,该算法可以取得较好的无损和有损压缩效果。     

基于波段分组的3D-SPIHT高光谱图像无损压缩算法

波段间隔为纳米级的高光谱图像具有很强的谱间相关性，但不同频谱波段图像之间的相关性不同，本文提出了一种基于波段分组的3D—SPIHT(set partitioning in hierarchical trees)高光谱图像无损压缩方法。对高光谱图像按照谱段类型进行分组，接着通过3维整型小波变换，对图像组去除空间相关性和光谱维相关性，最后以3D—SPIHT的空间方向树组织方式来进行编码，去除小波变换后子带间系数的冗余。实验结果表明，该方法能够有效地去除空间和谱间相关性，在算法复杂度和计算时间上较整体处理有一定优势，同时可获得较好的无损压缩结果。     

基于整数小波变换的机载多光谱图像无损压缩

首先探讨了基于提升方案的整数小波变换,结合线性预测技术,提出了一种机载多光谱遥感图像的无损压缩方法。该方法通过整数小波变换减少图像的空间冗余,然后根据多光谱图像谱间的相关性对整数小波变换后的结果进行预测,并且加进了相关性判断这一环节保证了预测的有效性。算法适合并行处理和硬件实现。对机载64波段多光谱遥感图像的试验结果表明,该方法与改进的预测树方法相比其无损压缩比平均提高了16%,压缩时间缩短了三分之二。     

基于最佳线性预测器的高光谱图像无损压缩算法

针对高光谱遥感图像细节丰富纹理复杂，空间相关性弱，难于压缩的特点，本文充分利用了高光谱遥感图像的谱间相关性，设计出对相邻谱段进行预测并将预测残差均方降为最小的一种最佳线性预测器。最后利用整数小波变换，并结合SPIHT算法，有效的去除空间相关性。实验表明该算法可以收到良好的效果，优于3D—SPIHT算法和WINRAR压缩软件。     

一种新的遥感图像无损压缩算法

根据高光谱遥感图像具有空间和谱间相关性的特点,提出了基于三维整型DCT变换的无损压缩方法.首先将空间维和谱间维组合起来形成三维数据,采用三维整型DCT变换消除高光谱图像空间和谱间的相关性;然后,对变换系数进行类似小波的树状系数重组,并按子带顺序进行一阶自适应算术编码.实验结果表明,与已有的无损压缩算法相比,该方法的压缩效率有较大提高.     

基于降低映射预测残差的高光谱图像压缩算法

CCSDS 123.0-B-1算法是空间数据系统咨询委员会为多/高光谱图像提出的自适应三维预测无损压缩标准,针对CCSDS 123.0-B-1算法中存在的未充分利用像素位置信息及谱间相关性、压缩率有待提高的问题,对该算法的预测器进行了优化,提出了RMPR算法。RMPR算法根据当前像元具体位置对预测点进行自适应选择,采用双向线性预测去除高光谱图像的谱间相关性,并使用优化的残差映射器提高预测精度、缩短压缩码长。利用10幅高光谱图像进行测试,结果表明,在保证无损压缩且压缩效率无显著差异的前提下,RMPR算法的压缩性能显著优于原算法。     

基于重组的DPCM和位平面编码的高光谱图像压缩方案

高光谱图像压缩技术是遥感数据存储和传输中的一个迫切需要解决的问题。高光谱图像的特点是存在着两类冗余：空间冗余和谱间冗余。高光谱图像的压缩要同时利用图像的空间冗余和谱间冗余。基于重组的DPCM和位平面编码的压缩方法，是通过重组的DPCM，去除帧间相关性，消除超光谱图像帧间的冗余；然后对残差图像的压缩采用基于小波变换和位平面编码技术，去除空间冗余。实验取得了令人满意的效果，证明了该算法的有效性和实用性。     

一种基于神经网络模型的遥感图像的快速无损压缩方法

感知器是一种分层的神经网络模型,具有自适应自学习的能力.本文提出一种基于感知器模型的自适应预测的遥感图像无损压缩方法,编码时,先对当前像素进行自适应预测,然后采用快速有效的Rice编码器对误差图像编码.以TM遥感数据为实验对象,实验结果表明,该方法能够有效地去除遥感图像的空间及谱间相关性,压缩效率明显优于基于算术编码的JPEG最优无失真模式;与LOCO-I算法相比,三维预测的平均压缩比和编解码速度也有较大的提高.     

波段排序的高光谱影像3维混合树编码方法

目的 高光谱影像压缩的关键技术是对空间维和光谱维的去相关性。根据高光谱影像数据结构的特点,如何有效去除其空间相关性与谱间相关性是高光谱影像压缩中至关重要的问题。对高光谱影像进行编码时,3维小波变换是极为有效的去除冗余的方法。因此提出了一种通过波段排序并结合3维混合树型结构对高光谱影像3维小波变换系数进行编码的算法。方法 首先,将高光谱影像按照自然波段顺序进行波段分组,并对每组影像进行相邻影像的谱间相关性统计;其次,对相关性较弱的波段组,建立以影像波段序号为顶点、影像相关性系数为边的完全图,对这个完全图求其最大汉密尔顿回路。按照求得的最大汉密尔顿回路顺序对该波段组进行重新排序,从而提高波段组的谱间相关性;在此基础上,对重新排序后的波段组进行3维小波变换,并通过3维混合树结构对3维小波变换系数进行零树编码。结果 通过对大量AVIRIS型高光谱影像数据的仿真实验,验证了本文方法的有效性。对相关性较低的波段组,加入排序算法后,其解码影像与未排序时比,峰值信噪比有了一定的提高。通过实验统计,算法平均用时2.7579s。结论 由于采用了对弱相关性波段组的重新排序机制,使得基于混合树结构的3维零树编码出现了更多有效的零树,在一定程度上提高了编码效率。通过实验统计算法用时,表明该方法以较小的时间代价获得了解码效果的提升。     

一种多尺度高光谱影像小波分形维特征计算方法

提出了一种基于高光谱曲线小波分形测度的高光谱影像多尺度分形维特征分析方法。对高光谱影像的光谱响应曲线的小波域高频和低频系数统计特性、分形特征进行了分析,提出以小波低频分形维表征原始光谱曲线分形特征,以小波系数高频分形维表征高光谱细节特征方法,设计了基于高光谱曲线小波分形维的多尺度特征计算算法,实验结果表明,小波分形维值可有效表征丰富的光谱特征,可用于高光谱影像特征提取和分类。     

基于小波变换的高光谱图像消噪

本文主要针对高光谱图像的特点，利用波段间的几何信息高冗余性，通过小波分解去除高频的噪声和几何信息，保留低频的光谱信息。以其他波段的几何信息辅助噪声污染波段重构，经过相应的小波重构滤波器滤波，获得该波段图像的重建以进行消噪。     

超光谱图像的三维小波嵌入零块压缩编码

超光谱图像作为一种三维图像,其海量的数据导致在有限带宽信道上传输和存储非常困难,必须对它进行有效的压缩编码.提出了一种基于非对称三维小波变换(3D wavelet transform,简称3DWT)和三维集合块分裂的超光谱遥感图像压缩方法.因为大多数超光谱图像在各个方向上具有非对称的统计特性,所以利用非对称三维小波变换去除图像的谱间和空间冗余.与传统的对称三维小波变换相比,非对称的三维小波变换能够更有效地去除相邻谱段间的冗余.提出了一种改进的3DSPECK(3D set partitioning embedded block)算法--非对称三维集合分裂块算法(asymmetric transform 3DSPECK,简称AT-3DSPECK),并被用于编码变换后的系数.根据变换系数的能量分布特点,三维零块分裂和三维octave子带分裂方法被有效地结合在所提出的AT-3DSPECK算法中.为了优化率失真和加速编码速度,也给出了一种零块优化排序的快速算法.实验测试表明:AT-3DSPECK算法的平均PSNR(peak signal to noise ratio)分别比AT-3DSPIHT(asymmetric transform 3D set partitioning in hierarchical trees)和3DSPECK算法高0.4dB和1.4dB.此外,AT-3DSPECK还具有比零树算法更快的编码速度.     

基于光谱曲线小波系数分维测度的高光谱影像高效分割方法

针对高光谱遥感影像处理效率的问题,提出了一种基于高光谱曲线小波分解低频系数分维特征影像和高频系数分维特征影像相结合的高光谱遥感影像分割方法。对高光谱响应曲线的分形测度进行了分析,提出基于光谱曲线小波分解高频系数的分维算法,得到多尺度高光谱分形特征影像。设计了低频系数分维特征影像和高频系数分维特征影像相结合的高光谱影像分割算法。高光谱曲线小波系数分维特征影像分割实验结果表明:该算法可取得与光谱曲线直接分形测度特征影像分割一致结果,但效率优于直接分维特征影像分割。     

Using low‐spectral‐resolution images to acquire simulated hyperspectral images

We propose a method to acquire simulated hyperspectral images using low‐spectral‐resolution images. Hyperspectral images provide more spectral information than low‐spectral‐resolution images, because of the additional spectral bands used for data acquisition in hyperspectral imaging. Unfortunately, original hyperspectral images are more expensive and more difficult to acquire. However, some research questions require an abundance of spectral information for ground monitoring, which original hyperspectral images can easily provide. Hence, we need to propose a method to acquire simulated hyperspectral images, when original hyperspectral images are especially necessary. Since low‐spectral‐resolution images are readily available and cheaper, we develop a method to acquire simulated hyperspectral images using low‐spectral‐resolution images. With simulated hyperspectral images, we can acquire more ‘hidden’ information from low‐spectral‐resolution images. Our method uses the principles of pixel‐mixing to understand the compositional relationship of spectrum data to an image pixel, and to simulate radiation transmission processes. To this end, we use previously obtained data (i.e. spectrum library) and the sorting data of objects that are derived from a low‐spectral‐resolution image. Using the simulation of radiation transmission processes and these different data, we acquire simulated hyperspectral images. In addition, previous analyses of simulated remotely sensed images do not use quantitative statistical measures, but use qualitative methods, describing simulated images by sight. Here, we quantitatively assess our simulation by comparing the correlation coefficients of simulated images and real images. Finally, we use simulated hyperspectral images, real Hyperion images, and their corresponding ALI images to generate several classification images. The classification results demonstrate that simulated hyperspectral data contain additional information not available in the multispectral data. We find that our method can acquire simulated hyperspectral images quickly.     

Denoising and dimensionality reduction of hyperspectral imagery using wavelet packets,neighbour shrinking and principal component analysis

After dimensionality reduction of a hyperspectral datacube using principal component analysis (PCA), the dimension-reduced channels often contain a significant amount of noise. To overcome this problem, this letter proposes a method that can fulfil both denoising and dimensionality reduction of hyperspectral data using wavelet packets, neighbour wavelet shrinking and PCA. A 2D forward wavelet packet transform is performed in the spatial domain on each of the band images of a hyperspectral datacube, the wavelet packet coefficients are then shrunk by employing a neighbourhood wavelet thresholding scheme, and an inverse 2D wavelet packet transform is performed on the thresholded coefficients to create the denoised datacube. PCA is applied on the denoised datacube in the spectral domain to obtain the dimension-reduced datacube. Experiments conducted in this letter confirm the feasibility of the proposed method for denoising and dimensionality reduction of hyperspectral data.     

PoNet: A universal physical optimization-based spectral super-resolution network for arbitrary multispectral images

Spectral super-resolution is a very important technique to obtain hyperspectral images from only multispectral images, which can effectively solve the high acquisition cost and low spatial resolution of hyperspectral images. However, in practice, multispectral channels or images captured by the same sensor are often with different spatial resolutions, which brings a severe challenge to spectral super-resolution. This paper proposed a universal spectral super-resolution network based on physical optimization unfolding for arbitrary multispectral images, including single-resolution and cross-scale multispectral images. Furthermore, two new strategies are proposed to make full use of the spectral information, namely, cross-dimensional channel attention and cross-depth feature fusion. Experimental results on five data sets show superiority and stability of PoNet addressing any spectral super-resolution situations.     

Investigation into lossless hyperspectral image compression for satellite remote sensing

Hyperspectral sensors acquire images in many, very narrow, contiguous spectral bands throughout the visible, near-infrared (IR), mid-IR and thermal IR portions of the spectrum, thus requiring large data storage on board the satellite and high bandwidth of the downlink transmission channel to ground stations. Image compression techniques are required to compensate for the limitations in terms of on-board storage and communication link bandwidth. In most remote-sensing applications, preservation of the original information is important and urges studies on lossless compression techniques for on-board implementation. This article first reviews hyperspectral spaceborne missions and compression techniques for hyperspectral images used on board satellites. The rest of the article investigates the suitability of the integer Karhunen–Loève transform (KLT) for lossless inter-band compression in spaceborne hyperspectral imaging payloads. Clustering and tiling strategies are employed to reduce the computational complexity of the algorithm. The integer KLT performance is evaluated through a comprehensive numerical experimentation using four airborne and four spaceborne hyperspectral datasets. In addition, an implementation of the integer KLT algorithm is ported to an embedded platform including a digital signal processor (DSP). The DSP performance results are reported and compared with the desktop implementation. The effects of clustering and tiling techniques on the compression ratio and latency are assessed for both desktop and the DSP implementation.