分级视频编码中宏块相关性快速模式决策

为降低空时分级视频编码中自适应层间预测模式的计算复杂度,利用增强层中时域宏块相关性的特点,提出一种随时间等级变化的快速模式决策算法。该算法将参考宏块使用过的模式按照其率失真优化代价排序,选择其中代价较小的模式作为当前宏块的动态备选方案,从而有效地提高编码效率。在JSVM上的实验结果表明,同原有非优化决策算法相比,在PSNR平均降低0.0148dB、比特率增加0.55%的情况下,该优化算法使得平均编码时间减少21.67%。     

分形图像编码的快速细粒度迭代解码

该文基分形图像编码的固有特征，阐述和研究了分形图像编码的迭代解码方法的“可分级性”概念，在这一思想指导下，在迭代解码过程中用单缓冲算法取代传统分形编码中的双缓冲算法，在节省了内存空间开销的同时有交地实现了更细粒度上的质量可分级性解码，继而提出了一种块排序解码算法用于基于尺寸自适应块分割的分形编解码方案中，获得了更快的解码收敛速度，通过以上一系列算法深入地阐述了分形偏解码中“质量连续可分级性”的思想，给出了一个初步的实现模型并对结果作了详尽的分析。     

Single-rate near lossless compression of animated geometry

Representing mesh geometry in local rather than the world coordinate systems is very useful in many 3D animation processing applications. One can investigate the representation of vertex locations relative to a local coordinate frame (LCF) in the compression of dynamic 3D meshes. Unlike the world coordinates, which scatter in a wide range and show non-linear behavior of the vertices, the local coordinates exhibit a large clustering behavior of the vertex over time. This property is very useful for exploiting a large coherence over the vertex trajectory and between neighboring vertices. In this paper, we discuss the use of the LCF in static and animated mesh encoding and we introduce a new connectivity-guided predictive scheme for single-rate compression for animated meshes. The proposed geometry encoding strategy is based on a region growing encoding order, and only the differences between original and predicted locations are encoded in a local coordinate system, which splits into two tangential and one normal components. The approach is simple, efficient, and well-suited for real time applications.     

Impact of vertex clustering on registration-based 3D dynamic mesh coding

3D dynamic meshes are associated with voluminous data and need to be encoded for efficient storage and transmission. We study the impact of vertex clustering on registration-based dynamic mesh coding, where compact mesh motion representation is achieved by computing correspondences for the mesh segments from the temporal reference to obtain high compression performance. Clustering algorithms segment the mesh into smaller pieces and the compression performance is directly related to how effectively these pieces can describe the mesh motion. In this paper, we demonstrate that the use of efficient vertex clustering schemes in the compression framework can bring about a 10% improvement in compression performance.     

Content-based scalable H.263 video coding for road traffic monitoring

For sending video data through very low bit-rate mobile channels, video codec with high compression rate is the pre-requisite. Although the H.263 video codec is recommended as one of the candidates due to its simplicity and efficiency, it is generally believed that its compression efficiency can be further improved if the content-based scalable video coding technique can be applied. In this paper, we propose a modified H.263 encoder which supports real-time content-based scalable video coding. The proposed technique is applied to real-time video surveillance systems for road traffic monitoring. For the proposed approach, the moving objects, i.e. cars, are first extracted from the steady background. Their activities are then further classified as fast or slow by assessing the regularity of their motion. The information is then passed to a modified H.263 encoder to reduce the temporal and spatial redundancies in the video. As compared with the conventional H.263 encoder using for the same application, the proposed system has a 20% increase in compression rate with negligible visual distortion. The proposed system fully complies with the ITU H.263 standard hence the encoded bit stream is completely comprehensible to the conventional H.263 decoder.     

基于上下文的网格拓扑压缩熵编码方法

提出了一种普遍适用于网格拓扑压缩的高效熵编码方法.不同于以往的单纯利用算术编码或Huffman编码对遍历网格生成的拓扑流进行编码压缩,对这些拓扑流的每个符号先计算其Huffman编码,然后采用基于上下文(已编码序列的倒数第2个符号作为上下文)的算术编码方法来编码其Huffman值,从而实现对网格模型拓扑信息的有效压缩.实验结果表明,熵编码方法普遍适用于各种网格拓扑压缩方法得到的拓扑流的压缩,其压缩结果普遍高于拓扑流序列的熵值——绝大多数拓扑压缩算法各自最好的压缩比.     

基于IFS理论的快速图象编码和解码算法

分形图象编码法具有高压缩比、高图象品质等显著优点，但其编码时间太长。文中提出的快速编码算法，用偏差图导出距离度量，用二叉树和链表结构进行搜索匹配，可使编码速度提高几十倍乃至百倍。同时，用偏差图进行解码迭代，可使解码过程加速，而还原图象质量不变。     

