基于块方向预测和Context的图象天先真编码方法

首先分析无失真图象编码技术，提出一种基于块方向预测和Ｃｏｎｔｅｘｔ的自适应无失真编码方法，该方法主要使用块方向预测和基于Ｃｏｎｔｅｘｔ的误差模型去除图象在空间上的相关性。在此方法中，一幅图象首先被分割成图象块，对图象的每一块自适应地选择一个使预测误差绝对值之和最小的块方向预测器，然后通过Ｃｏｎｔｅｘｔ选择和误差反馈进一步降低信号熵；最后，采用快速而有效的Ｒｉｃｅ编码器对误差图象编码。实验结果显示，     

基于块方向信息的指纹图像无损压缩编码

根据指纹图像在局部具有很强的方向性，提出了一种基于块方向预测的无损压缩编码方法。在此方法中，首先将指纹图像分成8×8的图像块，计算出每一块的块方向信息，并根据这个方向信息，对各个块自适应地选择一个预测器；然后通过预测误差的Context模型进一步去除相邻像素之间的相关性；最后采用Rice算法对误差图像进行编码。实验表明，这种方法简单实用，压缩效果好于JPEG无失真模式和JPEG-LS。     

基于提升小波和Context模型的图象无失真编码方案

文章讨论了提升小波变换的基本原理。并根据提升小波系数的特点,结合基于Context模型的熵编码,提出了一种新的无失真图象编码方案。该方案中,将提升小波系数的编码分为三部分考虑,即反映非零系数位置的SignificanceMap、反映非零系数幅值大小的MostSignificanceBits(MSB)符号流和去除了MSB的剩余二进制符号流。因为Signifi-canceMap和MSB符号流中存在较强相关性,提出了简单有效的Context模型对它们进行熵编码。而对去除了MSB的剩余二进制符号流,由于其相关性较弱,直接使用自适应算术编码。经过实验对比证明了该方案在无失真图象编码中的有效性。     

高质量图象压缩的自适应DPCM/DCT混合编码方法

DCT是数据压缩的主要技术之一 ,它能将图象的主要能量集中在很少的几个 DCT系数上 .可是 ,DCT对于含有较多边缘的图象块并不十分有效 ,因为 DCT变换作用于这样的图象块后不能导致有效的能量集中 .文中提出了一种自适应 DPCM/ DCT混和编码方法用于解决这一问题 .对于每一个图象块 ,边缘检测器自动判断该块是否含有较强的边缘 ,如果含有较强的边缘 ,则使用DPCM编码器 ;如果不含有较强的边缘 ,则使用 DCT编码器 .DPCM编码器自动从给定的预测器中选定一个产生最小预测误差的预测器 ,然后用 Rice编码器对误差图象编码 .对于非边缘块 ,使用DCT、游程和变长编码技术 .实验结果显示文中所提出的方法在压缩比和解码时间方面优于 JPEG无失真模式和标准 JPEG模式 (当 bpp=1— 4时 )     

基于分块自适应预测的超声测井图象无损压缩编码

针对超声测井图象数据量较大,且要求实时传输的问题,提出了一种基于分块自适应预测的无损压缩编码方法,该方法首先对原图象分块;然后在每一子块内自适应选择预测方案,并进行DPCM编码;最后采用改进的LZW算法对差值进行编码输出。经过实验表明,该算法比较符号超声测井图象特点,其压缩倍数较现有无损压缩算法有很大提高,而算法复杂度没有明显增加,同时所需内存开销较小,因而特别适用于实时遥测系统。     

H.264帧内4×4块预测模式选择快速算法研究

在H.264视频编码过程中,编码时间受诸多因素的影响,如帧间/帧内模式选择、运动估计(ME)、率失真优化(RDO)等。为了以较快速度和较好质量进行编码,针对H.264帧内模式选择,提出了一种适用于H.264帧内4×4块预测的模式选择快速算法。该算法利用帧内4×4块最优预测模式与和它相邻的预测模式之间率失真代价(RD Cost)的高相关性,以及绝对变换误差和(SATD)与率失真(RD)性能之间的强相关性,有效地跳过一些不太可能的预测模式,从而使帧内4×4块模式选择过程只需进行4次率失真代价计算即可。实验结果显示,该算法在编码性能和编码速度之间取得了很好的折衷。     

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

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

基于单队列递归扫描的嵌入式零树图象编码方法

