Survey of Error Concealment techniques: Research directions and open issues

© 2015 IEEE. Error Concealment (EC) techniques use either spatial, temporal or a combination of both types of information to recover the data lost in transmitted video. In this paper, existing EC techniques are reviewed, which are divided into three categories, namely Intra-frame EC, Inter-frame EC, and Hybrid EC techniques. We first focus on the EC techniques developed for the H.264/AVC standard. The advantages and disadvantages of these EC techniques are summarized with respect to the features in H.264. Then, the EC algorithms are also analyzed. These EC algorithms have been recently adopted in the newly introduced H.265/HEVC standard. A performance comparison between the classic EC techniques developed for H.264 and H.265 is performed in terms of the average PSNR. Lastly, open issues in the EC domain are addressed for future research consideration

Video streaming

B

Frame Interpolation for Cloud-Based Mobile Video Streaming

© 2016 IEEE. Cloud-based High Definition (HD) video streaming is becoming popular day by day. On one hand, it is important for both end users and large storage servers to store their huge amount of data at different locations and servers. On the other hand, it is becoming a big challenge for network service providers to provide reliable connectivity to the network users. There have been many studies over cloud-based video streaming for Quality of Experience (QoE) for services like YouTube. Packet losses and bit errors are very common in transmission networks, which affect the user feedback over cloud-based media services. To cover up packet losses and bit errors, Error Concealment (EC) techniques are usually applied at the decoder/receiver side to estimate the lost information. This paper proposes a time-efficient and quality-oriented EC method. The proposed method considers H.265/HEVC based intra-encoded videos for the estimation of whole intra-frame loss. The main emphasis in the proposed approach is the recovery of Motion Vectors (MVs) of a lost frame in real-time. To boost-up the search process for the lost MVs, a bigger block size and searching in parallel are both considered. The simulation results clearly show that our proposed method outperforms the traditional Block Matching Algorithm (BMA) by approximately 2.5 dB and Frame Copy (FC) by up to 12 dB at a packet loss rate of 1%, 3%, and 5% with different Quantization Parameters (QPs). The computational time of the proposed approach outperforms the BMA by approximately 1788 seconds

On Predictive Coding for Erasure Channels Using a Kalman Framework

We present a new design method for robust low-delay coding of autoregressive (AR) sources for transmission across erasure channels. It is a fundamental rethinking of existing concepts. It considers the encoder a mechanism that produces signal measurements from which the decoder estimates the original signal. The method is based on linear predictive coding and Kalman estimation at the decoder. We employ a novel encoder state-space representation with a linear quantization noise model. The encoder is represented by the Kalman measurement at the decoder. The presented method designs the encoder and decoder offline through an iterative algorithm based on closed-form minimization of the trace of the decoder state error covariance. The design method is shown to provide considerable performance gains, when the transmitted quantized prediction errors are subject to loss, in terms of signal-to-noise ratio (SNR) compared to the same coding framework optimized for no loss. The design method applies to stationary auto-regressive sources of any order. We demonstrate the method in a framework based on a generalized differential pulse code modulation (DPCM) encoder. The presented principles can be applied to more complicated coding systems that incorporate predictive coding as well

Supporting real time video over ATM networks

Includes bibliographical references.In this project, we propose and evaluate an approach to delimit and tag such independent video slice at the ATM layer for early discard. This involves the use of a tag cell differentiated from the rest of the data by its PTI value and a modified tag switch to facilitate the selective discarding of affected cells within each video slice as opposed to dropping of cells at random from multiple video frames

Flow control of real-time unicast multimedia applications in best-effort networks

One of the fastest growing segments of Internet applications are real-time mul- timedia applications, like Voice over Internet Protocol (VoIP). Real-time multimedia applications use the User Datagram Protocol (UDP) as the transport protocol because of the inherent conservative nature of the congestion avoidance schemes of Transmis- sion Control Protocol (TCP). The e®ects of uncontrolled °ows on the Internet have not yet been felt because UDP tra±c frequently constitutes only » 20% of the total Internet tra±c. It is pertinent that real-time multimedia applications become better citizens of the Internet, while at the same time deliver acceptable Quality of Service (QoS). Traditionally, packet losses and the increase in the end-to-end delay experienced by some of the packets characterizes congestion in the network. These two signals have been used to develop most known °ow control schemes. The current research considers the °ow accumulation in the network as the signal for use in °ow control. The most signi¯cant contribution of the current research is to propose novel end- to-end °ow control schemes for unicast real-time multimedia °ows transmitting over best-e®ort networks. These control schemes are based on predictive control of the accumulation signal. The end-to-end control schemes available in the literature are based on reactive control that do not take into account the feedback delay existing between the sender and the receiver nor the forward delay in the °ow dynamics. The performance of the proposed control schemes has been evaluated using the ns-2 simulation environment. The research concludes that active control of hard real- time °ows delivers the same or somewhat better QoS as High Bit Rate (HBR, no control), but with a lower average bit rate. Consequently, it helps reduce bandwidth use of controlled real-time °ows by anywhere between 31:43% to 43:96%. Proposed reactive control schemes deliver good QoS. However, they do not scale up as well as the predictive control schemes. Proposed predictive control schemes are e®ective in delivering good quality QoS while using up less bandwidth than even the reactive con- trol schemes. They scale up well as more real-time multimedia °ows start employing them