Interframe Cosine Transform Image Coding

Two-dimensional transform coding and hybrid transform/DPCM coding techniques have been investigated extensively for image coding. This paper presents a theoretical and experimental extension of these techniques to the coding of sequences of correlated image frames. Two coding methods are analyzed: three-dimensional cosine transform coding, and two-dimensional cosine transform coding within an image frame combined with DPCM coding between frames. Theoretical performance estimates are developed for the coding of Markovian image sources. Simulation results are presented for transmission over error-free and binary symmetric channels.     

Improvements of Transform Coding Algorithm for Motion-Compensated Interframe Prediction Errors-DCT/SQ Coding

A new hybrid coding method for transmitting videoconferencing images at a bit rate 384 kbits/s is proposed. Considering the characteristics of motion-compensated interframe prediction errors for typical videoconferencing scenes, a filter is introduced to separate pulsive components on which conventional discrete cosine transform (DCT) coding method does not work well. These separated pulsive components are coded by using scalar quantization (SQ). The remainder are DCT coded. For DCT coefficients, an adaptive coding method based on the classification of DCT coefficients is applied in order to improve the coding performance. Since the proposed method employs both DCT coding and SQ of prediction errors, it is named "DCT/SQ coding method." Experimental results show that the DCT/SQ coding method is effective to reduce so-called mosquito effects, and thus it can improve the quality of decoded images.     

Scalable Interframe Wavelet Coding with Low Complex Spatial Wavelet Transform

In the decoding process associated with interframe wavelet coding, the inverse wavelet transform requires high computational complexity. However, as video technology starts to pervade all aspects of our lives, decoders are becoming required in various devices such as PDAs, notebooks, PCs, and set‐top boxes. Therefore, a decoder's complexity needs to be adapted to the processor's computational power, and consequently a low‐complexity codec is also required for scalable video coding. In this paper, we propose a method of controlling and lowering the complexity of the spatial wavelet transform while sustaining the same coding efficiency as that currently afforded. In addition, the proposed method may alleviate the ringing effect for slowly changing image sequences.     

The Effectiveness and Efficiency of Hybrid Transform/DPCM Interframe Image Coding

