易于硬件实现的内嵌图像编码算法

EZBC算法综合利用了子带内和子带间系数的相关性．把零树／零块结构和基于上下文编码的优点有机结合在一起,获得了比SPHIT算法更好的压缩性能,比EBCOT更高的压缩效率。但是EZBC算法编码中的两个排序链表需要很大且非固定的存储空间,这使得EZBC算法的硬件实现非常困难。在EZBC算法的基础上提出了一种易于硬件实现、低存储量、高压缩性能的内嵌零块图像编码算法。该算法利用比特平面节点重要性状态表和上下文查找表来完成整个编码过程和形成上下文。实验结果表明,所提出的算法具有与EZBC算法基本相同的高压缩性能,但所需存储空间约为EZBC算法的四分之一,所以该算法更易于硬件实现。     

嵌入式块编码的快速算法和结构

为了更加有效地解决JPEG2000位平面编码算法实现的低效问题,提出了一种快速的基于字级顺序的嵌入式块编码方法。新的编码方法采用对样本的编码通道预测和样本的上下文形成并行流水线执行的技术,实现了对一个子块系数的所有位平面多通道编码的一次扫描顺序完成。提出了一种新的实现字级顺序且多字并行的高速结构,能够在一个时钟周期同时执行对一个条带列4个系数的上下文形成,完成对一个N×N子块系数的上下文形成只需大约N2/4个时钟周期。理论分析和实验结果表明,新的结构比较同类最新设计具有更快的数据处理能力和良好的加速比成本的性能。     

基于JPEG2000的优化编码算法

通过深入研究JPEG2000的核心算法优化截取嵌入块编码。发现分块编码每个位平面上三个通道所需编码的像素不均衡。根据这个编码特性，在结合小波系数特点的基础上，对分块编码提出高频子带最高位和次高位平面联合编码以及0和1位平面两通道编码合并的优化算法。这种基于编码通道合并的优化算法，一方面可以减少编码扫描次数，提高编码速度；另一方面，合理的联合位平面编码算法设计减少了对次高位平面上不重要像素的重要性编码，使无损压缩性能的提高成为可能。     

基于上下文选择编码的小波图像编码算法

提出了基于上下文选择编码的小波图像编码算法:在独立同分布情况下,比较了直接对重要性信息进行算术编码、定长游程编码以及变长游程编码的理想平均比特损耗;分析了由于估计概率误差以及概率时变的存在从而导致了实际平均比特损耗增大;提出了新的上下文模型;根据上下文选择使用算术编码、定长游程编码或者变长游程编码.实验结果表明,在0.25bit/pixel下,新算法较算术编码方案编码时间节省了20%以上;与EBCOT相比,新算法提高了0～0.28dB;尤其适合于低码率应用.     

一种基于EZW的ROI图像联合压缩加密算法

提出一种基于EZW编码的ROI图像联合压缩加密算法,阐述了上下文修正和判决修正的原理及实现,对所提出算法的安全性进行了评估。对算法进行仿真,结果表明相对于原始图像压缩算法,该算法的重构图像基本具有相同的压缩效率;相较于提升系数的ROI方法,该算法采用小波域图像分割,不需要对ROI形状信息进行编码,并可灵活调整ROI与背景区域(BG)的重构质量;相较于区间分裂算术编码器而言,该算法采用自适应算术编码,可获得更好的安全性;结合比特平面编码技术,使用不同密钥对ROI不同小波分辨力的系数分别加密,实现分辨力选择性加密,以满足不同应用需求。     

JPEG2000全通道并行EBCOT-Tier1编码器结构设计

新一代静止图像压缩标准JPEG2000采用了EBCOT算法。该算法Tier1部分在上下文生成过程中需要对位平面进行多次通道扫描,效率很低,难以满足高质量图像实时压缩的要求。目前已有多种改进方案被相继提出,主要基于PS/GOCS和多窗口通道并行扫描。该文设计出一种适用于硬件实现的单窗口全通道并行编码结构,目前已通过FPGA验证。实验表明,该结构下Tier1编码速度明显优于现有几种优化方案。同时,本设计所采用的编码逻辑在解码过程中亦可使用,便于进行编解码复用设计。     

高分辨率航测CCD图像的无损压缩算法

针对超高分辨率CCD相机拍摄图像,提出了一种无损压缩算法.算法以嵌入式小波零树编码为基础, 通过对零树编码输出的比特平面采用变长游程编码方法很好地提高了图像压缩比.同时,算法将游程编码与比特平面编码统一进行,编码效率大大提高.实验结果表明,该算法的像素平均比特率相对经典的嵌入式小波零树算法均有明显降低.     