为了提高基于互联网的图象编码的压缩比和多带宽适应性，提出了一种新的嵌入式零树图象编码方法，该方法首先在连续累进量化方法中使用单队列算法，从而不仅无需使用动态队列，而且率失真特性也得到改善；其次设计了一种基于空间树递归扫描的零树编码快速算法，因而完全解决了重复扫描问题；最后基于编码符号的频带内邻域相关性，为自适应算术编码定义一种新的Markov模型，实验结果表明，该算法在保持高粒度多码率特性的同时，压缩效率较EZW算法有明显提高。     

一种线性视频编码码率控制方法

利用ρ域的线性码率模型,提出了一种高效的线性视频编码码率控制方法.该方法包括改进的帧级比特分配和宏块级码率控制两部分,并首先介绍了ρ域的线性码率模型;然后在图象层根据线性码率模型对帧的编码复杂度进行预测,并根据复杂度进行准确的帧级比特分配;在宏块级,则根据宏块特性,提出自适应的ρ域量化级选取算法,以用其准确控制比特数;最后提出完整的线性码率控制算法.实验证明,用该方法码率控制得非常准确,并可以将码率误差控制在2%以内,而且图象质量比TM5有了明显提高,在相同的目标码率下,其恢复图象的PSNR平均提高0.8～1.7dB.     

一种基于小波变换与自适应混合量化的新图象压缩算法

本文提出了基于小波变换与自适应混合量化的图象压缩算法，该算法首先将小波变换后的图象高频子带划分为扫描块，然后依据图象的纹理复杂度和重要性程度将这些扫描块划分为4类（平坦，过渡，弱纹理和强纹理）；最后对各类扫描块分别进行向量和标量量化混合编码，实验结果表明，试图象压缩算法在压缩速度，图象复原质量等方面均优于FVQ编码算法和JPEG方法。     

Low-complexity two-step lossless depth coding using coarse Lossy coding

Texture and depth images are generally used for 3D viewing with advanced displays. Because sthe characteristics of a depth image are very different from those of a texture image, an efficient compression method is required to transmit a depth image in a limited bandwidth. In this paper, a low-complexity two-step lossless depth coding (LTLDC) method using coarse lossy coding is proposed. The proposed method downsamples an original image and then coarsely compresses the downsampled image in the first step. This compressed image is upsampled, and then its residual is generated by subtracting the upsampled image from the original image. In the second step, each coding block within the residual and original images is adaptively compressed with a fast mode decision method in a lossless way, and the proposed method determines the best block based on their coding performance. Experimental results show that the proposed LTLDC method achieves a bitrate reduction of 4.35% with encoding complexity reduction of 20.38%.

     

基于DPCM与S+P变换的图像无损压缩

S+P变换是由AmirSaid犤7犦提出的一种多分辨表示方法,能够实现整数到整数的变换,从而成功地应用于图像的无损压缩,其性能优于基于线性预测的JPEG标准。为了进一步提高压缩性能,论文提出了一种基于DPCM与S+P变换的图像无损压缩算法。首先,对原始图像进行线性预测,得到差值图像;其次,对差值图像进行S+P变换;最后,对变换系数进行熵编码压缩。新算法利用像素间的相关性,给出了一种新的利用一维S+P变换实现图像变换的方法,减少了变换增加的数据量,有效地解决了边界处理问题。实验结果与性能比较表明:新算法有效的,优于其它著名的基于多分辨分解的无损图像压缩编码算法犤7,10,12犦。     

Hybrid linear weighted prediction and intra block copy based light field image coding

Light field imaging can capture both spatial and angular information of a 3D scene and is considered as a prospective acquisition and display solution to supply a more natural and fatigue-free 3D visualization. However, one problem that occupies an important position to deal with the light field data is the sheer size of data volume. In this context, efficient coding schemes for this particular type of image are needed. In this paper, we propose a hybrid linear weighted prediction and intra block copy based light field image codec architecture based on high efficiency video coding screen content coding extensions (HEVC SCC) standard to effectively compress the light field image data. In order to improve the prediction accuracy, a linear weighted prediction method is integrated into HEVC SCC standard, where a locally correction weighted based method is used to derive the weight coefficient vector. However, for the non-homogenous texture area, a best match in linear weighted prediction method does not necessarily lead to a good prediction of the coding block. In order to alleviate such shortcoming, the proposed hybrid codec architecture explores the idea of using the intra block copy scheme to find the best prediction of the coding block based on rate-distortion optimization. For the reason that the used “try all then select best” intra mode decision method is time-consuming, we further propose a fast mode decision scheme for the hybrid codec architecture to reduce the computation complexity. Experimental results demonstrate the advantage of the proposed hybrid codec architecture in terms of different quality metrics as well as the visual quality of views rendered from decompressed light field content, compared to the HEVC intra-prediction method and several other prediction methods in this field.     