We seek to evaluate the efficiency of hybrid transform/ DPCM interframe image coding relative to an optimal scheme that minimizes the mean-squared error in encoding a stationary Gaussian image sequence. The stationary assumption leads us to use the asymptotically optimal discrete Fourier transform (DFT) on the full frame of an image. We encode an actual image sequence with full-frame DFT/DPCM at several rates and compare it to previous interframe coding results with the same sequence. We also encode a single frame at these same rates using a full-frame DFT to demonstrate the inherent coding gains of interframe transform DPCM over intraframe coding. We then generate a pseudorandom image sequence with precise Gauss-Markov statistics and encode it by hybrid full-frame DFT/DPCM at various rates. We compare the signal-to-noise ratios (SNR's) of these reconstructions to the optimal ones calculated from the rate-distortion function. We conclude that in a medium rate range below 1 bit/pel/frame where reconstructions for hybrid transform/ DPCM may be unsatisfactory, there is enough margin for improvement to consider more sophisticated coding schemes.     

Uncovered Background Prediction in Interframe Coding

Various interframe coding methods have been devised to reduce the cost of television signal transmission. Some degradation still remains, however, because prediction efficiency is lowered in uncovered background areas which appear behind moving objects. This paper proposes an uncovered background predictive coding algorithm, which increases prediction efficiency. Prediction efficiency is evaluated by using a simple signal model and real television signals. Experimental results show that the information generation rate is reduced to 78 percent as compared to that of previous frame predictive coding when the displacement is 10 pels/frame.     

Bit Allocation for Interframe Video Coding Systems

In this work, we present a novel approach to the bit allocation problem that aims to minimize overall distortion subject to a bit rate constraint. The optimal solution can be found by the Lagrangian method with dynamic programming. However, the optimal bit allocation for block‐based interframe coding is practically unattainable because of the interframe dependency of macroblocks caused by motion compensation. To reduce the computational burden while maintaining a result close to the optimum, i.e., near optimum, we propose an alternative method. First, we present a partitioned form of the bit allocation problem: a “frame‐level problem” and “one‐frame macroblock‐level problems.” We show that the solution to this new form is also the solution to the conventional bit allocation problem. Further, we propose a bit allocation algorithm using a “two‐phase optimization technique” with an interframe dependency model and a rate‐distortion model.     

Interframe Coding for 4-MHz Color Television Signals

An interframe coding system is described which is capable of transmitting a 4-MHz National Television System Commission (NTSC) color television signal. 6.3 Mbit/s transmission gives acceptable picture quality for video telephone or conference TV use. The NTSC color television signal is converted into a timedivision multiplex (TDM) signal which is composed of time-compressed chrominance and luminance signal in sequence. This signal is encoded using a frame-difference coder of the kind that has been used for black-and-white television signals. A field-repeating technique is introduced into the coder, to prevent a buffer memory from overflowing and to improve picture quality. Statistical investigations show that the presence of the timecompressed chrominance signal gives less than 10 percent increase in the amount of information generated by picture movements; this increase scarcely affects the picture quality.     

Interframe DPCM with Adaptive Quantization and Entropy Coding

The object of this work has been to study encoding of monochrome pictures with a rate of about 1 bit per picture element (pel). Differential pulse code modulation, DPCM, has been chosen to make the system reasonably simple. This motivates the choice of a fixed three-dimensional predictor made separable in time and space. It essentially amounts to encoding the frame difference using a two dimensional predictor. To improve performance, the quantizer is made adaptive and the encoding is combined with delayed decision. A three-level quantizer is being used with an adaptive scheme that works with either forward or backward estimation. The output from the DPCM unit is redundant and we have adopted entropy coding to further reduce the bit rate. The entropy measure is also used to adjust the quantizer parameters to achieve the desired bit rate of 1 bit/pel. Encoding experiments were carried out on a complex videophone scene by means of computer simulations.     

Displacement Measurement and Its Application in Interframe Image Coding

A new technique for estimating interframe displacement of small blocks with minimum mean square error is presented. An efficient algorithm for searching the direction of displacement has been described. The results of applying the technique to two sets of images are presented which show 8-10 dB improvement in interframe variance reduction due to motion compensation. The motion compensation is applied for analysis and design of a hybrid coding scheme and the results show a factor of two gain at low bit rates.     

Interframe Predictive Coding of Images Using Hybrid Vector Quantization

The temporal and spatial redundancies of image sequences can be reduced by prediction and vector quantization, respectively. The robustness of the coder is increased through the use of a hybrid two-stage vector quantizer. The first stage is of the Linde-Buzo-Gray type. The second stage encodes the residual error of the first stage using a lattice vector quantizer.     

基于DCT变换的JPEG图像压缩编码

文章主要论述了基于DCT(离散余弦变换)的JPEG图像压缩方法的研究及软件的实现.实验表明该方法具有灵活高效的特点,可以应用到实际中.     

H.264快速帧间编码模式选择算法

本文提出了一种用于H.264编码的快速帧间编码模式选择算法。首先对低分辨率缩略图进行编码和R-D优化,选出该分辨率下帧间编码宏块中每个8x8块使用的最优帧间编码模式,然后将该模式映射为原始分辨率图像中对应16x16宏块的候选帧间编码模式子集,最后用通常的R-D优化方式从中选出原始分辨率下的最优模式。这种算法有效地减少了原图像编码过程中待测编码模式的数量,从而提高了编码速度。测试表明,此算法能够使编码速度提高将近一倍,同时码率增加不超过3%,PSNR下降不超过0.2dB。     

A Motion-Compensated Interframe Coding Scheme for NTSC Color Television Signals

A motion-compensated interframe coding system for an NTSC color television signal has been developed. The output of a local decoder is used in the form of aY/Cseparated signal. Motion vectors are detected using theYsignal, and theYsignal and both baseband components of theCsignal are motion-compensated. The motion-compensated signals are reencoded into an NTSC signal to provide a motion-compensation interframe prediction in the NTSC format. Real-time experimental hardware has been built. The sampling frequency and bit rate of this system are 10.7 MHz and 1.6 bits/ sample, respectively. This value includes all overhead information such as motion vectors and other control information. An assessment has been made of the picture quality of coded/decoded pictures taken from a variety of broadcast television programs. The quality was good for almost all the programs. A subjective test of picture quality was performed under stringent conditigns. The lowest value for the picture quality of the most difficult scenes at 1.6 bits/sample was 3.3 on a five-grade impairment scale.     

Slant Transform Image Coding

A new unitary transform called the slant transform, specifically designed for image coding, has been developed. The transformation possesses a discrete sawtoothlike basis vector which efficiently represents linear brightness variations along an image line. A fast computational algorithm has been found for the transformation. The slant transformation has been utilized in several transform image-coding systems for monochrome and color images. Computer simulation results indicate that good quality coding can be accomplished with about 1 to 2 bits/pixel for monochrome images and 2 to 3 bits/pixel for color images.     

1.544-Mbits/s Transmission of TV Signals by Interframe Coding System

As a powerful tool for economizing on the digital transmission of videotelephone signals, interframe coding techniques have drawn increasing attention, and various interframe coding schemes have been proposed recently. However, many problems remain to be studied in establishing technical feasibility for these techniques and schemes. This concise paper reports on field trial in which a 1.544-Mbits/s digital transmission of videotelephone signals was conducted over Nippon Telegraph and Telephone Public Corporation's (NTT's) PCM100M digital repeatered line between Tokyo and Yokohama, Japan. The experimental interframe codec is based on the well-understood conditional picture element replenishment algorithm. The object of the field trial was to demonstrate, not the validity of the algorithm itself, but the technical feasibility of the interframe coding system as an entity. Experimental results are satisfactory enough to assure us of the system's practicality in the near future.     