基于H.26L的精细度可伸缩视频编码

提出了一种基于H．26L精细度可伸缩(fine granularity scalability)视频编码方案，称为EFGS-H．26L。在该方案中，以MPEG-4的FGS为基础构造了一种新的可伸缩结构(EFGS，enhanced fine granularity scalability)，在EFGS结构中，基本层采用H．26L编码，增强层采用类似于JPEG2000的基于上下文的位平面编码。由于H．26L优良的编码性能，使得基本层的编码效率大大提高，为了提高增强层的编码效率，首先把残余图像按子带的顺序重新排列，这样就可以利用子带系数的相关性来实现冗余信息消除。JPEG2000标准中的EBCOT算法已经被证明是非常高效的位平面编码方法，所以对重排后的DCT系数采用一种类似于JPEG2000的基于上下文的位平面编码方法。实验结果证明，在高比特率时，本文提出的精细度可伸缩编码方案编码效率比MPEG-4中的FGS提高3．0dB左右。     

基于上下文建模的分类排序小波图像编码算法

该文提出了基于上下文建模的分类排序小波图像编码算法。该方法使用与JPEG2000标准相同的上下文模型,以最小化相对熵为准则用动态规划获得优化的上下文分类。在重要性编码中结合优化的上下文分类进行排序编码。实验数据表明该算法的压缩能力优于JPEG2000,尤其适于低码率压缩。     

AVS＋熵编码关键技术比较研究

AVS＋是我国2012年颁布的新一代视频编码标准。AVS＋中采用了两种熵编码方法,一种是基于上下文的自适应变长编码CAVLC;另一种为基于上下文的自适应二进制算术编码CABAC。已经有人对H.264标准比较了两种编码体制的优劣,本文针对AVS＋编码应用,简述分析二者算法原理,对照比较其特点,通过测试表明CABAC耗时稍长,但是比CAVLC更加高效。     

基于分数比特面提升的感兴趣区域编码

基于JPEG2000采用的最优截断嵌入式块编码的多通道扫描特性,提出了分数比特面提升的感兴趣区域(region ofinterest,ROI)编码算法,与现有基于比特面提升的同类算法相比,新算法不但可以更为精细地控制ROI图像质量,同时还支持多ROI编码和交互式ROI.仿真结果表明新算法对ROI图像质量的控制效果显著.     

Complement block coding scheme for reducing peak-to-average power ratio of OFDM systems

A new scheme termed as Complement Block Coding (CBC) technique is proposed to reduce the Peak-to-Average Power Ratio (PAPR) of OFDM signals. Utilizing the complement bits which are added to the original information bits, this method can effectively reduce the PAPR of OFDM systems with random frame size N and the coding rate R≤(N - κ)/N, where k is a positive integer and k≤N/2. The performance results obtained with CBC are given and compared with that of some well known schemes, such as Simple Block Coding (SBC), Modified Simple Block Coding (MSBC) and Simple Odd Parity Code (SOPC) for the same purpose. The results show that, at the same coding rate 3/4, the CBC can achieve almost the same performance as SBC, MSBC, but with lower complexity, and that the same performance can be obtained with higher coding rate by using CBC. At the same coding rate (N - 1)IN, the PAPR reduction ofCBC is almost the twice as that of SOPC when N≥16. Further more, the PAPR reductions with coding rate (N - 1)IN are almost the same as that with coding rate less than (N - 1)/N,so the proposed scheme CBC is more suitable for the large frame size with high coding rate and can provide error detection.     

Complement block coding for reduction in peak-to-average power ratio of OFDM signals

In this article a new coding scheme, complement block coding (CBC), is proposed to reduce the PAPR of OFDM signals. This method utilizes the complement bits that are added to the original information bits, which can effectively reduce the PAPR of OFDM signals with random frame size N and the coding rate R /spl les/ (N - k)/N, where k is a positive integer and k /spl les/ N/2. The performance results obtained with CBC are given and compared with that of some well known schemes, such as simple block coding, modified simple block coding, simple odd parity code, and cyclic coding, for the same purpose. The results show that at the same coding rate 3/4, CBC can achieve almost the same performance as SBC and MSBC, but with lower complexity, and the same performance can be obtained with a higher coding rate using CBC. The PAPR reductions of CBC with coding rate (N - 1)/N are almost the same as with a coding rate less than (N - 1)/N, but almost the twice as these of SOPC when N /spl ges/ 16. Moreover, we can find that PAPR is the lowest for all block codes using CBC with coding rate 3/4. So modified CBC (MCBC) is also proposed and analyzed, combined with the subblock processing technique to make CBC effective for OFDM systems with large frame sizes. The flexibility in coding rate choice and low complexity make the proposed CBC more suitable for random frame size with high coding rate and can also provide error detection.     

