• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2022.06a
• /
• pp.1249-1252
• /
• 2022

In this paper, we propose a conceptual framework that identifies video frames in motion containing the movement of people and vehicles in traffic videos. The automatic selection of video frames in motion is an important topic in security and surveillance video because the number of videos to be monitored simultaneously is simply too large due to limited human resources. The conventional method to identify the areas in motion is to compute the differences over consecutive video frames, which has been costly because of its high computational complexity. In this paper, we reduced the overall complexity by examining only the keyframes (or I-frames). The basic assumption is that the time period between I-frames is rather shorter (e.g., 1/10 ~ 3 secs) than the usual length of objects in motion in video (i.e., pedestrian walking, automobile passing, etc.). The proposed method estimates the possibility of videos containing motion between I-frames by evaluating the difference of consecutive I-frames with the long-time statistics of the previously decoded I-frames of the same video. The experimental results showed that the proposed method showed more than 80% accuracy in short surveillance videos obtained from different locations while keeping the computational complexity as low as 20 % compared to the HM decoder.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1997.06a
• /
• pp.95-100
• /
• 1997

In this paper, we report a system specifications of Hi-resolution and four-screen stereo image projection system which was established in VBL(Venture Business Laboratory) at Tokyo Institute of Technology on 3rd July 1996. The system is 3m $\times$ 3m $\times$2.2m rectangular parallelepiped composed of three 150inch side screens and floor. Host computers can generate virtual environment s in real-time and four projecters project these images to the screens. Viewers are, therefore, surrounded by these screens and an illusion of immersion can be created. Because, the views of users are completely covered with the projection images and many kinds of interactive devices can be used in this system. Moreover, many users can have experience the virtual environments at the same time. Usually, this kind of system uses hi-performance graphics workstations for host computers. One is SGI(Silicon Graphics, Inc.) Onyx with 3 Reality Engines. The other system is 4 personal computers. Because hi-performance and low price graphics accelerators for personal computer have been developed in these years, the abilities of VR(Virtual Reality) systems based on personal computers should be investigated.

• The KIPS Transactions:PartC
• /
• v.15C no.4
• /
• pp.263-272
• /
• 2008

Recently, WiBro has been developed to efficiently support real-time broadcasting with wireless system. MBS (Multicast Broadcast Service) based on WiBro has numerous applications such as DMB. Since the current MBS uses only common channel managed by scheduling, it cannot effectively support many users at the same time. This paper proposes a new counting scheme with which the channel mode can be properly switched between common channel and dedicated channel. It thus allows efficient use of limited radio resource in WiBro for the MBS.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.10
• /
• pp.1330-1336
• /
• 2021

Media sharing platform such as YouTube have grown significantly in the mobile environment. This is a platform that allows users to select and view broadcast programs that are only available on TV through network-connected PCs and mobiles, and share their media content to communicate. Currently, in the era where mobile and TV broadcasts can be viewed equally, there is a time difference between the video and real-time screen transmitted to TV and mobile, different from the actual situation.We want this time difference to be realized in the same way as the real time, and there is a need for a system that can broadcast in a free environment at any time. Therefore, in this paper, a broadcasting system was designed and implemented in a mobile environment. The result of reducing the delay time difference due to the improvement of the processing method was obtained.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.3
• /
• pp.207-213
• /
• 2023

The control center of an urban railway operator provides railway users with various information on railway use through a 1:N same-time broadcasting system. However, the facilities of the broadcasting system are aging, exposing many limitations in meeting the needs of urban railway users who have become familiar with mobile services. To overcome these challenges, this study analyzed the mobile-based same-time broadcasting services using location information of urban railway users and the requirements of various stakeholders (urban railway users, an operator, and external service providers, etc.) to suggest optimal service models and physical structures. Through this study, it aims to secure safer operations of urban railway as well as to improve better disaster responses through rapid and efficient spread of the situation in case of disaster.

• Journal of Broadcast Engineering
• /
• v.20 no.6
• /
• pp.837-847
• /
• 2015

In this paper, the reception performance of spatial modulation multiple-output multiple-input (MIMO) is analyzed for high speed terrestrial broadcasting. The MIMO scheme is required to reduce the inter symbol interference (ISI) and spatial correlation. The spatial modulation scheme solves the problem of ISI, but the spatial correlation degrades the reception performance of SM scheme. The space-time block coded spatial modulation (STBC-SM) is combined the SM system with space-time block code (STBC) for reducing the effects of the spatial correlation. However, the STBC-SM scheme degrades the spectral efficiency by transmitting same data in the two symbol period. The double space-time transmit diversity with spatial modulation (DSTTD-SM) scheme transmits the data with full antenna combination. To adapt these SM MIMO systems into the terrestrial broadcasting system, the reception performance is analyzed using computer simulation in SUI channel environments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.6
• /
• pp.2922-2945
• /
• 2018

