• Title/Summary/Keyword: error resiliency

Search Result 3, Processing Time 0.019 seconds

Improved Redundant Picture Coding Using Polyphase Downsampling for H.264

  • Jia, Jie;Choi, Hae-Chul;Kim, Jae-Gon;Kim, Hae-Kwang;Chang, Yilin
    • ETRI Journal
    • /
    • v.29 no.1
    • /
    • pp.18-26
    • /
    • 2007
  • This paper presents an improved redundant picture coding method that efficiently enhances the error resiliency of H.264. The proposed method applies polyphase downsampling to residual blocks obtained from inter prediction and selectively encodes the rearranged residual blocks in the redundant picture coding process. Moreover, a spatial-temporal sample construction method is developed for the redundant coded picture, which further improves the reconstructed picture quality in error prone environments. Simulations based on JM11.0 were run to verify the proposed method on different test sequences in various error prone environments with average packet loss rates of 3%, 5%, 10%, and 20%. Results of the simulations show that the presented method significantly improves the robustness of H.264 to packet loss by 1.6 dB PSNR on average over the conventional redundant picture coding method.

  • PDF

Dynamic Universal Variable Length Coding with Fixed Re-Association Table (고정 재배정 테이블 기반 동적 UVLC 부호화 방법)

  • Choe, Ung-Il;Jeon, Byeong-U;Yu, Guk-Yeol;Cheon, Gang-Uk
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.2
    • /
    • pp.56-68
    • /
    • 2002
  • The Universal Variable Length Coding(UVLC) scheme in H.26L has nice features such as error resiliency and two-way decodability. However, it has lower coding efficiency than the conventional Huffman coding. To improve the coding efficiency of UVLC, we Propose to use a dynamic codeword mapping that changes association between symbols and codewords in order to utilize the statistical characteristics of symbols as much as possible but without losing any features of the UVLC. Both encoder and decoder use the same re-association table, and hence the encoder need not send additional overhead for the re-mapping relationship to the decoder. Simulation results show that without significant change of the current H.26L coding scheme, the proposed method additionally attains up to about 8% and about 5% bit reductions respectively in intra and inter frames over the current H.26L encoding method.

Voting-based Intra Mode Bit Skip Using Pixel Information in Neighbor Blocks (이웃한 블록 내 화소 정보를 이용한 투표 결정 기반의 인트라 예측 모드 부호화 생략 방법)

  • Kim, Ji-Eon;Cho, Hye-Jeong;Jeong, Se-Yoon;Lee, Jin-Ho;Oh, Seoung-Jun
    • Journal of Broadcast Engineering
    • /
    • v.15 no.4
    • /
    • pp.498-512
    • /
    • 2010
  • Intra coding is an indispensable coding tool since it can provide random accessibility as well as error resiliency. However, it is the problem that intra coding has relatively low coding efficiency compared with inter coding in the area of video coding. Even though H.264/AVC has significantly improved the intra coding performance compared with previous video standards, H.264/AVC encoder complexity is significantly increased, which is not suitable for low bit rate interactive services. In this paper, a Voting-based Intra Mode Bit Skip (V-IMBS) scheme is proposed to improve coding efficiency as well as to reduce encoding time complexity using decoder-side prediction. In case that the decoder can determine the same prediction mode as what is chosen by the encoder, the encoder does not send that intra prediction mode; otherwise, the conventional H.264/AVC intra coding is performed. Simulation results reveal a performance increase up to 4.44% overall rate savings and 0.24 dB in peak signal-to-noise ratio while the frame encoding speed of proposed method is about 42.8% better than that of H.264/AVC.