• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.2
• /
• pp.304-309
• /
• 2004

Recently, the needs for multimedia stream such as digital audio and video in the Internet has increased tremendously. Unlike TCP, the UDP protocol, which has been used to transmit streaming traffic thorough the Internet, does not apply any congestion control mechanism to regulate the data flow thorough the shared network And it leads to congestion collapse of the Internet and results in long-term transmission delay. To avoid any adverse effect on the current Internet functionality, a now protocol of modification or addition of some functionality to perform congestion control and to reduce huge transmission delay in transmitting of multimedia stream are in study. TCP-friendly congestion control mechanism is classified into two : one is window-based congestion control scheme using general window management functionalities, the other is rate-based congestion control scheme using TCP modeling equation. In this paper, we propose an algorithm for improving the transmitting rate on a hybrid TCP-friendly congestion control scheme combined with widow-based and late-based congestion control for multimedia stream. And we also simulate the performance of improved TEAR implementation using NS. With He simulation results, we show that the improved TEAR can provide better fairness and lower rate fluctuations than TCP.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.287-292
• /
• 2001

Multimedia service systems should have efficient capacity to serve the growing clients and new data. In the general streaming services, users can endure the small amount of time delay at the beginning of service. But they want to have good quality of service. A streaming server tries to transfer video files to clients from a repository of files in real time. The server must guarantee concurrent and uninterrupted delivery of each video stream requested from clients. To achieve its purpose, many stream servers adopt multi-processors, sufficient memory, and RAID or SAN in their systems. In this paper, we propose a Linux-based parallel media streaming server. It is superior to the other systems in the storing structure, fault-tolerance, and service capacity. Since this system supports the web interlace, users can operate easily through the www. This system uses unique striping policy to distribute multimedia files into the parallel storage nodes. If a service request occurs, each storage node transmits striped files concurrently to the client. Its performance is better than the single media streaming service because of the parallel architecture.

• Journal of KIISE:Information Networking
• /
• v.27 no.2
• /
• pp.109-122
• /
• 2000

As the full-motion videos in MPEG are widely available nowadays, an editor that could easily edit such kind of media data is required to develop various multimedia applications. In order to concatenate and apply a transition effect to two video streams encoded in MPEG, they should be decoded first since there are dependencies in the frames in MPEG-encoded video stream. Since this decode-edit-encode process requires a huge amount of computing/storage resources, a new editing scheme that could apply various transition effects to MPEG video streams directly while keeping the quality of video data is strongly required. This paper proposes a new editing scheme that could apply three transition effects (such as fade-in, fade-out, and dissolve) to MPEG video streams in a compressed domain. In the proposed scheme, an extension of previous method in which the frames are partially decompressed and transition effects are applied is adopted for I- and P-frames. In addition, a new processing scheme for B-frame that could apply the transition effects in DCT domain directly using an approximation of motion compensation based on the motion vector to reference frames. Since this processing scheme could apply the transition effects in a compressed domain directly, the editing process could be speed-up about $3{\sim}4$ times faster than previous decode-edit-encoding method while keeping the quality of video data as good as the source data. The proposed scheme could be used to build a software-only MPEG video editing system that helps to edit MPEG video data even on a low-cost desk-top computer.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.2
• /
• pp.21-28
• /
• 2008

This paper proposes a novel reduced-reference assessment method for video quality assessment, in which one-dimensional (1-D) histograms of motion vectors (MVs) are used as features of videos. The proposed method is more efficient than the conventional methods in view of computation time, because the proposed quality metric decodes MVs directly from video stream in the parsing process instead of reconstructing the distorted video at the receiver. Moreover, in view of data size, the propose method is efficient because a sender transmits 1-D histograms of MVs accumulated over whole input video sequences. Here, we use 1-D histograms of MVs accumulated over the whole video sequences, which is different from the conventional methods that assessed each image independently. For testing the similarity between histograms, we use histogram intersection and histogram difference methods. We compare the proposed method with the conventional methods for 52 video clips, which are coded under varying bit rate, image size, and frame rate. Experimental results show that the proposed method is more efficient than the conventional methods and that the proposed method is more similar to the mean opinion score (MOS) than conventional algorithms.

• Journal of Korea Multimedia Society
• /
• v.3 no.5
• /
• pp.479-494
• /
• 2000

