• Title/Summary/Keyword: MPEG compressed video

Search Result 136, Processing Time 0.02 seconds

Motion Vector Recovery Based on Optical Flow for Error Concealment (전송 오류를 은닉하기 위한 옵티컬 플로우 기반의 움직임 벡터 복원)

  • Suh, Jae-Won;Ho, Yo-Sung
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.6
    • /
    • pp.630-640
    • /
    • 2002
  • The compressed video bitstream is very sensitive to transmission errors. If we lost packet or received with errors during the transmission, not only the current frame will be corrupted, but also errors will propagate to succeeding frames. Error concealment is a data recovery technique that enables the decoder to conceal effects of transmission errors by predicting the lost or corrupted video data from the previously reconstructed error free information. Motion vection recovery and motion compensation with the estimated motion vector is a good approach to conceal the corrupted macroblock data. In this paper, we prove that it is reasonable to use the estimated motion vector to conceal the lost macroblock by providing macroblock distortion models. After we propose a new motion vector recovery algorithm based on optical flow fields, we compare its performance to those of conventional error concealment methods. The proposed algorithm has smaller computational complexity than those of conventional algorithms.

Multi-View Video System using Single Encoder and Decoder (단일 엔코더 및 디코더를 이용하는 다시점 비디오 시스템)

  • Kim Hak-Soo;Kim Yoon;Kim Man-Bae
    • Journal of Broadcast Engineering
    • /
    • v.11 no.1 s.30
    • /
    • pp.116-129
    • /
    • 2006
  • The progress of data transmission technology through the Internet has spread a variety of realistic contents. One of such contents is multi-view video that is acquired from multiple camera sensors. In general, the multi-view video processing requires encoders and decoders as many as the number of cameras, and thus the processing complexity results in difficulties of practical implementation. To solve for this problem, this paper considers a simple multi-view system utilizing a single encoder and a single decoder. In the encoder side, input multi-view YUV sequences are combined on GOP units by a video mixer. Then, the mixed sequence is compressed by a single H.264/AVC encoder. The decoding is composed of a single decoder and a scheduler controling the decoding process. The goal of the scheduler is to assign approximately identical number of decoded frames to each view sequence by estimating the decoder utilization of a Gap and subsequently applying frame skip algorithms. Furthermore, in the frame skip, efficient frame selection algorithms are studied for H.264/AVC baseline and main profiles based upon a cost function that is related to perceived video quality. Our proposed method has been performed on various multi-view test sequences adopted by MPEG 3DAV. Experimental results show that approximately identical decoder utilization is achieved for each view sequence so that each view sequence is fairly displayed. As well, the performance of the proposed method is examined in terms of bit-rate and PSNR using a rate-distortion curve.

Design of Hardwired Variable Length Decoder for H.264/AVC (하드웨어 구조의 H.264/AVC 가변길이 복호기 설계)

  • Yu, Yong-Hoon;Lee, Chan-Ho
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.45 no.11
    • /
    • pp.71-76
    • /
    • 2008
  • H.264(or MPEG-4/AVC pt.10) is a high performance video coding standard, and is widely used. Variable length code (VLC) of the H.264 standard compresses data using the statistical distribution of values. A decoder parses the compressed bit stream and searches decoded values in lookup tables, and the decoding process is not easy to implement by hardware. We propose an architecture of variable length decoder(VLD) for the H.264 baseline profile(BP) L4. The CAVLD decodes syntax elements using the combination of arithmetic units and lookup tables for the optimized hardware architecture. A barral shifter and a first 1's detector parse NAL bit stream, and are shared by Exp-Golomb decoder and CAVLD. A FIFO memory between CAVLD and the reorder unit and a buffer at the output of the reorder unit eliminate the bottleneck of data stream. The proposed VLD is designed using Verilog-HDL and is implemented using an FPGA. The synthesis result using a 0.18um standard CMOS technology shows that the gate count is 22,604 and the decoder can process HD($1920{\times}1080$) video at 120MHz.