高效自适应的抗污染攻击网络编码传输方案

本文主要研究网络编码在抗污染攻击中的应用,针对中间节点对收到的所有编码包进行验证浪费网络资源和目的节点解码速率慢等问题,提出一种高效自适应的抗污染攻击网络编码传输方案-EANC(Efficient and Adaptive Network Coding transmission scheme against pollution attack)。EANC方案在数据分组编码阶段,利用按照网络编码的时间和空间特性构造的线性子空间签名方案准确地验证数据分组是否被污染从而有效控制污染数据分组的传播,并且能使中间节点调节验证步骤使之自适应于当前网络的污染程度,从而提高验证效率;在目的节点解码阶段,EANC方案利用目的节点重传恢复机制降低解码恢复时延。仿真结果表明,EANC方案能够减少子空间的签名长度并且降低目的节点解码恢复的平均时延。     

基于模版的三角网格拓扑压缩

提出一种基于面的高效三角网格拓扑压缩算法.该算法是单分辨率无损压缩算法,是对Edgebreaker算法的改进:在网格遍历部分,通过自适应网格遍历方法使非常影响压缩比的分割图形操作尽可能少;在熵编码部分,为网格遍历后得到的每个操作符各设计一个模版,根据模版确定该操作符的二进制表示,然后采用自适应算术编码方法压缩该二进制表示得到最后的压缩结果.与网格拓扑压缩领域中基于面的最好的算法得到的压缩比相比较,该算法得到的压缩比有很大提高.     

基于部分测试向量切分的LFSR重新播种方法

提出一种测试码压缩方法,首先切分测试集中含确定位较多的难以编码的测试向量,然后与未被切分的测试向量共同组成新的测试集,并将新测试集编码成线性反馈移位寄存器(LFSR)种子,从而实现测试数据压缩.该方法提高了LFSR的编码效率,取得了稍优于混合码的压缩率.与混合码复杂的解压结构相比,在硬件开销上具有明显的优势,仅需一个LFSR和简单的控制电路,且通信协议简单.     

Vector-quantization-based video codec for software-only playback on personal computers

This paper discusses a video compression and decompression method based on vector quantization (VQ) for use on general purpose computer systems without specialized hardware. After describing basic VQ coding, we survey common VQ variations and discuss their impediments in light of the target application. We discuss how the proposed video codec was designed to reduce computational complexity in every principal task of the video codec process. We propose a classified VQ scheme that satisfies the data rate, image quality, decoding speed, and encoding speed objectives for software-only video playback. The functional components of the proposed VQ method are covered in detail. The method employs a pseudo-YUV color space and criteria to detect temporal redundancy and low spatial frequency regions. A treestructured-codebook generation algorithm is proposed to reduce encoding execution time while preserving image quality. Two separate vector codebooks, each generated with the treestructured search, are employed for detail and low spatial frequency blocks. Codebook updating and sharing are proposed to further improve encoder speed and compression.     

Influence of downsampling filter characteristics on compression performance in wavelet-based scalable video coding

The application of different downsampling filters in video coding directly models visual information at lower resolutions and influences the compression performance of a chosen coding system. In wavelet-based scalable video coding the spatial scalability is achieved by the application of wavelets as downsampling filters. However, characteristics of different wavelets influence the performance at targeting spatio-temporal decoding points. An analysis of different downsampling filters in popular wavelet-based scalable video coding schemes is presented. Evaluation is performed for both intra- and inter-coding schemes using wavelets and standard downsampling strategies. On the basis of the obtained results a new concept of inter-resolution prediction is proposed, which maximises the average performance using a combination of standard downsampling filters and wavelet-based coding.     

基于相关系数的快速分形图像编码

分形图像编码是一种有效压缩技术。在分形编码中，一幅图像由一个不动点接近原始图像的压缩变换来编码，然后由源于Banach不动点定理的迭代过程来解码。该文提出了快速分形图像编码的一种基于相关系数的编码方案，不需要改变现有的分形解码过程。该方案基于这样的假设，两个等尺寸的子块不能组成匹配对，除非它们的相关系数相对较大。它能够以直接的方式融入其它的分形编码算法。计算机仿真显示，对8幅复杂性不同的测试图像，该文算法能够平均加快编码3倍或更多，同时PSNR(peak signal-to-noise ratio)平均下降不到0．1dB，且主观质量有时甚至好于基本分形算法。     

COBRA: Compression of the Basis for PCA Represented Animations

