• Journal of KIISE:Software and Applications
• /
• v.30 no.7_8
• /
• pp.727-743
• /
• 2003

This paper proposes an automatic highlight building algorithm for soccer video by using the structural characteristics of broadcasted sports video that an interesting (or important) event (such as goal or foul) in sports video has a continuous replay shot surrounded by gradual shot change effect like wipe. This shot editing rule is used in this paper to analyze the structure of broadcated soccer video and extracts shot involving the important events to build a highlight. It first uses the spatial-temporal image of video to detect wipe transition effects and zoom out/in shot changes. They are used to detect the replay shot. However, using spatial-temporal image alone to detect the wipe transition effect requires too much computational resources and need to change algorithm if the wipe pattern is changed. For solving these problems, a two-pass detection algorithm and a pixel sub-sampling technique are proposed in this paper. Furthermore, to detect the zoom out/in shot change and replay shots more precisely, the green-area-ratio and the motion energy are also computed in the proposed scheme. Finally, highlight shots composed of event and player shot are extracted by using these pre-detected replay shot and zoom out/in shot change point. Proposed algorithm will be useful for web services or broadcasting services requiring abstracted soccer video.

• Journal of Broadcast Engineering
• /
• v.21 no.4
• /
• pp.525-537
• /
• 2016

In this paper, we develop an online video mash-up system which use automatic scene elements composition scheme using a storyboard. There are two conventional online video production schemes. Video collage method is simple and easy, but it was difficult to reflect narrative or story. Another way is a template based method which usually select a template and it replaces resources such as photos or videos in the template. However, if the related templates do not exist, there are limitations that cannot create the desired output. In addition, the quality and atmosphere of the output is too dependent on the template. To solve these problems, we propose a video mash-up scheme using storyboard and we also implement a classification and recommendation scheme based on topic modeling.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.4
• /
• pp.491-508
• /
• 2010

In peer-to-peer (P2P) on-demand streaming networks, the alleviation of server load depends on reciprocal stream sharing among peers. In general, on-demand video services enable clients to watch videos from beginning to end. As long as clients are able to buffer the initial part of the video they are watching, on-demand service can provide access to the video to the next clients who request to watch it. Therefore, the key challenge is how to keep the initial part of a video in a peer's buffer for as long as possible, and thus maximize the availability of a video for stream relay. In addition, to address the issues of delivering data on lossy network and providing scalable quality of services for clients, the adoption of multiple description coding (MDC) has been proven as a feasible resolution by much research work. In this paper, we propose a novel caching scheme for P2P on-demand streaming, called Dynamic Buffering. The proposed Dynamic Buffering relies on the feature of MDC to gradually reduce the number of cached descriptions held in a client's buffers, once the buffer is full. Preserving as many initial parts of descriptions in the buffer as possible, instead of losing them all at one time, effectively extends peers’ service time. In addition, this study proposes a description distribution balancing scheme to further improve the use of resources. Simulation experiments show that Dynamic Buffering can make efficient use of cache space, reduce server bandwidth consumption, and increase the number of peers being served.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.334-343
• /
• 2001

Most of currently used videos have variable bit rate(VBR) characteristics. Since the display rate of VBR videos compared to CBR videos vary with time, it is not proper to configure resources of the VBR video server using the method proposed for the CBR video server. In this paper we propose an optimal resource configuration method for the VBR video server which is based on the probability model. The proposed method decides the amount of disk and memory, and the disk access cycle of the video server with the lowest hardware cost, while preserving the throughput of the video server. In addition, we show the usefulness of the method through the various experiments.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.9
• /
• pp.381-392
• /
• 2013

During the last decade, the multitude of advances attained in terminal computers, along with the introduction of mobile hand-held devices, and the deployment of high speed networks have led to a recent surge of interest in Quality of Service (QoS) for video applications. The main difficulty is that mobile devices experience disparate channel conditions, which results in different rates and patterns of packet loss. One way of making more efficient use of network resources in video services over wireless channels with heterogeneous characteristics to heterogeneous types of mobile device is to use a scalable video coding (SVC). An SVC divides a video stream into a base layer and a single or multiple enhancement layers. We have to ensure that the base layer of the video stream is successfully received and decoded by the subscribers, because it provides the basis for the subsequent decoding of the enhancement layer(s). At the same time, a system should be designed so that the enhancement layer(s) can be successfully decoded by as many users as possible, so that the average QoS is as high as possible. To accommodate these characteristics, we propose an efficient transmission scheme which incorporates SVC-aware dual-channel repetition to improve the perceived quality of services. We repeat the base-layer data over two channels, with different characteristics, to exploit transmission diversity. On the other hand, those channels are utilized to increase the data rate of enhancement layer data. This arrangement reduces service disruption under poor channel conditions by protecting the data that is more important to video decoding. Simulations show that our scheme safeguards the important packets and improves perceived video quality at a mobile device.

• Journal of Broadcast Engineering
• /
• v.13 no.1
• /
• pp.6-16
• /
• 2008

An instable wireless channel condition causes more packet losses and retransmissions due to interference, fading, station mobility, and so on. Therefore video streaming service over a wireless networks is a challenging task because of the changes in the wireless channel conditions and time-constraints characteristics of the video streaming services. To provide efficient video streaming over a wireless networks, QoS-enhanced MAC protocol, IEEE 802.11e, is standardized recently. Tn this paper, we propose a new network-adaptive H.264 video streaming mechanism in the IEEE 802.11e wireless networks. To improve the quality of video streaming services, video stream has to adapt to the changes in the wireless channel conditions. The wireless channel conditions are estimated by the packet loss probability and informed to the application layer by the cross-layering. According to the wireless channel information, the video streaming application filters out the low-priority data. This adaptation mechanism efficiently uses system resources because it drops the low-priority data in advance. Therefore, our cross-layer design can provide improved video streaming services to the end-user. Through the implementation and performance evaluation, we prove that the proposed mechanism improves the QoS of the video streaming by providing the smoothed playback.

• Journal of Korea Multimedia Society
• /
• v.4 no.2
• /
• pp.130-135
• /
• 2001

When a networked virtual reality system handles composite media audio and video as well as three dimensional computer graphics, the quality of the virtual space is greatly affected by the current available network, and end system resources. Even if the network can preserve a certain amount of resources, the required resources change dynamically according to the user\`s navigation of a large virtual space, and then it may decrease the quality of the virtual space. In this paper, a method for resource allocation is proposed and the proposed system copes with the deterioration of quality of virtual spaces in case that the starvation of system resources occurs. The experimental results show that the proposed method is efficient.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1C
• /
• pp.11-20
• /
• 2002

In this paper, we propose an efficient quality providing scheme to satisfy a diversify combination of delay bound and loss ratio requirements from users by a predictive dynamic resource allocation method for real-time video applications. For utilizing the network resources more efficiently while meeting the service requirements, we adjust the resources based on the predicted traffic and the currently provided quality level. We developed a simple delayed-packet counter updating scheme for real time QoS monitoring. Simulation results show that our proposed method can provide an accurate and flexible quality control.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.5
• /
• pp.79-86
• /
• 2008

H.264/AVC is the newest international video coding standard developed by the joint ITU-T and ISO/IEC standards organizations. This newest video coding standard offers much higher coding efficiency than the H.261, H.263 and MPEG-4. But it has high computing complexity and high H/W resources wasting problem. This paper described the two unit parallel pipeline structure. This new structure comparing with standard model decreased the computing complexity of 67% and the H/W resources waste of 3%.

• 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.