Robust error concealment algorithm for video decoder (original) (raw)

Error detection and concealment for video transmission using information hiding

Signal Processing: Image Communication, 2008

Video transmission over noisy channels makes error concealment an indispensable job. Utilization of data hiding for this problem provides a reserve information about the content at the receiver, while unchanging the transmitted bit-stream syntax; hence, improves the reconstructed video quality with almost no extra channel utilization. A spatial domain error concealment technique, which hides edge orientation information of a block, and a resynchronization technique, which embeds bit-length of a block into other blocks are composed. The proposed method also exploits these two techniques for detecting errors via some extra parity information. Moreover, the motion vectors between consecutive frames are also embedded into the consecutive frames for better concealment at the receiver. Finally, as a novel approach, the bit-streams are further protected against errors via channel codes and the parity bits of these codes are embedded into other slices. In this manner, implicit utilization of error correction codes improves the reconstruction quality significantly. The simulation results show that the proposed approaches perform quite promising for concealing the errors in any compressed video bitstream.

Compressed image error concealment and post-processing for digital video recording

Proceedings of APCCAS'94 - 1994 Asia Pacific Conference on Circuits and Systems, 1994

The recently developed MPEG video compression standards can compress motion pictures very efficiently; however, the compressed data are rather sensitive t o channel noise. We therefore propose a robust decoder that can tolerate errors. Particularly, a two-priority coding scheme is suggested to increase the overall performance. This priority assignment can also be used to implement the trick playback mode for DVCR system. Moreover, an error concealment algorithm is proposed Lo compensate the cell loss effect due to random noise. Finally, the image artifacts due to undetected errors and/or imperfect error concealment can be reduced by a properly designed postprocessing scheme. As shown by simulations, damaged video sequences can be recovered almost free from visible artifact. Our study is different from the previous approaches in that we design a complete decoder system and the system is simulated in an environment that is close t o reality.

New Hybrid Error Concealment for Digital Compressed Video

EURASIP Journal on Advances in Signal Processing, 2005

Transmission of a compressed video signal over a lossy communication network exposes the information to losses and errors, which leads to significant visible errors in the reconstructed frames at the decoder side. In this paper we present a new hybrid error concealment algorithm for compressed video sequences, based on temporal and spatial concealment methods. We describe spatial and temporal techniques for the recovery of lost blocks. In particular, we develop postprocessing techniques for the reconstruction of missing or damaged macroblocks. A new decision support tree is developed to efficiently choose the best appropriate error concealment method, according to the spatial and temporal characteristics of the sequence. The proposed algorithm is compared to three error concealment methods: spatial, temporal, and a previous hybrid approach using different noise levels. The results are evaluated using four quality measures. We show that our error concealment scheme outperforms all the other three methods for all the tested video sequences.

Error concealment algorithms for compressed video

1999

In this paper we propose an error concealment algorithm for compressed video sequences. For packetization and transmission, a two layer ATM is utilized so that the location of information loss is easily detected. The coded image can be degraded due to channel error, network congestion, and switching system problems. Seriously degraded images may therefore result due to information loss represented by DCT coefficients and motion vectors, and due to the inter-dependency of information in predictive coding.

An error concealment scheme for MPEG-2 coded video sequences

Proceedings of 1997 IEEE International Symposium on Circuits and Systems. Circuits and Systems in the Information Age ISCAS '97, 1997

Abstract| The problem of errors occurring in MPEG-2 coded video sequences, caused by signal loss during transmission, is examined in this paper and an attempt is made to reconstruct the lost parts at each frame. The proposed error concealment scheme exploits reconstructed temporal information from previously decoded frames in order to conceal bitstream errors in all types of frames: I, P, or B, as long as temporal information is available. Since no such information is available for the rst frame (I-frame) of an MPEG-2 coded sequence, another concealment technique is added to the proposed scheme, which uses spatial information from neighbouring macroblocks (MBs). The simulation results compared with other methods prove to be better judging from both P SN R values and the perceived visual quality of the reconstructed sequence. Its quality ameliorates with time.

A hybrid error concealment scheme for MPEG2 video transmission based on best neighborhood matching algorithm

2004

