• Title/Summary/Keyword: Resynchronization Marker

Search Result 3, Processing Time 0.02 seconds

Error Resilient Performance Evaluation of MPEG-4 and H.264/AVC (MPEG-4 와 H.264/AVC의 에러 강인 기술 성능 평가)

  • 정봉수;황영휘;전병우;김명돈;최송인
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.5
    • /
    • pp.203-216
    • /
    • 2004
  • Recent advances in video coding technology have resulted in rapid growth of application in mobile communication, With this explosive growth reliable transmission and error resilient technique become increasingly necessary to offer high quality multimedia service. In this paper, we present the result of our investigation on the error resilient performance evaluation of the MPEG-4 simple profile under the H.324/M and the H.264/AVC baseline under the IP packet networks. Especially, we have tested error resilient tools of MPEG-4 simple profile such as resynchronization marker insertion, data partitioning, and of H.264/AVC baseline such as the flexible macroblock ordering (FMO) scheme. The objective quality of decoded video is measured in terms of rate and PSNR under various random bit and burst error conditions.

An Improvement of Still Image Quality Based on Error Resilient Entropy Coding for Random Error over Wireless Communications (무선 통신상 임의 에러에 대한 에러내성 엔트로피 부호화에 기반한 정지영상의 화질 개선)

  • Kim Jeong-Sig;Lee Keun-Young
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.3 s.309
    • /
    • pp.9-16
    • /
    • 2006
  • Many image and video compression algorithms work by splitting the image into blocks and producing variable-length code bits for each block data. If variable-length code data are transmitted consecutively over error-prone channel without any error protection technique, the receiving decoder cannot decode the stream properly. So the standard image and video compression algorithms insert some redundant information into the stream to provide some protection against channel errors. One of redundancies is resynchronization marker, which enables the decoder to restart the decoding process from a known state in the event of transmission errors, but its usage should be restricted not to consume bandwidth too much. The Error Resilient Entropy Code(EREC) is well blown method which can regain synchronization without any redundant information. It can work with the overall prefix codes, which many image compression methods use. This paper proposes EREREC method to improve FEREC(Fast Error-Resilient Entropy Coding). It first calculates initial searching position according to bit lengths of consecutive blocks. Second, initial offset is decided using statistical distribution of long and short blocks, and initial offset can be adjusted to insure all offset sequence values can be used. The proposed EREREC algorithm can speed up the construction of FEREC slots, and can improve the compressed image quality in the event of transmission errors. The simulation result shows that the quality of transmitted image is enhanced about $0.3{\sim}3.5dB$ compared with the existing FEREC when random channel error happens.

Efficient Local Decoding Using Bit Stream Map for High Resolution Video (비트 스트림 지도를 이용한 고해상도 영상의 효율적인 지역복호화)

  • Park Sungwon;Won Jongwoo;Lee Sunyoung;Kim Wookjoong;Kim Kyuheon;Jang Euee S
    • Journal of Broadcast Engineering
    • /
    • v.9 no.4 s.25
    • /
    • pp.391-401
    • /
    • 2004
  • In this paper, we introduce a novel coding method to efficiently enable spatial random access for high resolution video. In terms of resolution and display size, standard display devices (such as cathode-ray tubes. monitors. PDAs, and LCDs) do not sufficiently support high resolution video such as digital cinema and panoramic video. Currently, users have no choice but to view video at lower resolution as a result of down-sampling, or only a partial region of the video due to display size limitations. Our proposed method. which we call the B-map, represents the set of starting locations of the coded segments in a picture frame. This information, or B-map, is first sent to the decoder prior to the coded data stream of the frame and is then used for fast local decoding. To test our method, we compare our B-map with JPEG tiling and the JPEG Resynchronization marker. Experimental results show that the proposed coding method requires less overhead than existing methods during the same decoding time. The results show promise for future panoramic or digital cinema applications.