• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.2
• /
• pp.31-39
• /
• 2003

The MPEG-2 source coding algorithm is very sensitive to transmission errors due to using of variable-length coding. When the compressed data are transmitted, transmission errors are generated and error correction scheme is not able to be corrected well them. In the decoder error concealment (EC) techniques must be used to conceal errors and it is able to minimize degradation of video quality. The proposed algorithm is method to conceal successive macroblock errors of I-frame and utilize temporal information of B-frame and spatial information of P-frame In the previous GOP which is temporally the nearest location to I-frame. This method can improve motion distortion and blurring by temporal and spatial errors which cause at existing error concealment techniques. In network where the violent transmission errors occur, we can conceal more efficiently severe slice errors. This algorithm is Peformed in MPEG-2 video codec and Prove that we can conceal efficiently slice errors of I-frame compared with other approaches by simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.2C
• /
• pp.49-58
• /
• 2005

For the improvement of coding efficiency, the H.264 standard uses new coding tools. Using these coding tools, H.264 has achieved significant improvements from rate-distortion point of view. The adoption of these tools enables a macroblock in H.264 to have more information, sixteen motion vectors, four reference frames and a macroblock mode. In this paper, we present an efficient temporal error concealment algorithm by using not only motion vectors and reference frames but also macroblock mode of neighbor macroblocks. Our algorithm conceals the macroblock error with variable sizes, $16{\times}16,\;16{\times}8,\;8{\times}16,\;8{\times}8$ depending on the macroblock modes of neighbor macroblocks. Simulation results show that the proposed method increase the objective quality regardless of bit-rate and block error rate.

• Journal of Broadcast Engineering
• /
• v.20 no.4
• /
• pp.533-544
• /
• 2015

Recently, most of the video services are usually transmitted in wireless networks. In networks environment, a packet of video is likely to be lost during transmission. For this reason, this paper proposes a new Error Concealment (EC) algorithm. For High Efficiency Video Coding (HEVC) bitstreams, the proposed algorithm includes Adaptive Prediction Unit-based Motion Vector Extrapolation (APMVE) and Boundary Matching (BM) algorithm, which employs both the temporal and spatial correlation. APMVE adaptively decides a Error Concealment Basic Unit (ECBU) by using the PU information of the previous frame and BM employing the spatial correlation is applied to only unreliable blocks. Simulation results show that the proposed algorithm provides the higher subjective quality by reducing blocking artifacts which appear in other existing algorithms.

• Journal of Korea Multimedia Society
• /
• v.12 no.11
• /
• pp.1563-1571
• /
• 2009

In this paper, we propose a new boundary matching method for the temporal error concealment and a post processing algorithm for perceptual quality improvement of the concealed frame. Temporal error concealment is a method that substitutes error blocks with similar blocks from the reference frame. In conventional H.264/AVC standard, it compares outside pixels of erroneous block with inside pixels of reference block to find the most similar block. However, it is very possible that the conventional method substitutes erroneous block with the wrong one because it compares only narrow spatial range of pixels. In this paper, for substituting erroneous blocks with more correct blocks, we propose enhanced boundary matching method by comparing inside and outside pixels of reference block with outside pixels of erroneous block and setting up additional candidate motion vector in the fixed search range based on maximum and minimum value of candidate motion vectors. Furthermore, we propose a post processing method to smooth edges between concealed and decoded blocks without error by using the modified deblocking filter. We identified that the proposed method shows quality improvement of about 0.9dB over the conventional boundary matching methods.

• Journal of Advanced Navigation Technology
• /
• v.11 no.4
• /
• pp.485-492
• /
• 2007

In this paper, we propose the receiver block error detection of the video codec and the image concealment algorithm using fuzzy inference. The proposed error detection and concealment algorithm gets SSD(Summation of Squared Difference) and BMC(Boundary Matching Coefficient) using the temporal and spatial similarity between corresponded blocks in the two successive frames. Proportional constant, ${\alpha}$, for threshold value, TH1 and TH2, is decided after fuzzy data is generated by each parameter. To examine the propriety of the proposed algorithm, random errors are inserted into the QCIF Susie standard image, then the error detection and concealment performance is simulated. To evaluate the efficiency of the algorithm, image quality is evaluated by PSNR for the error detection and concealed image by the existing VLC table and by the proposed method. In the experimental results, the error detection algorithm could detect all of the inserted error, the image quality is improved over 15dB after the error concealment compare to existing error detection algorithm.

