A novel video compression scheme that exploits the idea of second-order-residual (SOR) coding is proposed for high-bit-rate video applications in this work. We first study the limitation of today's high performanc...
详细信息
ISBN:
(纸本)9780819479365
A novel video compression scheme that exploits the idea of second-order-residual (SOR) coding is proposed for high-bit-rate video applications in this work. We first study the limitation of today's high performance video coding standard, H.264/AVC, and show that it is not effective in the coding of small image features and variations for high-bit-rate video contents. For low to medium quality video streams, these small image features can be removed by the quantization process. However, when the quantization stepsize becomes small in high-bit-rate video, their existence degrades the rate-distortion coding performance significantly. To address this problem, we propose a coding scheme that decomposes the residual signals into two layers: the first-order-residual (FOR) and the second-order-residual (SOR). The FOR contains low frequency residuals while the SOR contains the high frequency residuals. We adopt the H.264/AVC for the FOR coding and propose two schemes, called SOR-freq and SOR-bp, for the SOR coding. It is shown by experimental results that the proposed FOR/SOR scheme outperforms H.264/AVC by a significant margin (with about 20% bit rate saving) in high-bit-rate video.
We present and evaluate a new multiple-description coding extension to the international standard for pulse code modulation speech coding (ITU-T Rec. G.711). This extension is inserted between the G.711 encoder and de...
详细信息
ISBN:
(纸本)9781424456383
We present and evaluate a new multiple-description coding extension to the international standard for pulse code modulation speech coding (ITU-T Rec. G.711). This extension is inserted between the G.711 encoder and decoder. It uses speech-polarity decomposition to spread the speech signal across two channels thus increasing robustness to channel losses. When both channels deliver their payloads the extension becomes transparent and bit-exact G.711 speech samples are produced-there is no quality penalty. Due to low inter-channel redundancy, block coding, and entropy coding, the average total speech payload bit-rate is no greater than the 64 kbps rate of conventional G.711-there is no rate penalty. When either channel fails to deliver, the remaining channel still produces intelligible speech with moderately reduced quality thanks to a compressed sine-pulse fill-in algorithm. We are not aware of any other viable multiple-description coding extension that simultaneously meets the opposing goals of no quality penalty and no rate penalty.
entropy coding based on k-th order Exp-Golomb (EGk) codes is a key part in the new AVS video coding standard issued by Audio Video coding Standard Workgroup of China. An efficient design based on code-value compact me...
详细信息
ISBN:
(纸本)9780780397361
entropy coding based on k-th order Exp-Golomb (EGk) codes is a key part in the new AVS video coding standard issued by Audio Video coding Standard Workgroup of China. An efficient design based on code-value compact memory structure (CVCMS) is proposed to reduce the computational complexity and memory requirement. Only 789 byte memory is required for variable length coding (VLC) tables in CVCMS, which is just about 5.92% compared with that of the reference software. Furthermore, code-value is stored in memory, which reduced the computational complexity of EGk coding. The simulation results show that the proposed entropy coding for AVS video coding standard reduces the computational cost by 26.48%.
This paper proposes an efficient H.264/AVC entropy *** requires no ROM/RAM fabrication process that decreases fabrication cost and increases operation *** was achieved by optimizing lookup tables and internal buffers,...
详细信息
This paper proposes an efficient H.264/AVC entropy *** requires no ROM/RAM fabrication process that decreases fabrication cost and increases operation *** was achieved by optimizing lookup tables and internal buffers,which significantly improves area,speed,and *** proposed entropy decoder does not exploit embedded processor for bitstream manipulation, which also improves area,speed,and *** gate counts and maximum operation frequency are 77515 gates and 175MHz in 0.18um fabrication process,*** proposed entropy decoder needs 2303 cycles in average for one macroblock *** can run at 28MHz to meet the real-time processing requirement for CIF format video decoding on mobile applications.
In this paper, we briefly introduce the AVS-M, including its system structure, coding tools, and so on. And then, we analyze in detail the main program flow from three functions: Main(), Encode_I_Frame() and Encode_P_...
详细信息
ISBN:
(纸本)9781424451623;9781424451616
In this paper, we briefly introduce the AVS-M, including its system structure, coding tools, and so on. And then, we analyze in detail the main program flow from three functions: Main(), Encode_I_Frame() and Encode_P_Frame(). The results of the analysis are very important for us to understand the coding of AVS-M.
In this paper, we explore the use of LDPC codes for nonuniform sources under distributed source coding paradigm. Our analysis reveals that several capacity approaching LDPC codes indeed do approach the Slepian-Wolf bo...
详细信息
ISBN:
(纸本)9781424464258;9780769539942
In this paper, we explore the use of LDPC codes for nonuniform sources under distributed source coding paradigm. Our analysis reveals that several capacity approaching LDPC codes indeed do approach the Slepian-Wolf bound for nonuniform sources as well. The Monte Carlo simulation results show that highly biased sources can be compressed to 0.049 bits/sample away from Slepian-Wolf bound for moderate block lengths.
In this paper we present new models for rate-distortion curves for entropy coded lattice codevectors. Exact models for both the rate and the distortion are proposed for the lattice Z_(n) for generalized Gaussian sourc...
详细信息
ISBN:
(纸本)9781424442959
In this paper we present new models for rate-distortion curves for entropy coded lattice codevectors. Exact models for both the rate and the distortion are proposed for the lattice Z_(n) for generalized Gaussian sources. The resulting precision with respect to experimental values is improved by 50percent over previously proposed models. In addition an approximate model for general lattices is proposed for Gaussian sources, its precision being verified against experimental values and shown to improve the estimation precision from 10percent to 4percent.
In frame memory recompression, decompression latency consists of two components, i.e., memory access cycles for compressed data fetch, and decompression time. Compared to most earlier works which mainly focused on the...
详细信息
In frame memory recompression, decompression latency consists of two components, i.e., memory access cycles for compressed data fetch, and decompression time. Compared to most earlier works which mainly focused on the compression ratio and, therefore, only reducing memory access cycles, this paper proposes a low-latency variable-length coding method called non-zero bit selection scheme (NBS). The proposed NBS enables highly parallel decompression achieving a three-cycle decompression for an 8×8 block, compared to previous methods requiring as many as twelve clock cycles for the case of exponential Golomb code. It is notable that the proposed NBS scheme has achieved this without deterioration of the compression ratio. Experimental result on a number of full HD videos shows that the compression ratio of the proposed method is at least not worse than that obtained with the exponential Golomb code on the average, while reducing the decompression time to 25% compared to the exponential Golomb code.
In conventional video coding, transforms such as DCT have been playing a crucial role by providing good data compaction for further compression with quantization and entropy coding. Traditionally, transformed coeffici...
详细信息
ISBN:
(纸本)9781424466719
In conventional video coding, transforms such as DCT have been playing a crucial role by providing good data compaction for further compression with quantization and entropy coding. Traditionally, transformed coefficients after quantization are represented with nonzero coefficients and their locations (or patterns) in a block. The compression of coefficient patterns was often done with run-length coding, which is also the case in MPEG-4 AVC/H.264. In this paper, we propose a new method to compress the coefficient patterns adaptively on the frame-basis. In the proposed method, we first categorize all possible coefficient patterns (i.e., 2 16 -1 = 65535 for 4 × 4 transform in AVC) into 16 different classes based on the number of nonzero coefficients in a block. The proposed method exploits the fact that the coefficient patterns have strong correlation depending on the video sequence and quantization parameter. The probability of each coefficient pattern is updated after encoding each frame, which is then used to generate a new variable length code of the pattern for the next frame. Experimental results show that the proposed method can provide up to 9.4% bit saving over MPEG-4 AVC/H.264 baseline profile encoder.
In this paper we are describing some important state-of the-art algorithms used for lossless compression of images. These algorithms are broadly classified as prediction based methods and transform based methods. Moti...
详细信息
ISBN:
(纸本)9781424463473
In this paper we are describing some important state-of the-art algorithms used for lossless compression of images. These algorithms are broadly classified as prediction based methods and transform based methods. Motivation behind this work is to provide a detailed analysis of such algorithms and to give future research direction based on the analysis to the new researchers.
暂无评论