Although the proliferation of real-time multimedia services over the Internet might indicate its successfulness in dealing with heterogeneous environments, it is obvious, on the other hand, that the internet now has to cope with a flood of multimedia data which consumes most of network communication channels due to a great deal of video or audio streams. Therefore, for the purpose of an efficient and appropriate utilization of network resources, it requires to develop and deploy a new scalable transmission technique n consideration of respective network environment and individual clients computing power. Also, we can eliminate the waste effects of storage device and data transmission overhead in that the same video stream duplicated according to QoS. The purpose of this paper is to develop a technology that can adjust the amount of data transmitted as an MPEG video stream according to its given communication bandwidth, and technique that can reflect dynamic bandwidth while playing a video stream. For this purpose, we introduce a media scalable media decomposer working on server side, and a scalable media composer working o n a client side, and then propose a scalable transmission method and a media sender and a media receiver in consideration of dynamic QoS. Those methods proposed her can facilitate an effective use of network resources, and provide multimedia MPEG video services in real-time with respect to individual client computing environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8C
• /
• pp.1175-1183
• /
• 2004

This paper propose a method to trace a moving object based on the information directly obtained from MPEG-2 compressed video stream without decoding process. In the proposed method, the motion flow is constructed from the motion vectors involved in compressed video and then we calculate the amount of pan, tilt, zoom associated with camera operations using generalized Hough transform. The local object motion can be extracted from the motion flow after the compensation with the parameters related to the global camera motion. The moving object is designated initially by a user via bounding box. After then automatic tracking is performed based on the mean-shift algorithm of the motion flows of the object. The proposed method can improve the computation speed because the information is directly obtained from the MPEG-2 compressed video, but the object boundary is limited by blocks rather than pixels.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.1C
• /
• pp.47-55
• /
• 2003

This paper proposes a composition method of mosaic image from the compressed MPEG-2 video stream, in which the displacement between successive frames according to the camera operation is estimated directly from the information involved in the stream. In the proposed method. the approximated optical flow is constructed from motion vectors of macro blocks, and it is used to determine the parameters of the displacements according to the camera operation associated with pan and tilt. The extracted parameters are used to determine the geometric transform of successive video frames in order to construct a mosaic image. The construction of mosaic uses several blending techniques including the one proposed by Nichols in which an analytic weight is used to determine pixel values. Through the experiment, the blending technique based on analytic weights was superior to the others such as averaging and median-based techniques. It provided more smooth changes in background and made use of instantaneous frame information to construct a mosaic. The mosaic in the paper puts the emphasis on the reduction of computation because it is constructed from the motion vectors included in the compressed video without decoding and recalculating exact optical flows. The constructed mosaic can be used in the retrieval of the compressed video as the representative frame of a shot.

• The KIPS Transactions:PartD
• /
• v.13D no.3 s.106
• /
• pp.347-356
• /
• 2006

A video stream can be represented by a sequence of data points in a multidimensional space. In this paper, we introduce a trend vector that approximates values of data points in a sequence and represents the moving trend of points in the sequence, and present a pattern similarity matching method for data sequences using the trend vector. A sequence is partitioned into multiple segments, each of which is represented by a trend vector. The query processing is based on the comparison of these vectors instead of scanning data elements of entire sequences. Using the trend vector, our method is designed to filter out irrelevant sequences from a database and to find similar sequences with respect to a query. We have performed an extensive experiment on synthetic sequences as well as video streams. Experimental results show that the precision of our method is up to 2.1 times higher and the processing time is up to 45% reduced, compared with an existing method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.11
• /
• pp.2793-2803
• /
• 2013

In H.264, three different data partition types are used, which have unequal importance to the reconstructed video quality. To improve the performance of H.264 video streaming transmission over IEEE 802.11e Wireless Local Area Networks, a prioritization mechanism that categorizes different partition types to different priority classes according to the calculated distortion within one Group of Pictures. In the proposed scheme, video streams have been encoded based on the H.264 codec with its data partition enabled. The dynamic scheduling scheme based on Enhanced Distributed Channel Access has been configured to differentiate the data partitions according to their distortion impact and the queue utilization ratio. Simulation results show that the proposed scheme improves the received video quality by 1dB in PSNR compared with the existing Enhanced Distributed Channel Access static mapping scheme.

• Journal of the Korea Computer Industry Society
• /
• v.6 no.5
• /
• pp.767-774
• /
• 2005

In this paper, we propose an efficient coding method of digital hologram using standard compression tools for video images. At first, we convert fringe patterns into video data using a principle of CGH(Computer Generated Hologram), and then encode it. In this research, we propose a compression algorithm is made up of various method such as pre-processing for transform, local segmentation with global information of object image, frequency transform for coding, scanning to make fringe to video stream, classification of coefficients, and hybrid video coding. The proposed algorithm illustrated that it have better properties for reconstruction and compression rate than the previous methods.