A cell-loss concealment technique for MPEG-2 coded video

Abstract

Audio-visual and other multimedia services are seen as important sources of traffic for future telecommunication networks, including wireless networks. A major drawback with some wireless networks is that they introduce a significant number of transmission errors into the digital bitstream. For video, such errors can have the effect of degrading the quality of service to the point where it is unusable. In this paper, we introduce a technique that allows for the concealment of the impact of these errors. Our work is based on MPEG-2 encoded video transmitted over a wireless network whose data structures are similar to those of asynchronous transfer mode (ATM) networks. Our simulations include the impact of the MPEG-2 systems layer and cover cell-loss rates up to 5%. This is substantially higher than those that have been discussed in the literature up to this time. We demonstrate that our new approach can significantly increase received video quality, but at the cost of a considerable computational overhead. We then extend our technique to allow for higher computational efficiency and demonstrate that a significant quality improvement is still possible.Index Terms-Author: please supply index terms. E-mail: key-words@ieee.org for information.

ContentAdaptive Refined Error Concealment Schemes for H.264/AVC Video Coding

“…Refined temporal concealment (RTC) using weighted boundary match was presented by Xu et al [10], in which a lost MB is divided into four blocks and the set of candidate MVs is increased. To exploit the temporal correlation between frames in the estimation of MV, the decoder motion vector estimation (DMVE) algorithm was proposed in [15]. The outer boundary matching algorithm (OBMA), which is a variant of BMA, was studied in [16] with the conclusion that OBMA performs better than BMA for temporal concealment at the same level of complexity.…”

High performance and low complexity decoding light-weight video coding with motion estimation and mode decision at decoder

“…where PBM(dx,dy), PBM _up_region (dx,dy), and PBM _left_region [19]. BMA is a kind of error concealment method and mainly uses the boundary pixels of loose blocks to find the best matching block in the search range of a reference frame.…”

Video Communications Over Wireless Ad-Hoc Networks Using Source Coding Diversity and Multiple Paths

“…The boundary matching algorithm (BMA) (Lam et al, 1993) is proposed to select the best MV among a set of candidate MVs. Zhang, Arnold & Frater (2000), Tsekeridou & Pitas (2000), Kung et al (2006), Wu et al (2008) presented different block matching techniques that estimate the MV based on the set of surrounding MBs of the lost MB. Salama et al (2000) modeled the motion field as a Markov random field (MRF) and found the maximum a posteriori (MAP) estimate of the lost MV given its neighboring MVs.…”