• Journal of the Institute of Electronics Engineers of Korea SP
• /
• 제48권6호
• /
• pp.35-47
• /
• 2011

A present experimental broadcasting is service compatible to delivery left view and right view of a dual stream for backward compatible with 2D device. It has a limitation of quality for a transmission of dual stream in terrestrial bandwidth 19 Mbps. This paper proposes adjunct terrestrial-3D broadcasting system which can provide a stable quality beyond a limitation of quality from fixed bandwidth. It proposes the system that composes a high quality stereoscopic video through synchronizing Real time broadcasting and Non Real Time broadcasting Regardless of the terrestrial bandwidth. So this paper tries to analyze each technique of Real-Time broadcasting and NRT broadcasting, and verify this proposal through the technique of an algorithm that we can implement NRT adjunct high quality 3DTV system and the experiments.

• International Journal of Internet, Broadcasting and Communication
• /
• 제9권2호
• /
• pp.78-86
• /
• 2017

In this paper, we propose an energy-efficient scheduling scheme for real-time periodic tasks on a heterogeneous Grid computing system. The Grid system consists of heterogeneous processors providing the DVFS mechanism with a finite set of discrete clock frequencies. In order to save energy consumption, the proposed scheduling scheme assigns each real-time task to a processor with the least energy increment. Also the scheme activates a part of all available processors with unused processors powered off. Evaluation shows that the proposed scheme saves up to 70% energy consumption of the previous method.

• International Journal of Internet, Broadcasting and Communication
• /
• 제9권1호
• /
• pp.9-17
• /
• 2017

This paper describes a process of developing commercial real time image recognition system with company. In this paper we will make a system that is combining an empirical kernel map method and conjugate least squares support vector machine in order to represent images in a low-dimensional subspace for real time image recognition. In the traditional approach calculating these eigenspace models, known as traditional PCA method, model must capture all the images needed to build the internal representation. Updating of the existing eigenspace is only possible when all the images must be kept in order to update the eigenspace, requiring a lot of storage capability. Proposed method allows discarding the acquired images immediately after the update. By experimental results we can show that empirical kernel map has similar accuracy compare to traditional batch way eigenspace method and more efficient in memory requirement than traditional one. This experimental result shows that proposed model is suitable for commercial real time image recognition system.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• 제23권4호
• /
• pp.79-84
• /
• 2023

Apache Spark, which provides the fastest processing speed among recent distributed and parallel processing technologies, provides real-time functions and machine learning functions. Although official documentation guides for these functions are provided, a method for fusion of functions to predict a specific value in real time is not provided. Therefore, in this paper, we conducted a study to predict the value of data in real time by fusion of these functions. The overall configuration is collected by downloading stock price data provided by the Python programming language. And it creates a model of regression analysis through the machine learning function, and predicts the adjusted closing price among the stock price data in real time by fusing the real-time streaming function with the machine learning function.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 한국방송공학회 2004년도 정기총회 및 학술대회
• /
• pp.285-288
• /
• 2004

High-quality digital broadcasting contents are susceptible to illegal copy and unauthorized redistribution, which makes broadcasters difficult to protect valuable media assets. So, broadcasters and content providers need the technology for copyright protection of professional digital content. Digital watermarking technology is one of the most actively developed solutions for the copyright protection. This paper suggests the requirements of watermarking technology in DTV(Digital TV) environment for copyright protection and shows the developed real-time watermark embedding/detecting system for HD(High Definition)/SD(Standard Definition) video and experimental results of the system against watermark attack tests. Our watermarking system meets the watermarking requirements of invisibility, robustness and security of DTV environment.

• Journal of Broadcast Engineering
• /
• 제10권2호
• /
• pp.131-138
• /
• 2005

High-quality digital broadcasting contents are susceptible to illegal copy and unauthorized redistribution, which makes broadcasters difficult to protect valuable media assets. So, broadcasters and content providers need the technology for copyright protection of professional digital content. Digital watermarking technology is one of the most actively developed solutions for the copyright protection. This paper suggests the requirements of watermarking technology in DTV(Digital TV) environment for copyright protection and shows the developed real-time watermark embedding/detecting system for HD(High Definition)/SD(Standard Definition) video and experimental results of the system against watermark attack tests. Our watermarking system meets the watermarking requirements of invisibility, robustness and security of DTV environment.

