• IEIE Transactions on Smart Processing and Computing
• /
• v.2 no.2
• /
• pp.86-96
• /
• 2013

VP8, an open web media video format, has recently attractedmuch attention, particularly from major web browser companies, as a video codec for HTML5 on internet due to its good coding efficiency and royalty-free policy. Compared to other video compression schemes such as H.264/AVC, it has several distinctive coding tools that help to ensure good coding efficiency and low decoding complexity. In this paper, we investigate its coding techniques and analyze its rate-distortion (R-D) coding performance as compared to that of H.264/AVC.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4C
• /
• pp.458-471
• /
• 2006

Digital watermarking of multimedia data is a very active research area that has enjoyed a considerable amount of attention in recent years. In this paper, we propose an algorithm for embedding/detecting a fragile watermark in MPEG-4 compressed video domain (Simple and Advance Simple Profiles). The watermark bits are put directly into Huffman VLC-codespace of quantized DCT domain. The advantage of watermark embedding into the compressed domain is the significant savings for a real-time implementation as it does not require a full decoding operation. The watermark embedding does not change the video file size. The algorithm demonstrates high watermarking capacity, thereby providing reliable foolproof authentication. The results of experimental testing demonstrate that watermark embedding preserves the video quality. Watermark detection is performed without using the original video.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1209-1221
• /
• 2010

Three dimensional (3D) video is expected to be an important application for broadcast and IP streaming services. One of the main limitations for the transmission of 3D video over IP networks is network bandwidth mismatch due to the large size of 3D data, which causes fatal decoding errors and mosaic-like damage. This paper presents a novel selective frame discard method to address the problem. The main idea of the proposed method is the symmetrical discard of the two dimensional (2D) video frame and the depth map frame. Also, the frames to be discarded are selected after additional consideration of the playback deadline, the network bandwidth, and the inter-frame dependency relationship within a group of pictures (GOP). It enables the efficient utilization of the network bandwidth and high quality 3D IPTV service. The simulation results demonstrate that the proposed method enhances the media quality of 3D video streaming even in the case of bad network conditions.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1527-1530
• /
• 2002

Video summary is one of the tools which can provide the fast and effective browsing fur a lengthy video. Video summary consists of many key-frames that could be defined differently depending on the video genre it belongs to. Consequently, the video summary constructed by the uniform manner might lead into inadequate result. Therefore, identifying the video genre is the important first step in generating the meaningful video summary. We propose a new method that can classify the genre of the video data in MPEG compressed bit-stream domain. Since the proposed method operates directly on the com- pressed bit-stream without decoding the frame, it has merits such as simple calculation and short processing time. In the proposed method, only the visual information is utilized through the spatial-temporal analysis to classify the video genre. Experiments are done for 6 genres of video: Cartoon, Commercial, Music Video, News, Sports, and Talk Show. Experimental result shows more than 90% of accuracy in genre classification for the well-structured video data such as Talk Show and Sports.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.7
• /
• pp.387-396
• /
• 2004

In this paper, we propose an algorithm that distributes processor time to the tasks decoding encoded frames with a goal maximizing total QoS (quality of services) of video conference system. An encoded frame has such a characteristic that the QoS of recovered frame image also increases as the processor time given for decoding the frame gets to increase. Thus, the quality of decoded image for each frame can be represented as a QoS function of the amount of service time given to decode. In addition, every stream of video conference has close time-dependency between continuous frames belonging to the same stream. Based on the time-dependency and QoS functions, we propose an on-line frame scheduling algorithm which does not schedule all frames in the system but just a few frames while maximizing total QoS of video streams in the conference. The simulation results show that, as the system load gets to increase, the proposed algorithm compared to the existing EDF algorithm can reduce the quality of decoded frame images more smoothly and show the movements of conference attendees more naturally without short cutting.

• Journal of Broadcast Engineering
• /
• v.13 no.4
• /
• pp.516-527
• /
• 2008

This paper introduces a derivation method of both P-SKIP and B-SKIP modes for illumination compensation in the multi-view video coding scheme. In this proposed method, mismatches between IC flag and IC offset in P-SKIP mode are removed, and also computational complexity is far reduced in B-SKIP mode in comparison to a multi-view video coding scheme. In simulation results, proposed method has the almost same coding efficiency in comparison with the referenced coding scheme. However computational complexity in 11m-time decoding process is tremendously reduced, such that the average number of blocks that should be processed in P-SKIP mode is saved in about 7.47%, and the average number of operations per block in B-SKIP mode is saved in about 50.36% and corresponding average decoding time per block is also saved in 46%.

• The KIPS Transactions:PartB
• /
• v.12B no.5 s.101
• /
• pp.607-616
• /
• 2005

Due to the limited resources in thin-client and the large amount of computation for decoding MPEG media, it is not easy to support the QoS stream media to clients. To solve the problems, the terminal servers would be charged for decoding the MPEG media and thin-clients have a role to update only the changed areas in their screen. However, these previous approaches cause severely low video quality. In addition, since servers perform all procedures to decode MPEG media, they are easily saturated even under a small number of clients. In this paper, the sources of the low video duality are investigated in the previous thin-clients' solutions working in wireless and wired environments. From the detailed experiments, an intelligent media player is proposed to achieve the QoS streams by supporting both the enhanced video duality and the audio synchronized with video frames.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.6
• /
• pp.1104-1114
• /
• 2007

Digital video compression technique has played an important role that enables efficient transmission and storage of multimedia data where bandwidth and storage space are limited. The new video coding standard, H.264/AVC, developed by Joint Video Team(JVT) significantly outperforms previous standards in compression performance. Especially, variable length code(VLC) plays a crucial pun in video and image compression applications. H.264/AVC standard adopted Context-based Adaptive Variable Length Coding(CAVLC) as the entropy coding method. CAVLC of H.264/AVC requires a large number of the memory accesses. This is a serious problem for applications such as DMB and video phone service because of the considerable amount of power that is consumed in accessing the memory. In order to overcome this problem in this paper, we propose a variable length technique that implements memory-free coeff_token, level, and run_before decoding based on arithmetic operations and using only 70% of the required memory at total_zero variable length decoding.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.298-300
• /
• 2004

In the decoding process of interframe wavelet coding, the inverse wavelet transform requires huge computational complexity. However, the decoder may need to be used in various devices such as PDAs, notebooks, PCs or set-top Boxes. Therefore, the decoder's complexity should be adapted to the processor's computational power. A decoder designed in accordance with the processor's computational power would provide optimal services for such devices. So, it is natural that the complexity scalability and the low complexity codec are also listed in the requirements for scalable video coding. In this contribution, we develop a method of controlling and lowering the complexity of the spatial wavelet transform while sustaining almost the same coding efficiency as the conventional spatial wavelet transform. In addition, the proposed method may alleviate the ringing effect for certain video data.

• Journal of Broadcast Engineering
• /
• v.7 no.4
• /
• pp.345-354
• /
• 2002

In this paper, we introduce a new scanning method for MPEG-4 AVC based Fine Granular Scalable video coding that can significantly improve the subjective picture quality of a decoded scalable video. The proposed scanning method can guarantee the subjectively improved picture qualify of the decoded scalable video by encoding, transmitting and decoding the visually important region most-preferentially. From the simulation results, it has been found that the proposed scanning method can lead the FGS method to achieve significantly improved picture quality, especially on the region of interests.