Adaptive Transform Coding Based on Chain Coding Concepts

Chain coding technique, originally developed for digital representation and processing of line drawing data, has been implemented in a transform image coding algorithm with significant performance improvement. The algorithm is based on the observation that the boundary of the regions of zero coefficients within a transform block can be efficiently represented by sequences of fixed line segments (chains). Preliminary results indicate significant improvements over the basic coder algorithm in which the consecutive zeros in the transform block were runlength coded. The additional implementation complexity is modest.     

小波变换码中滤波器的选择

在本文中，我们从广义编码增益、分解重构性能与对误差的敏感性、编码性能与主观质量三个方面对双正交小波12／4、9／7与9／3进行比较，得出：双正交小波12／4比9／7与9／3更适合于小波图像压缩，特别是在高保真压缩中；在低比特率编码中，双正交小波12／4与9／7相差不大。     

A Lossless Compression Method for Medical Image Sequences Using JPEG-LS and Interframe Coding

Hospitals and medical centers produce an enormous amount of digital medical images every day, especially in the form of image sequences, which requires considerable storage space. One solution could be the application of lossless compression. Among available methods, JPEG-LS has excellent coding performance. However, it only compresses a single picture with intracoding and does not utilize the interframe correlation among pictures. Therefore, this paper proposes a method that combines the JPEG-LS and an interframe coding with motion vectors to enhance the compression performance of using JPEG-LS alone. Since the interframe correlation between two adjacent images in a medical image sequence is usually not as high as that in a general video image sequence, the interframe coding is activated only when the interframe correlation is high enough. With six capsule endoscope image sequences under test, the proposed method achieves average compression gains of 13.3% and 26.3 % over the methods of using JPEG-LS and JPEG2000 alone, respectively. Similarly, for an MRI image sequence, coding gains of 77.5% and 86.5% are correspondingly obtained.     

一种基于变换域Wyner-Ziv视频编码的有效重建算法

为了减少分布式视频编码系统解码后重建值与真实值之间误差,提出了基于变换域Wyner-Ziv视频编码最小均方误差(MMSE)重建的一种新的有效重建算法。该算法充分利用视频帧间相关性,对MMSE重建算法积分区间做出调整,当边信处于解码值对应量化区间之内时,在量化区间内利用MMSE重建;当边信息处于解码值对应量化区间之外时,对量化区间做出调整,在改进后的区间利用MMSE重建。实验结果表明,与最佳重建最小均方误差重建算法相比,该算法可以有效提高解码视频的平均PSNR。     

图像压缩编码中Walsh变换与DCT变换及其比较

图像变换是图像处理的基础,是图像压缩的第一步。在图像压缩中,DCT变换因其变换效果好而被广泛采用,成为目前最常用的图像压缩变换方法,而Walsh变换还未被广泛采用。通过对这两种变换的算法分析以及Matlab仿真实验和峰值信噪比的对比,结果表明,walsh变换在算法上比DCT简单,实现较为容易,其变换性能并不亚于DCT变换,在某些量化级上甚至还优于DCT变换,Walsh变换有着广泛的应用前景。