• Journal of the Institute of Convergence Signal Processing
• /
• v.11 no.1
• /
• pp.9-12
• /
• 2010

This paper presents design and implementation of infrared thermal image processing system based on the digital media processor for disaster monitoring. The digital thermal image processing board is designed and implemented by using commercial chips such as DM642 processor and video encoder, video decoder. The implemented functions for disaster monitoring are to analyze temperature distribution of a monitoring infrared thermal image and to detect disaster situation such as fire. For the input of infrared thermal image processing system, an infrared camera of type of the $320\;{\times}\;240\;{\mu}$-bolometer is used. The required functions are confirmed with 10 frame/second of processing performance by testing of the prototype and Practicality of the system was verified.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2741-2761
• /
• 2017

With the purpose of copyright protection for digital video, a novel H.264/AVC watermarking algorithm based on JND model is proposed. Firstly, according to the characteristics of human visual system, a new and more accurate JND model is proposed to determine watermark embedding strength by considering the luminance masking, contrast masking and spatial frequency sensitivity function. Secondly, a new embedding strategy for H.264/AVC watermarking is proposed based on an analysis on the drift error of energy distribution. We argue that more robustness can be achieved if watermarks are embedded in middle and high components of $4{\times}4$ integer DCT since these components are more stable than dc and low components when drift error occurs. Finally, according to different characteristics of middle and high components, the watermarks are embedded using different algorithms, respectively. Experimental results demonstrate that the proposed watermarking algorithm not only meets the imperceptibility and robustness requirements, but also has a high embedding capacity.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.27 no.9
• /
• pp.6-14
• /
• 2013

The position of the light source, illuminance distribution, and color temperature were evaluated in each lighting environment for the three main activities in a living room - 'watching TV,' 'reading' and 'relaxing.' In 'watching TV', the experiment was done to estimate the degree of comfort felt by the subjects when they watch static video and moving video, respectably, with different ambient brightness, with or without partial lighting above the TV set, and with different color temperatures. In 'reading', the comfortableness was estimated by the illuminance ratio of the ambient lighting to the lighting for reading and by the difference in color temperature. And in 'relaxing', the comfortableness was estimated by means of the ambient brightness, use/no use of a relaxing lamp, and color temperature. This experiment determined the general satisfaction for each visual act and the optimum lighting environment to reduce glare.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4587-4605
• /
• 2019

High Efficiency Video Coding (HEVC) suffers from high computational complexity due to its quad-tree structure in motion estimation (ME). This paper exposes an adaptive search range decision algorithm for accelerating HEVC integer-pel ME on GPU which estimates the optimal search range (SR) using a MAP (Maximum A Posteriori) estimator. There are three main contributions; First, we define the motion feature as the standard deviation of motion vector difference values in a CTU. Second, a MAP estimator is proposed, which theoretically estimates the motion feature of the current CTU using the motion feature of a temporally adjacent CTU and its SR without any data dependency. Thus, the SR for the current CTU is parallelly determined. Finally, the values of the prior distribution and the likelihood for each discretized motion feature are computed in advance and stored at a look-up table to further save the computational complexity. Experimental results show in conventional HEVC test sequences that the proposed algorithm can achieves high average time reductions without any subjective quality loss as well as with little BD-bitrate increase.

• Journal of Broadcast Engineering
• /
• v.20 no.1
• /
• pp.153-163
• /
• 2015

This paper proposes a rain detection and removal algorithm that is robust against camera motion in video sequences. In detection part, the proposed algorithm initially detects possible rain streaks by using intensity properties and spatial properties. Then, the rain streak candidates are selected based on Gaussian distribution model. In removal part, a non-rain block matching algorithm is performed between adjacent frames to find similar blocks to the block that has rain pixels. If the similar blocks to the block are obtained, the rain region of the block is reconstructed by non-local means (NLM) filter using the similar neighbors. Experimental results show that the proposed algorithm outperforms the previous works in terms of subjective visual quality of de-rained video sequences.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2014.06a
• /
• pp.258-261
• /
• 2014

The era of realistic broadcast with high fidelity has come after the wide-spread distribution of UHD display and the transmission of UHD experimental broadcast in CATV. However, UHD broadcast now has constraint because it requires much amount of bandwidth and data in broadcasting transmission and production system. Not only HEVC(High Efficiency Video Codec) which has more than two times higher compression rate but also cloud-based editing system would be the key to solve the problems above. Also, fast scene change detection of videos is needed to index and search UHD videos smoothly. In this paper, therefore, a method is proposed to index and search the scene change information of large volume UHD videos compressed with high-efficiency codec. Application usages of fast detection of scene change information in various UHD video environments are considered by using this algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3C
• /
• pp.147-152
• /
• 2005

In this paper, we proposed a method for compressing the static video test patterns in high quality to test the picture quality in DTV. In our method, we use the fact that the generated bits and average quantization value have almost identical distribution characteristics per each GOP and we propose a new target bit allocation method suitable for compressing the static test pattern while the target bit allocation method in MPEG-2 TM5 is suitable for the moving picture. The proposed target bit allocation method is to maintain the high quality video continuously by using the normalized complexities which are updated or maintained by means of picture qualities at each GOP. Experiment result showed that the test pattern stream encoded by MPEG-2 software with the proposed algorithm had a stable bit rate and good video quality during the decoding process.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.1
• /
• pp.652-657
• /
• 2015

BitTorrent is an innovative protocol related to file-sharing and file-transferring, which allows users to receive pieces of files from multiple sharer on the Internet to make the pieces into complete files. In reality, however, free distribution of illegal or copyright related video data is counted for crime. Difficulty of regulation on the copyright of data on BitTorrent is caused by the fact that data is transferred with the pieces of files instead of the complete file formats. Therefore, the classification process of file formats of the digital contents should take precedence in order to restore digital contents from the pieces of files received from BitTorrent, and to check the violation of copyright. This study has suggested SVM classifier for the classification of digital files, which has the feature vector of histogram differential on the pieces of files. The suggested classifier has evaluated the performance with the division factor by applying the classifier to three different formats of video files.

• Journal of Broadcast Engineering
• /
• v.18 no.1
• /
• pp.10-20
• /
• 2013

Nowadays, video technology has been successfully improved creating tremendous results. As video technology improve, multimedia devices and demands from users are diversified. Therefore, a video codec used in these devices should support various displays with different resolutions. The technology to generate a higher resolution image from the associated low-resolution image is called interpolation. Interpolation is generally performed in either the spatial domain or the DCT domain. To use the advantages of both domains, we have proposed the new adaptive interpolation algorithm based on edge direction, which adaptively exploits the advantages of both domains. The experimental results demonstrate that our algorithm performs well in terms of PSNR and reduces the blocking artifacts.

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