• Knowledge Management Research
• /
• 제23권3호
• /
• pp.285-311
• /
• 2022

In this study, based on the S-O-R framework, how individual's stimuli (i.e., video characteristics, YouTuber characteristics, real-time broadcasting characteristics of YouTube channel) form organisms (i.e., perceived usefulness, perceived pleasure, social presence), leading to viewers' responses (i.e., continuous watching intention, paid sponsorship intention) on real-time YouTube channels. For this purpose, a research model and hypotheses were constructed, and 369 questionnaire data collected from users of real-time broadcasting channel services on the YouTube platform were analyzed. Result findings confirmed that some video/YouTuber/real-time broadcasting characteristics significantly affect viewers' perceived usefulness/perceived pleasure/social presence, and further influence continuous watching/paid sponsorship intentions. Theoretical and practical implications of the findings are discussed in conclusion.

• 한국HCI학회:학술대회논문집
• /
• 한국HCI학회 2006년도 학술대회 2부
• /
• pp.518-523
• /
• 2006

As digital broadcasting process and information compressing technologies developed, digital technologies have been used extensively in many visual media such as movies and TV programs, and it is required to develop a new process for 3 dimensional digital programs. The study attempts to develop a new digital video-producing process through pre-simulation using a digital storytelling method, in order to increase the quality of broadcasting, reducing the producing time and improve efficiency. This system, supposed to be used to produce actual broadcasting, includes all tools needed for broadcasting in the program, so users can select an appropriate set among the pre-made library, which saves time for making sets. Also, it offers a storyboard making function by perfectly representing the functions of a virtual camera, and enables users to make the better storyboard, checking the real time movies. In addition, it recognizes objects though avatars, organizes the appropriate set for these avatars to act, and embodies a variety of avatar movements through which it reaffirms the camera's position and organization, minimizing errors and saving time and budget.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• 제12권5호
• /
• pp.83-90
• /
• 2012

This paper is a research on the design and implementation of a small real-time radio broadcasting system by using smart phone based on Android. It was designed as the server-client structure, and used the progressive download of HTTP as methods of transferring data to further simplify the system. In order to realize the real-time broadcasting, the original audio source was divided with a short interval and captured to be compressed and stored into files. Then the client receives and plays the compressed files sequentially as it is downloaded. However, this method occurs two problems each of which is the loss of capturing the original source in the server and the discontinuity of playing the files in the client. We solved the problem in the server by separating the thread into two parallel threads of which is each captured and compressed/stored, also by using the double buffering method. The problem in the client was solved using MediaPlayer in Android and the file queue to store the multiple files.

• International Journal of Internet, Broadcasting and Communication
• /
• 제10권3호
• /
• pp.26-34
• /
• 2018

In this paper, we propose a scheduling scheme that can efficiently serve I/O requests having deadlines in flash storage. The I/O requests with deadlines, namely, real-time requests, are assumed to be issued for streaming services of continuous media. Since a Web-based streaming server commonly supports downloads of HTMLs or images, we also aim to quickly process non-real-time I/O requests, together with real-time ones. For this purpose, we adopt the well-known rate-reservation EDF (RR-EDF) algorithm for determining scheduling priorities among mixed I/O requests. In fact, for the use of an EDF-style algorithm, overhead of task's switching should be low and predictable, as with its application of CPU scheduling. In other words, the EDF algorithm is inherently unsuitable for scheduling I/O requests in HDD storage because of highly varying latency times of HDD. Unlike HDD, time for reading a block in flash storage is almost uniform with respect to its physical location. This is because flash storage has no mechanical component, differently from HDD. By capitalizing on this uniform block read time, we compute bandwidth utilization rates of real-time requests from streams. Then, the RR-EDF algorithm is applied for determining how much storage bandwidth can be assigned to non-real-time requests, while meeting deadlines of real-time requests. From this, we can improve the service times of non-real-time requests, which are issued for downloads of static files. Because the proposed scheme can expand flexibly the scheduling periods of streams, it can provide a full usage of slack times, thereby improving the overall throughput of flash storage significantly.