• The KIPS Transactions:PartB
• /
• v.11B no.6
• /
• pp.661-666
• /
• 2004

In the wireless communication systems, transmission errors degrade the reconstructed image quality severely. Error concealment in video communication is becoming increasingly important because transmission errors can cause single or multiple loss of macroblocks in video delivery over unreliable channels such as wireless networks and internet. Among various techniques which can reduce the degradation of video quality, the error concealment techniques yield good performance without overheads and the modification of the encoder. In this paper, lost image blocks can be concealed with the OBMC(Overlapped Block Motion Compensation) after new motion vectors of the lost image blocks are allocated by median values using the adaptive selection with motion vectors of adjacent blocks. We know our algorithm is more effective in case of continuous GOB loss. The results show a significant improvement over the zero motion error concealment and other temporal concealment methods such as Motion Vector Rational Interpolation or Median＋OBMC by 3dB gain in PSNR.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.341-344
• /
• 2007

In this paper, a new temporal error concealment method for the new coding standard H.264/AVC is presented, which uses the high correlation between the motion vectors of neighboring blocks. By using the motion vector of neighboring MB of the lost MB, the MV of the lost MB are recovered. It is shown that under FMO coding method of H.264/AVC, the proposed method increases PSNR gain up to 2.85dB compared to build-in algorithm in the H.264/AVC test model and 2.59dB compared to Lagrange interpolation.

• ETRI Journal
• /
• v.31 no.1
• /
• pp.21-30
• /
• 2009

In low bit-rate video transmission, the payload of a single packet can often contain a whole coded frame due to the high compression ratio in both spatial and temporal domains of most modern video coders. Thus, the loss of a single packet not only causes the loss of a whole frame, but also produces error propagation into subsequent frames. In this paper, we propose a novel whole frame error concealment algorithm which reconstructs the first of the subsequent frames instead of the current lost frame to suppress the effects of error propagation. In the proposed algorithm, we impose a constraint which uses side match distortion (SMD) and overlapped region difference (ORD) to estimate motion vectors between the target reconstructed frame and its reference frame. SMD measures the spatial smoothness connection between a block and its neighboring blocks. ORD is defined as the difference between the correlated pixels which are predicted from one reference pixel. Experimental results show that the proposed algorithm effectively suppresses error propagation and significantly outperforms other conventional techniques in terms of both peak signal-to-noise ratio performance and subjective visual quality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.8C
• /
• pp.777-785
• /
• 2006

H.264 is the prominent video coding standard in various applications such as real-time video streaming and digital multimedia broadcasting, since it provides enhanced compression performance, error resilience tools, and network adaptation. Since compressed video stream is vulnerable to packet loss, error resilience and error concealment(EC) tools are essential for the transmission of video over the Internet. In this paper, we first propose a simple temporal EC method that improves the EC performance for intra-frame in H.264 when the amount of motion is relatively small. Then we propose a new hybrid EC method for intra-frame in H.264, which combines the spatial EC and temporal EC adaptively. The simulations are performed in packet-lossy environments, and the proposed hybrid EC method shows about 0.5-4dB PSNR improvement compared to the conventional spatial EC method that is used for intra-frame in H.264.

• The KIPS Transactions:PartB
• /
• v.12B no.7 s.103
• /
• pp.755-760
• /
• 2005

To transmit a video bit stream over low bandwith, such as mobile, channels, encoding algorithms for high bit rate like H.263+ are used. In transmitting video bit-streams, packet losses cause severe degradation in image quality. This paper proposes a new algorithm for the recovery of missing or erroneous motion vectors when H.263+ bit-stream is transmitted. Considering that the missing or erroneous motion vectors are closely related with those of neighboring blocks, this paper proposes a temporal-spatial error concealment algorithm. The proposed approach is that missing or erroneous Motion Vectors(MVs) are recovered by clustering the movements of neighboring blocks by their homogeneity. MVs of neighboring blocks we clustered according to ALA(Average Linkage Algorithm) clustering and a representative value for each cluster is determined to obtain the candidate MV set. By computing the distortion of the candidates, a MV with the minimum distortion is selected. Experimental results show that the proposed algorithm exhibits better performance in subjective and objective evaluation than existing methods.