An Admission Control Mechanism to guarantee QoS of Streaming Service in WLAN (WLAN에서 스트리밍 서비스의 QoS를 보장하기 위한 승인 제어 기술)

  • Kang, Seok-Won;Lee, Hyun-Jin;Lee, Kyu-Hwan;Kim, Jae-Hyun;Roh, Byeong-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.6B
    • /
    • pp.595-604
    • /
    • 2009
  • The HCCA reserves the channel resources based on the mean data rate in IEEE 802.11e. It may cause either the waste of channel resource or the increase of transmission delay at MAC layer if the frame size is rapidly varied when a compressed mode video codec such as MPEG video is used. To solve these problems, it is developed that the packet scheduler allocates the wireless resource adaptation by according to the packet size. However, it is difficult to perform the admission control because of the difficulty with calculating the available resources. In this paper, we propose a CAC mechanism to solve the problem that may not satisfy the QoS by increasing traffic load in case of using EDCA. Especially, the proposed CAC mechanism calculates the EB of TSs using the traffic information transmitted by the application layer and the number of average transmission according to the wireless channel environment, and then determines the admission of the TS based on the EB. According to the simulation results of the proposed CAC mechanism, it admitted the TSs under the loads which are satisfied within the delay bound. Therefore, the proposed mechanism guarantees QoS of streaming services effectively.

A Buffer Management Algorithm based on the GOP Pattern and the Importance of each Frame to Provide QoS for Streaming Services in WLAN (WLAN에서 스트리밍 서비스이 QoS를 제공하기 위한 GOP 패턴 및 프레임 중요도에 따른 버퍼 관리 기술)

  • Kim, Jae-Hyun;Lee, Hyun-Jin;Lee, Kyu-Hwan;Roh, Byeong-Hee
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2008.08a
    • /
    • pp.372-375
    • /
    • 2008
  • IEEE 802.11e standardized the EDCA mechanism to support the priority based QoS. And the virtual collision handler schedules the transmission time of each MAC frame using the internal back-off window according to the access category(AC). This can provides the differentiated QoS to real-time services at the medium traffic load condition. However, the transmission delay of MAC frame for real-time services may be increased as the traffic load of best effort service increases. It becomes more critical when the real-time service uses a compressed mode video codec such as moving picture experts group(MPEG) 4 codec. That is because each frame has the different importance. That is, the I-frame has more information as compared with the P- and the B-frame. In this paper, we proposed a buffer management algorithm based on the frame importance and the delay bound. The proposed algorithm is consisted of the traffic regulator based on the dual token bucket algorithm and the active queue management algorithm. The traffic regulator reduces the transmission rate of lower AC until that the virtual collision handler can transmit an I-frame. And the active queue management discards frame based on the importance of each frame and the delay bound of head of line(HoL) frame when the channel resource is insufficient.

  • PDF

A Blind Watermarking Algorithm using CABAC for H.264/AVC Main Profile (H.264/AVC Main Profile을 위한 CABAC-기반의 블라인드 워터마킹 알고리즘)

  • Seo, Young-Ho;Choi, Hyun-Jun;Lee, Chang-Yeul;Kim, Dong-Wook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.2C
    • /
    • pp.181-188
    • /
    • 2007
  • This paper proposed a watermark embedding/extracting method using CABAC(Context-based Adaptive Binary Arithmetic Coding) which is the entropy encoder for the main profile of MPEG-4 Part 10 H.264/AVC. This algorithm selects the blocks and the coefficients in a block on the bases of the contexts extracted from the relationship to the adjacent blocks and coefficients. A watermark bit is embedded without any modification of coefficient or with replacing the LSB(Least Significant Bit) of the coefficient with a watermark bit by considering both the absolute value of the selected coefficient and the watermark bit. Therefore, it makes it hard for an attacker to find out the watermarked locations. By selecting a few coefficients near the DC coefficient according to the contexts, this algorithm satisfies the robustness requirement. From the results from experiments with various kinds and various strengths of attacks the maximum error ratio of the extracted watermark was 5.02% in maximum, which makes certain that the proposed algorithm has very high level of robustness. Because it embeds the watermark during the context modeling and binarization process of CABAC, the additional amount of calculation for locating and selecting the coefficients to embed watermark is very small. Consequently, it is highly expected that it is very useful in the application area that the video must be compressed right after acquisition.