自适应算术编码及其在图像编码中的应用

文章介绍了自适应算术编码的基本原理和实现方法,提出了一种基于预测编码和自适应算术编码的图像编码的算法,这种方法能根据图像的区域特征自适应地选取相应的编码模式,提高编码效率。仿真结果表明该算法能有效地提高图像无损编码的效率。     

基于颜色聚类的计算机桌面图像压缩算法

针对计算机桌面图像压缩问题,提出一种基于颜色聚类的图像压缩算法。将桌面图像划分成16×16的非重叠块,归为文本/图形块、自然图像块及混合块3类。对色彩丰富文本/图形块进行颜色聚类,以降低块的颜色种类数,并做无损压缩。对自然图像块采用H.264帧内预测编码方法,对混合块采用混合编码方法。实验结果表明,该算法所得图像的峰值信噪比和结构相似度均高于传统算法。     

VQ indexes compression and information hiding using hybrid lossless index coding

For the compression of memoryless vector quantization (VQ), most of the lossless index coding algorithms are not suitable for various test images. As a result, we present a hybrid dynamic tree-coding scheme (DTCS) and modified search order coding scheme (MSOC) to re-encode the output index map efficiently without causing any extra coding distortion. The main idea behind this scheme is that the adjacent left and upper around the current processed block usually provide more useful information than its adjacent left-upper and right-upper block, thus we employ two different coding methods according to their corresponding left or upper spatial relations. In addition, we applied the HLIC method to the information hiding. The proposed method does not modify the contents of the secret data and the compressed image. Experimental results show that the newly proposed algorithm achieves significant reduction of bit rate compared to the other lossless index coding schemes for various test images and different codebook sizes. The proposed information hiding scheme can hide a huge amount of information in the index map of an image and allows complete reconstruction of the indexes of the image.     

基于纹理估计的H.264帧内预测快速算法

帧内预测是H.264取得高编码效率的关键技术之一,但其计算复杂度是H.264帧内编码中的瓶颈问题。结合H.264帧内预测特点,提出一种基于纹理估计的帧内预测快速算法。首先通过计算相邻宏块的边界像素差值,估计图像的纹理方向,再根据此方向选择相应的帧内预测模式,减小候选模式数量,简化模式选择过程,降低了帧内预测的计算复杂度。实验结果表明,在保证图像质量和编码码率的前提下,本算法能有效提高H.264的编码速度,有利于实时应用。     

HEVC-based lossless intra coding for efficient still image compression

Latest advancements in capture and display technologies demand better compression techniques for the storage and transmission of still images and video. High efficiency video coding (HEVC) is the latest video compression standard developed by the joint collaborative team on video coding (JCTVC) with this objective. Although the main design goal of HEVC is the compression of high resolution video, its performance in still image compression is at par with state-of-the-art still image compression standards. This work explores the possibility of incorporating the efficient intra prediction techniques employed in HEVC into the compression of high resolution still images. In the lossless coding mode of HEVC, sample- based angular intra prediction (SAP) methods have shown better prediction accuracy compared to the conventional block-based prediction (BP). In this paper, we propose an improved sample-based angular intra prediction (ISAP), which enhances the accuracy of the highly crucial intra prediction within HEVC. The experimental results show that ISAP in lossless compression of still images outclasses archival tools, state-of-the-art image compression standards and other HEVC-based lossless image compression codecs.     

Low complexity, and high fidelity image compression using fixed threshold method

This paper deals with the design and implementation of an image coding algorithm based on fixed threshold method. Threshold is the Peak Absolute Error (PAE) allowed in the reconstructed image. It has been shown that lossless edges with near-lossless/lossless filled area give a high fidelity images. Results are compared with Set Partitioning In Hierarchical Tree (SPIHT) [A. Said, W.A. Pearlman, A new, fast, and efficient image codec based on set partitioning in hierarchical trees, IEEE Trans. Circ. Syst. Video Technol. 12 (1996) 243-250] method. Experimented results show that the proposed method provides high fidelity images, and it has been shown that these images are visually better than images reconstructed using SPIHT algorithm for the same compression ratio. The execution time of the algorithm is almost half compared to that of the SPIHT algorithm which requires wavelet transform of an image.