scispace - formally typeset
Journal ArticleDOI

In-Block Prediction-Based Mixed Lossy and Lossless Reference Frame Recompression for Next-Generation Video Encoding

Reads0
Chats0
TLDR
A novel algorithm, which is called mixed lossy and lossless (MLL) reference frame recompression, is proposed in this paper, which differs from its previous designs and achieves a much higher compression ratio.
Abstract
Frame recompression is an efficient way to reduce the huge bandwidth of external memory for video encoder, especially for P/B frame compression. A novel algorithm, which is called mixed lossy and lossless (MLL) reference frame recompression, is proposed in this paper. The bandwidth reduction comes from two sources in our scheme, which differs from its previous designs and achieves a much higher compression ratio. First, it comes from pixel truncation. We use truncated pixels (PR) for integer motion estimation (IME) and acquire truncated residuals for factional motion estimation (FME) and motion compensation (MC). Because the pixel access of IME is much larger than FME and MC, it saves about 37.5% bandwidth under 3-b truncation. Second, embedded compression of PR helps to further reduce data. The truncated pixels in the first stage greatly help to achieve a higher compression ratio than current designs. From our experiments, 3-b truncated PR can be compressed to 15.4% of the original data size, while most current embedded compressions can only achieve around 50%. For PR compression, two methods are proposed: in-block prediction and small-value optimized variable length coding. With these experiments, the total bandwidth can be reduced to 25.5%. Our proposed MLL is hardware/software friendly and also fast IME algorithm friendly frame recompression scheme. It is more suitable to work together with the data-reuse strategy than the previous schemes, and the video quality degradation is controllable and negligible.

read more

Citations
More filters
Journal ArticleDOI

Lossless Frame Memory Compression Using Pixel-Grain Prediction and Dynamic Order Entropy Coding

TL;DR: A lossless compression algorithm is devised to reduce the external traffic and the memory requirements of reference frames and a partition group table-based storage space reduction scheme is provided to improve the utilization of row buffers in the DRAM.
Journal ArticleDOI

A Hardware-Oriented IME Algorithm for HEVC and Its Hardware Implementation

TL;DR: A hardware-oriented integer ME algorithm and the related hardware implementation are developed that led to a decrease in terms of the Bjontegaard Delta rate and demonstrated that the proposed solution offered desirable improvement in both coding speed and coding performance.
Journal ArticleDOI

Efficient Compression-Based Line Buffer Design for Image/Video Processing Circuits

TL;DR: By restricting variable length coding within small compression granularity (CG), the proposed compression algorithm not only significantly improves compression performance but also meets the specific requirements in line buffer architecture design.
Journal ArticleDOI

Parallel Content-Aware Adaptive Quantization-Oriented Lossy Frame Memory Recompression for HEVC

TL;DR: A content-aware adaptive quantization method is devised to achieve a stable high compression ratio that does not deteriorate for highly quality texture-rich pictures and to solve the low throughput problem caused by the pixel-grain prediction method.
Journal ArticleDOI

Lossless image compression algorithm and hardware architecture for bandwidth reduction of external memory

TL;DR: This study proposes a hardware-oriented lossless image compression algorithm, supporting block and line random access flexibly for adapting diverse hardware video codec architectures, and achieves reducing memory access bandwidth by ~55.2%, which is useful for hardwired video coding.
References
More filters
Journal ArticleDOI

A novel four-step search algorithm for fast block motion estimation

TL;DR: Simulation results show that the proposed 4SS performs better than the well-known three- step search and has similar performance to the new three-step search (N3SS) in terms of motion compensation errors.
Journal ArticleDOI

On the data reuse and memory bandwidth analysis for full-search block-matching VLSI architecture

TL;DR: This work explores the data reuse properties of full-search block-matching for motion estimation (ME) and associated architecture designs, as well as memory bandwidth requirements, and a seven-type classification system is developed that can accommodate most published ME architectures.
Journal ArticleDOI

A fast scheme for image size change in the compressed domain

TL;DR: An algorithm for downsampling and also upsampling in the compressed domain which is computationally much faster, produces visually sharper images, and gives significant improvements in PSNR (typically 4-dB better compared to bilinear interpolation).
Journal ArticleDOI

Analysis and architecture design of variable block-size motion estimation for H.264/AVC

TL;DR: Two hardware architectures are proposed that can support traditional fixed block-size motion estimation as well as VBSME with less chip area overhead compared to previous approaches and an eight-parallel SAD tree with a shared reference buffer for H.264/AVC integer motion estimation is proposed.
Journal ArticleDOI

Low-power VLSI design for motion estimation using adaptive pixel truncation

TL;DR: A novel method of reducing power consumption of the ME by adaptively changing the pixel resolution during the computation of the motion vector is proposed, which results in more than 60% reduction in power consumption.
Related Papers (5)