We analyze the technique for reducing the complexity of entropy coding consisting of the a priori grouping of the source alphabet symbols, and in dividing the coding process in two stages: first coding the number of t...
详细信息
We analyze the technique for reducing the complexity of entropy coding consisting of the a priori grouping of the source alphabet symbols, and in dividing the coding process in two stages: first coding the number of the symbol's group with a more complex method, followed by coding the symbol's rank inside its group using a less complex method, or simply using its binary representation. Because this method proved to be quite effective it is widely used in practice, and is an important part in standards like MPEG and JPEG. However, a theory to fully exploit its effectiveness had not been sufficiently developed. In this work, we study methods for optimizing the alphabet decomposition, and prove that a necessary optimality condition eliminates most of the possible solutions, and guarantees that dynamic programming solutions are optimal. In addition, we show that the data used for optimization have useful mathematical properties, which greatly reduce the complexity of finding optimal partitions. Finally, we extend the analysis, and propose efficient algorithms, for finding min-max optimal partitions for multiple data sources. Numerical results show the difference in redundancy for single and multiple sources.
This paper presents the design of a hardware architecture for the entropy coder of H.264/AVC video compression standard, considering the baseline profile. The baseline entropy coder is composed of two main blocks: Exp...
详细信息
ISBN:
(纸本)1424406064
This paper presents the design of a hardware architecture for the entropy coder of H.264/AVC video compression standard, considering the baseline profile. The baseline entropy coder is composed of two main blocks: Exp-Golomb coder and CAVLC coder. This paper presents the architectural design of these two blocks. These architectures were described in VHDL and synthesized to an Altera Stratix-II FPGA. From the synthesis results it was possible to verify that the Exp-Golomb and CAVLC coders reached a throughput of 15.9 million of samples per second for the Exp-Golomb coder and of 103.8 million of samples per second for CAVLC coder. The H.264/AVC baseline entropy coder is being designed through the integration of these two coders and preliminary results indicate that this solution will be able to process HDTV frames in real time.
In this paper, we propose a robust ordering scheme for entropy coding in gray-level image. The issue is to reduce additional information needed when bitstream is transmitted. The proposed scheme uses the ordering meth...
详细信息
In this paper, we propose a robust ordering scheme for entropy coding in gray-level image. The issue is to reduce additional information needed when bitstream is transmitted. The proposed scheme uses the ordering method of co-occurrence count about gray-levels in neighboring pixels. That is, gray-levels are substituted by their ordering numbers without additional information. From the results of computer simulation, it is verified that the proposed scheme could be reduced the compression bit rate by up to 44.12%, 18.41% comparing to the entropy coding and conventional ordering scheme respectively. So our scheme can be successfully applied to the application areas that require of losslessness and data compaction.
entropy coding and data packing are the major phases in video coding. The new video coding standard, H.264 Advanced Video coding (H.264/AVC), has adopted Exp-Golomb and Context-Adaptive coding methods to increase data...
详细信息
entropy coding and data packing are the major phases in video coding. The new video coding standard, H.264 Advanced Video coding (H.264/AVC), has adopted Exp-Golomb and Context-Adaptive coding methods to increase data compression ratio. In this paper, we propose hardware architecture of entropy encoding and byte stream data packing engines for the H.264/AVC. Our entropy coding engine, that contains Exp-Golomb and Context-Adaptive Variable Length coding (CAVLC), supports baseline and main profile of the standard. The proposed architecture is implemented using 180nm technology from AMS. The design consumes only 1.56mW at the operating frequency of 100MHz.
This paper presents a novel video coding algorithm which exploits past frame statistics for entropy coding of the gain-shape VQ parameters. A subband transform has been used to decorrelate the motion compensation resi...
详细信息
This paper presents a novel video coding algorithm which exploits past frame statistics for entropy coding of the gain-shape VQ parameters. A subband transform has been used to decorrelate the motion compensation residual in order to overcome the block visibility problem. The vectors with samples from different subbands are quantised using a gain-shape VQ technique which allows effective bit rate control. When compared to the H.261 standard, the proposed algorithm has given higher PSNR values at lower bit rates.
The possibility of using the internal restructuring message items according to the quantitative characteristic to improve the protection of information resources is viewed. Clustering elements in a variety of messages...
详细信息
ISBN:
(纸本)9781509006946
The possibility of using the internal restructuring message items according to the quantitative characteristic to improve the protection of information resources is viewed. Clustering elements in a variety of messages is under consideration. The advantages of internal restructuring the data in comparison with the methods for external restructuring are viewed.
We have found the entropy of digital sources for the typical adaptive pulse code modulation systems and showed that entropy coding provides some gain in comparison with enumeration coding.
We have found the entropy of digital sources for the typical adaptive pulse code modulation systems and showed that entropy coding provides some gain in comparison with enumeration coding.< >
As the Internet and multimedia systems grow in size and popularity, compression and encryption of image and video data are becoming increasingly important. However, independent compression and encryption is too slow f...
详细信息
As the Internet and multimedia systems grow in size and popularity, compression and encryption of image and video data are becoming increasingly important. However, independent compression and encryption is too slow for many multimedia applications. This paper presents a new joint compression and encryption method for images and videos that uses high-order conditional entropy coding of wavelet coefficients to facilitate encryption. As a result, state-of-the-art compression and significantly enhanced security are achieved, with no extra computational complexity.
The most computationally intensive part of wide-band receivers is the IF processing block. Digital filtering is the main task in IF processing. Infinite precision filters require complicated digital circuits due to co...
详细信息
The most computationally intensive part of wide-band receivers is the IF processing block. Digital filtering is the main task in IF processing. Infinite precision filters require complicated digital circuits due to coefficient multiplication. This paper presents an efficient method to implement pulse shaping filters for a dual-mode GSM/W-CDMA receiver. We use an arithmetic scheme, known as pseudo floating-point (PFP) representation to encode the filter coefficients. By employing a span reduction technique, we show that the filters can be coded using an optimal entropy scheme employing PFP which requires only considerably fewer bits than conventional 24-bit and 16-bit fixed-point filters. Simulation results show that the magnitude responses of the filters coded in PFP meet the attenuation requirements of GSM/W-CDMA specifications.
A novel genome sequence entropy coding algorithm based Context modeling is proposed. In this paper, the genome sequence data of bioinformatics features is sliced and reformed into 4 clusters according with biological ...
详细信息
A novel genome sequence entropy coding algorithm based Context modeling is proposed. In this paper, the genome sequence data of bioinformatics features is sliced and reformed into 4 clusters according with biological meanings: the coding sequence cluster, the intron cluster, the RNA cluster and the residual cluster. According to the specific biological characteristics of the sequences in each set were pretreated respectively, then the sequences are compressed with entropy coding algorithm. The experiment shows that it is a good method to deal with the problem that than original DNA compression algorithms of the long DNA sequences, so it can make compression ratio and entropy coding efficient higher.
暂无评论