In this paper, we present an extension of dynamic mesh compression techniques based on PCA. Such representation allows very compact representation of moving 3D surfaces; however, it requires some side information to be transmitted along with the main data. The biggest part of this information is the PCA basis, and since the data can be encoded very efficiently, the size of the basis cannot be neglected when considering the overall performance of a compression algorithm.
We present a new work in this area, as none of the papers about PCA based compression really addresses this issue. We will show that for an efficient and accurate encoding there are better choices than even sophisticated algorithms such as LPC.
We will present results showing that our approach can reduce the size of the basis by 90% with respect to direct encoding, which can lead to approximately 25% increase of performance of the compression algorithm without any significant loss of accuracy. Such improvement moves the performance of the PCA encoder beyond the performance of current state of the art dynamic mesh compression algorithms, such as the recently adopted MPEG standard, FAMC.     

基于可变模版的三角网格拓扑压缩

针对三角网格模型的拓扑信息。提出了一种高效压缩方法.不同于以往的单纯利用算术编码或霍夫曼鳊码对遍历三角网格生成的拓扑流进行编码压缩,根据三角网格模型(特别是规则三角网格模型)的特点,自适应地提高编码过程中对当前编码字符发生的预测准确率,实现对三角网格模型的拓扑信息的高效压缩.算法首先遍历三角网格模型,得到操作符序列;然后对得到的操作符序列的每个操作符作模版可变的自适应算术编码.在编码过程中,根据当前编码字符的前一个操作符、三角网格模型的特点以及网格遍历方法为当前编码操作符计算一个模版,在这个模版中,预测准确率高的操作符用较短的二进制串表示.根据当前编码操作符的可变模版,可以得到该操作符的二进制表示,并对这个二进制表示的每个比特作自适应算术编码.该方法是针对流形三角网格模型的拓扑信息作单分辨率的基于面的无损压缩,可以得到很好的三角网格拓扑信息的压缩结果,其压缩比甚至比拓扑压缩领域压缩比方面最好的TG算法的压缩比还要好.     

基于Surfacelet变换和SPIHT算法的视频压缩

提出一种基于Surfacelet变换并结合SPIHT算法的视频压缩编码方法。这种新方法把视频信号作为特殊的三维信号,对信号的空间和时间维进行整体处理。Surfacelet变换具有多方向分解、各向异性、高效率的树结构滤波器组、可完全重建和低冗余度等性质。SPIHT算法具有分辨率质量上的可伸缩性、渐进传输性等特性。利用Surfacelet变换的分解系数在各层间相关以及图像能量集中的特性,结合SPIHT算法完成视频数据的压缩编码。这种新的视频压缩编码方法能弥补三维小波变换的缺陷,达到更高的 PSNR 值和更好的视觉效果,尤其适用于纹理复杂度较高、运动幅度较小的视频。     

基于上下文算术编码的非三角网格拓扑压缩

网格拓扑压缩方法是计算机图形学的基础算法。该文方法是单分辨率,主要针对非三角网格模型的拓扑信息作无损压缩。算法首先遍历网格的所有多边形得到操作系列;然后对操作系列作霍夫曼编码;再对霍夫曼编码结果作基于上下文长度可变的算术编码得到最后的压缩结果。相比于对非三角网格拓扑信息作压缩的压缩比很高的算法,该算法得到的压缩结果更好。此算法的另一个突出优点是在解码时间和空间上有了改进——新算法可以在接收一个多边形的编码后立即完成解码并抛弃这个编码,从而使得该算法特别适用于在线传输和解码的实时与交互应用场合。此外,该算法还可以处理有空洞和柄（handle）的模型。     

高质量、低复杂度的纯软件实时MPEG音频编、解码器

ＭＰＥＧ音频是高保真立体声音频压缩编、解码的国际标准,该标准采用与心理声学模型相结合的子带编码方案,算法计算量大,难以满足实时应用的场合。文章不仅从理论上分析了编、解码算法的基本原理,而且提出了快速算法,设计并实现了一个纯软件ＭＰＥＧ音频编、解码器。该软件可在不需任何附加硬件的Ｐｅｎｔｉｕｍ１６６ＭＨｚ计算机上对立体声音频信号进行实时编码和解码。     

一种高效的CABAC解码器硬件结构设计

相对于其他熵编码而言,基于上下文的自适应二进制算术熵编码（CABAC）具有更大的数据压缩率,但由于其运算复杂,访问存储设备频繁,导致编／解码率较低。针对影响CABAC解码速度的“瓶颈”问题,提出了一种高效的CABAC解码器硬件结构,包括新的存储访问方式、优化的解码核心单元结构以及子解码器级联的方式。实验结果表明,该硬件结构可显著提高CABAC的解码效率。