Low-complexity VBR controller for spatial-CGS and temporal scalable video coding

This paper presents a rate control (RC) algorithm for the scalable extension of the H.264/AVC video coding standard. The proposed rate controller is designed for real-time video streaming with buffer constraint. Since a large buffer delay and bit rate variation are allowed in this kind of applications, our proposal reduces the quantization parameter (QP) fluctuation to provide consistent visual quality bit streams to receivers with a variety of spatio-temporal resolutions and processing capabilities. The low computational cost is another characteristic of the described method, since a simple lookup table is used to regulate the QP variation on a frame basis

Cauchy-Density-Based Basic Unit Layer Rate Controller for H.264/AVC

The rate control problem has been extensively studied in parallel to the development of the different video coding standards. The bit allocation via Cauchy-density-based rate-distortion (R-D) modeling of the discrete cosine transform (DCT) coefficients has proved to be one of the most accurate solution at picture level. Nevertheless, in some specific applications operating in real-time low-delay environments, a basic unit (BU) layer is recommended in order to provide a good trade-off between picture quality and delay control. In this paper, a novel BU bit allocation for H.264/AVC is proposed based on a simplified Cauchy probability density function (PDF) source modeling. The experimental results are twofold: 1) the proposed rate control algorithm (RCA) achieves an average PSNR improvement of 0.28 dB respect to a well known BU layer RCA, while maintaining a similar buffer occupancy evolution; and 2) It achieves to notably reduce the buffer occupancy fluctuations respect to a well known picture layer RCA, while maintaining similar quality levels.Publicad

Joint On-the-Fly Network Coding/Video Quality Adaptation for Real-Time Delivery

This paper introduces a redundancy adaptation algorithm for an on-the-fly erasure network coding scheme called Tetrys in the context of real-time video transmission. The algorithm exploits the relationship between the redundancy ratio used by Tetrys and the gain or loss in encoding bit rate from changing a video quality parameter called the Quantization Parameter (QP). Our evaluations show that with equal or less bandwidth occupation, the video protected by Tetrys with redundancy adaptation algorithm obtains a PSNR gain up to or more 4 dB compared to the video without Tetrys protection. We demonstrate that the Tetrys redundancy adaptation algorithm performs well with the variations of both loss pattern and delay induced by the networks. We also show that Tetrys with the redundancy adaptation algorithm outperforms FEC with and without redundancy adaptation

A Rate Control Algorthm for Low-Delay H.264 Video Coding with Stored-B Pictures

A rate control (RC) algorithm for H.264 video coding with stored-B (SB) pictures is proposed for low-delay applications. Different models for P and SB pictures are defined for a better QP and MAD estimation. Furthermore, a novel saw-tooth shaped model of target buffer level has also been introduced for a proper bit allocation in GOP structures with SB pictures. Our experimental results show that this proposal outperforms the reference software RC in terms of buffer occupancy and target bit rate adjustment at the expense of slight quality reduction.Publicad

Distributed video coding for wireless video sensor networks: a review of the state-of-the-art architectures

Distributed video coding (DVC) is a relatively new video coding architecture originated from two fundamental theorems namely, Slepian–Wolf and Wyner–Ziv. Recent research developments have made DVC attractive for applications in the emerging domain of wireless video sensor networks (WVSNs). This paper reviews the state-of-the-art DVC architectures with a focus on understanding their opportunities and gaps in addressing the operational requirements and application needs of WVSNs

Real-time complexity constrained encoding

Complex software appliances can be deployed on hardware with limited available computational resources. This computational boundary puts an additional constraint on software applications. This can be an issue for real-time applications with a fixed time constraint such as low delay video encoding. In the context of High Efficiency Video Coding (HEVC), a limited number of publications have focused on controlling the complexity of an HEVC video encoder. In this paper, a technique is proposed to control complexity by deciding between 2Nx2N merge mode and full encoding, at different Coding Unit (CU) depths. The technique is demonstrated in two encoders. The results demonstrate fast convergence to a given complexity threshold, and a limited loss in rate-distortion performance (on average 2.84% Bjontegaard delta rate for 40% complexity reduction)