For entropy-coded MPEG-2 video frames, a transmission error will not only affect the underlying codeword but also may affect subsequent codewords, resulting in a great degradation of the received video frames. In this study, a hybrid error concealment scheme for MPEG-2 video transmission is proposed. The objective is to recover high-quality MPEG-2 video frames from the corresponding corrupted video frames, without increasing the transmission bit rate. In this study, transmission errors or equivalently corrupted/lost video packets in MPEG-2 video frames are detected and located by the error detection scheme proposed by Shyu and Leou [IEEE Trans. Circuits Syst. Video Technol. 10 , and then the corrupted blocks are concealed by the proposed hybrid error concealment scheme. Based on the fitness function for evaluating the candidate concealed blocks of a corrupted block, a corrupted block in an intra-coded I frame is concealed by either the spatial error concealment algorithm in H.264 or the proposed fast best neighborhood matching (BNM) algorithm. A corrupted block in an inter-coded P or B frame is concealed by the proposed fast motioncompensated BNM algorithm. Based on the simulation results obtained in this study, the proposed scheme can recover high-quality MPEG-2 video frames from the corresponding www.elsevier.com/locate/jvci (J.-J. Leou). corrupted video frames up to a packet loss rate of 20%. The performance of the proposed scheme is better than those of four existing approaches for comparison.

An Efficient Adaptive Boundary Matching Algorithm for Video Error Concealment

Sending compressed video data in error-prone environments (like the Internet and wireless networks) might cause data degradation. Error concealment techniques try to conceal the received data in the decoder side. In this paper, an adaptive boundary matching algorithm is presented for recovering the damaged Motion Vectors (MVs). This algorithm uses an outer boundary matching or directional temporal boundary matching method to compare every boundary of candidate Macro-Blocks (MBs), adaptively. It gives a specific weight according to the accuracy of each boundary of the damaged MB. Moreover, if each of the adjacent MBs is already concealed, different weights are given to the boundaries. Finally, the MV with minimum adaptive boundary distortion is selected as the MV of the damaged MB. Experimental results show that the proposed algorithm can improve both objective and subjective quality of reconstructed frames without any considerable computational complexity. The average PSNR in some frames of test sequences increases about 5.20, 5.78, 5.88, 4.37, 4.41, and 3.50 dB compared to average MV, classic boundary matching, directional boundary matching, directional temporal boundary matching, outer boundary matching, and dynamical temporal error concealment algorithm, respectively.

A new hybrid error concealment scheme for MPEG2 video transmission

2002

For entropy-coded MPEG-2 video frames, a transmission error will not only affect the underlying codeword but also may affect subsequent codewords, resulting in a great degradation of the received video frames. In this study, transmission errors in MPEG-2 video frames are first detected and located by the error detection scheme proposed by Shyu and Leou [1999], and then the corrupted blocks are concealed by the proposed hybrid error concealment scheme. Based on the condition of a corrupted block, a corrupted block in an intracoded I frame is concealed by either the spatial error concealment algorithm in H.26L test model long-term number 9 (TML-9) or the best neighborhood matching (BNM) algorithm followed by the proposed modified spatial anisotropic diffusion (SD) algorithm. A corrupted block in an inter-coded P or B frame is concealed by the proposed motion-compensated BNM algorithm. Based on the simulation results obtained in this study, the proposed scheme can recover high-quality MPEG-2 video frames from the corresponding corrupted video frames up to a bit error rate of 0.5%.

A novel selective motion vector matching algorithm for error concealment in MPEG-4 video transmission over error-prone channels

IEEE Transactions on Consumer Electronics, 2003

The performance of MPEG-4 video transmission over error-prone channels is limited by the channel noise. Error concealment is an effective method to combat these channel errors. In MPEG-4 video coding, motion vectors (MVs) are highly significant for the matching of the missing video block. Thus how to recover the lost MV is an important issue for error concealment in MPEG-4 video communications. Concerning the high block loss ratio (BLR) during video transmission and the matching of edge blocks in video frames, we propose the selective motion vector matching (SMVM) algorithm for MV recovery. It incorporates the status flags of the neighboring pixels of the missing block and constructs new MV sets for block matching. Experimental results show that it is highly effective and significantly outperforms other existing MV recovery methods for error concealment at different BLRs. 1