Achieving efficient authentication is a crucial issue for stream data commonly seen in content delivery, peer-to-peer, and multicast/broadcast networks. Stream authentication mechanisms need to be operated efficiently at both sender-side and receiver-side at the same time because of the properties of stream data such as real-time and delay-sensitivity. Until now, many stream authentication mechanisms have been proposed, but they are not efficient enough to be used in stream applications where the efficiency for sender and receiver sides are required simultaneously since most of them could achieve one of either sender-side and receiver-side efficiency. In this paper, we propose an efficient stream authentication mechanism, so called TIM, by integrating Trapdoor Hash Function and Merkle Hash Tree. Our construction can support efficient streaming data processing at both sender-side and receiver-side at the same time differently from previously proposed other schemes. Through theoretical and experimental analysis, we show that TIM can provide enhanced performance at both sender and receiver sides compared with existing mechanisms. Furthermore, TIM provides an important feature for streaming authentication, the resilience against transmission loss, since each data block can be verified with authentication information contained in itself.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.69-85
• /
• 2006

Broadcast has been often used to disseminate the frequently requested data efficiently to a large volume of mobile clients over a single or multiple channels. Conventional concurrency control protocols for mobile transactions are not suitable for the wireless broadcast environments due to the limited bandwidth of the up-link communication channel. In wireless broadcast environments, the server often broadcast different data items with different frequency to incorporate the data access patterns of mobile transactions. The previously proposed concurrency control protocols for mobile transactions in wireless broadcast environments are focused on the mobile transactions with uniform data access patterns. However, these protocols perform poorly when the data access pattern of update mobile transaction are not uniform but skewed. The update mobile transactions with skewed data access patterns will be frequently aborted and restarted due 4o the update conflict of the same data items with a high access frequency. In this paper, we propose an energy-efficient concurrence control protocol for mobile transactions with skewed data access as well as uniform data access patterns. Our protocol use a random back-off technique to avoid the frequent abort and restart of update mobile transactions. We present in-depth experimental analysis of our method by comparing it with existing concurrency control protocols. Our performance analysis show that it significantly decrease the average response time, the amount of upstream and downstream bandwidth usage over existing protocols.

• Journal of Broadcast Engineering
• /
• v.20 no.5
• /
• pp.718-727
• /
• 2015

In this paper, we present a novel segmentation method that can extract new foreground objects from a current frame in real-time. It is performed by detecting differences between the current frame and reference frame taken from a fixed camera. We minimize computing complexity for real-time video processing. First DCT (Discrete Cosine Transform) is utilized to generate rough binary segmentation maps where foreground and background regions are separated. DCT shows better result of texture analysis than previous methods where texture analysis is performed in spatial domain. It is because texture analysis in frequency domain is easier than that in special domain and intensity and texture in DCT are taken into account at the same time. We maximize run-time efficiency of DCT by considering color information to analyze object region prior to DCT process. Last we use Guided filter for natural matting of the generated binary segmentation map. In general, Guided filter can enhance quality of intermediate result by incorporating guidance information. However, it shows some limitations in homogeneous area. Therefore, we present an additional method which can overcome them.

• Journal of Broadcast Engineering
• /
• v.10 no.1 s.26
• /
• pp.83-102
• /
• 2005

The problem of video scheduling is analyzed in the framework of divisible load scheduling. A divisible load can be divided into any number of fractions (parts) and can be processed/computed independently on the processors in a distributed computing system/network, as there are no precedence relationships. In the video scheduling, a frame can be split into any number of fractions (tiles) and can be processed independently on the processors in the network, and then the results are collected to recompose the single processed frame. The divisible load arrives at one of the processors in the network (root processor) and the results of the computation are collected and stored in the same processor. In this problem communication delay plays an important role. Communication delay is the time to send/distribute the load fractions to other processors in the network. and the time to collect the results of computation from other processors by the root processors. The objective in this scheduling problem is that of obtaining the load fractions assigned to each processor in the network such that the processing time of the entire load is a minimum. We derive closed-form expression for the processing time by taking Into consideration the communication delay in the load distribution process and the communication delay In the result collection process. Using this closed-form expression, we also obtain the optimal number of processors that are required to solve this scheduling problem. This scheduling problem is formulated as a linear pro-gramming problem and its solution using neural network is also presented. Numerical examples are presented for ease of understanding.