This paper presents a novel context-based adaptive variable length coding (CAVLC) architecture based on split and shared VLC look up table technique. The architecture is prototyped in Verilog HDL, simulated and synthe...
详细信息
This paper presents a novel context-based adaptive variable length coding (CAVLC) architecture based on split and shared VLC look up table technique. The architecture is prototyped in Verilog HDL, simulated and synthesized for Xilinx Virtex II FPGA. The experimental result shows that the proposed architecture is capable of processing CIF frame sequences in real-time and is smaller than any of the real-time architectures proposed so far. The maximum speed of the core is around 60 MHz
H.264/AVC adopts new features compared with previous multimedia algorithms. It is inefficient to implement some of the new features with existing DSP instructions. This paper presents an application specific instructi...
详细信息
H.264/AVC adopts new features compared with previous multimedia algorithms. It is inefficient to implement some of the new features with existing DSP instructions. This paper presents an application specific instruction set processor (ASIP) for implementation of H.264/AVC, called VSIP. The proposed VSIP has novel instructions for new features, such as intra prediction, deblocking filter, integer transform, etc. In addition, VSIP employs hardware accelerators for inter prediction and entropy coding. Performance comparisons show a significant improvement compared with existing DSPs. Moreover, the proposed hardware accelerators have small size and can support real-time video processing. The results indicate that VSIP is one of promising solutions for H.264/AVC
An important quantity in the analysis of MAP decoding for LDPC codes is the conditional entropy of the input given the output. There exist conjectured formulas for this entropy derived from the replica technique and o...
详细信息
ISBN:
(纸本)142440505X
An important quantity in the analysis of MAP decoding for LDPC codes is the conditional entropy of the input given the output. There exist conjectured formulas for this entropy derived from the replica technique and one sided bounds derived with the help of the interpolation method. In this paper we compute exactly such a quantity for a simpler spin model which retains the essential features of the communications problem. The result is a step towards a proof of the conjectured replica formula for the conditional entropy under MAP decoding
Summary form only given. We propose an innovative scheme for distributed coding of two correlated variables X and Y. After analyzing the proposed scheme in some detail, we compare it with joint coding via Karhunen-Loe...
详细信息
Summary form only given. We propose an innovative scheme for distributed coding of two correlated variables X and Y. After analyzing the proposed scheme in some detail, we compare it with joint coding via Karhunen-Loeve transform followed by uniform quantization and entropy coding. We carried out some experiments with X = Y + N, where X, Y and W are all uniform or all Gaussian, with W independent from Y. Experimental results show that the proposed distributed coding scheme has very close or better performance than the joint coding procedure in the considered cases
In this paper, we present a new wavelet zero-tree video coding method based on lattice vector quantization (LVQ) and Wyner-Ziv coding. It uses dependences only at decoder and develops a new intra-encoding and inter-de...
详细信息
In this paper, we present a new wavelet zero-tree video coding method based on lattice vector quantization (LVQ) and Wyner-Ziv coding. It uses dependences only at decoder and develops a new intra-encoding and inter-decoding framework. In this framework, the conventional entropy coding is replaced by a low-density parity-check (LDPC) Slepian-Wolf codec and the idea of Slepian-Wolf coding is used to set partitioning in hierarchical trees (SPIHT) and lattice vector quantization completely. Experiment results suggest that our scheme can get higher PSNR and better recovered video than intra-frame SPIHT and scalar Slepian-Wolf SPIHT
A new wavelet-based method for the compression of electrocardiogram (ECG) data is presented. The discrete wavelet transform (DWT) is applied to the digitized ECG signal. The DWT coefficients are firstly quantized with...
详细信息
A new wavelet-based method for the compression of electrocardiogram (ECG) data is presented. The discrete wavelet transform (DWT) is applied to the digitized ECG signal. The DWT coefficients are firstly quantized with a uniform scalar dead zone quantizer. Then, the quantized coefficients are decomposed into two parts for efficient entropy coding: a nonzero coefficient stream and a binary significance symbol stream which indicates the locations of those nonzero coefficients. The Exp-Golomb coding is used to code the lengths of runs of the zero coefficients. The Golomb-Rice coding is used to code the nonzero coefficients. Experiments on several records from the MIT-BIH arrhythmia database show that the proposed coding algorithm outperforms other recently developed ECG signal compression algorithms
Summary form only given. We designed a family of integer-to-integer (i2i) approximations to the Cartesian-to-polar transformation and analyzed its behavior for high-rate transform coding. Denoting (ordinary, continuou...
详细信息
Summary form only given. We designed a family of integer-to-integer (i2i) approximations to the Cartesian-to-polar transformation and analyzed its behavior for high-rate transform coding. Denoting (ordinary, continuous) polar coordinates by (r, 0), our precise high-rate analysis relates the performance to the differential entropies of r 2 and 0, which are often easy to evaluate. One may thus predict when there is an improvement over linear transform coding. The analysis matches our simulations for coding of Gaussian scale mixtures and other polar-separable sources. The advantage over the best linear transform coder can be large. Our hope is to extend the polar-coordinate results to a general theory for nonlinear transform coding based on i2i implementations of arbitrary nonlinear transformations
The symbol grouping technique is widely used in practice because it allows great reductions on the complexity of entropy coding symbols from large alphabets, at the expense of small losses in compression. While it has...
详细信息
ISBN:
(纸本)142440505X
The symbol grouping technique is widely used in practice because it allows great reductions on the complexity of entropy coding symbols from large alphabets, at the expense of small losses in compression. While it has been used mostly in an ad hoc manner, it is not known how general this technique is, i.e., in exactly what type of data sources it can be effective. We try to answer this question by searching for worst-case data sources, measuring the performance, and trying to identify trends. We show that finding the worst-case source is a very challenging optimization problem, and propose some solution methods that can be used in alphabets of moderate size. The numerical results provide evidence confirming the hypotheses that all data sources with large number of symbols can be more efficiently coded, with very small loss, using symbol grouping
An adaptive palette reordering method is proposed in this paper to reshape the statistical properties of the color index map of a color-indexed image with a dynamic palette. Unlike other reordering methods, the propos...
详细信息
An adaptive palette reordering method is proposed in this paper to reshape the statistical properties of the color index map of a color-indexed image with a dynamic palette. Unlike other reordering methods, the proposed method extracts information from both the color index map and the palette to achieve the objective. The compression performance of JPEG-LS can be significantly improved when the proposed method is used
Image compression can be obtained by wavelet transformation of integer input data followed by quantification and coding. Invertible wavelet transforms that map integers to integers have important applications in lossl...
详细信息
Image compression can be obtained by wavelet transformation of integer input data followed by quantification and coding. Invertible wavelet transforms that map integers to integers have important applications in lossless coding. Factorization of wavelet transforms is called lifting steps, which allows construction of an integer version into integer version of every wavelet transform. Significant and refinement consistent with the terminology of zero trees of wavelet coefficients. The embedded zero tree wavelet algorithm (EZW) having the properties that the bits in the bit stream are generated in order of importance, yielding a fully embedded code. We investigate the lossless compression using an image coder
暂无评论