CBC MAC for Real-Time Data Sources

The Cipher Block Chaining (CBC) Message Authentication Code (MAC) is an authentication method which is widely used in practice. It is well known that the use of the CBC MAC for variable length messages is not secure, and a few rules of thumb for the correct use of the CBC MAC are known by folklore. The first rigorous proof of the security of CBC MAC, when used on fixed length messages, was given only recently by Bellare et al.[3]. They also suggested variants of CBC MAC that handle variable-length messages but in these variants the length of the message has to be known in advance (i.e., before the message is processed). We study CBC authentication of real-time applications in which the length of the message is not known until the message ends, and furthermore, since the application is real-time, it is not possible to start processing the authentication until after the message ends. We first consider a variant of CBC MAC, that we call the encrypted CBC MAC (EMAC), which handles messages of variable unknown lengths. Computing EMAC on a message is virtually as simple and as efficient as computing the standard CBC MAC on the message. We provide a rigorous proof that its security is implied by the security of the underlying block cipher. Next, we argue that the basic CBC MAC is secure when applied to a prefix-free message space. A message space can be made prefix-free by also authenticating the (usually hidden) last character which marks the end of the message. Received 16 September 1997 and revised 24 August 1999 Online publication 2 June 2000     

序列图像的分形编码

分形方法作为一种新兴的图像编码方法,有着压缩比高等独特的优点。但由于它也有着致命的缺点,即编码速度速度很慢,目前对于序列图像的分形编码的研究方兴未艾。文章介绍了两类主要的序列图像分形编码方法,并对其进行了展望。     

Cryptanalysis of Multiple Modes of Operation

In recent years, several new attacks on DES were introduced. These attacks have led researchers to suggest stronger replacements for DES, and in particular new modes of operation for DES. The most popular new modes are triple DES variants, which are claimed to be as secure as triple DES. To speed up hardware implementations of these modes, and to increase the avalanche, many suggestions apply several standard modes sequentially. In this paper we study these multiple (cascade) modes of operation. This study shows that many multiple modes are much weaker than multiple DES, and their strength is theoretically comparable to a single DES. We conjecture that operation modes should be designed around an underlying cryptosystem without any attempt to use intermediate data as feedback, or to mix the feedback into an intermediate round. Thus, in particular, triple DES used in CBC mode is more secure than three single DESs used in triple CBC mode. Alternatively, if several encryptions are applied to each block, the best choice is to concatenate them to one long encryption, and build the mode of operation around it. Received 15 February 1996 and revised 30 May 1996     

High Speed 4-Symbol Arithmetic Encoder Architecture for Embedded Zero Tree-Based Compression

In state-of-the-art multimedia compression standards, arithmetic coding is widely used as a powerful entropy compression method. In the MPEG-4 standard a specific 4-symbol, multiple-context arithmetic coder is used for wavelet based image compression. In this paper we present a first-of-a-kind architecture capable of processing close to 1 symbol per cycle, managing multiple context in a simple, yet cost-efficient manner. We explain the need for such an architecture, develop the algorithm and propose an efficient implementation. The characteristics of the architecture are detailed and a comparison with other alternatives is presented. This architecture has been synthesized achieving a maximum speed of 170 MHz, equivalent to 340 Mbits/s.     

精细可分级编码技术及其应用

首先讲述精细可分级编码(FGS)的主要编码技术和它的精细分级特性,介绍了FGS几个先进特征和主要的改进方案;接着从网络视频应用特点的角度出发,讨论了在FGS抗误码方面和适应时变网络带宽方面的现有工作,并结合研究给出实例;最后描述了基于FGS的网络视频应用的单播和多播系统框架。     

H.264/AVC自适应算术解码器结构设计

限制基于上下文的二进制算术解码(CABAD)速度的几个主要环节入手,提出了优化的上下文存储模式,改进的重归一化单元,并使用流水线提高解码速度.在Synopsys公司的CoCentric System Studio平台进行了二进制算术解码器体系结构设计,仿真结果表明,本结构能够满足主要档次(main profile)CIF 30fps的实时解码的要求.