• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1991.10a
• /
• pp.86-91
• /
• 1991

A capability of performing the optical logic and arithmetic operations is followed by an effective encoding technique. In this paper, we proposed the color light encoding technique. By using this encoding technique, the space bandwidth product(SBP) is minimized in the output plane. In addition, we proposed the pre-operation pro-carry processing method that performs faster than the same time operation and carry processing method in optical computing. We proposed that the color liquid crystal device(CLCD) is used as the encoded color light input source.

• Journal of Broadcast Engineering
• /
• v.23 no.1
• /
• pp.162-165
• /
• 2018

In this paper, we propose a pre-processing procedure to obtain scene change information using spatial down-scaled input image for efficient encoding of super-high resolution image and propose a reconstruction of reference picture list in inter-picture prediction using this information. The experimental results show that the proposed method improves the BD-Rate by 0.44% and reduces encoding time by 12.46% when compared to HM 16.12.

• Journal of Electrical Engineering and information Science
• /
• v.1 no.1
• /
• pp.70-76
• /
• 1996

In this paper, we have proposed a band stop filter (BSF) for pre-processing of image sequences before encoding. By pixel-wise temporal filtering of the image sequences using the BSF, the bandwidth and noise of the signal are reduced, while preserving the image quality in view of human visual perceptions. As a result, when compared to the original image sequences, te pre-filtered image sequence requires lower bit-rates for encoding, while there is not much degradation in quality. Also, it has been shown that the proposed BSF causes less smearing and blurring than the conventional recursive low pass filter for bandwidth and noise reductions.

• Journal of Broadcast Engineering
• /
• v.21 no.4
• /
• pp.578-591
• /
• 2016

In this paper, the fast encoding algorithm in High Efficiency Video Coding (HEVC) encoder was studied. For the encoding efficiency, the current HEVC reference software is divided the input image into Coding Tree Unit (CTU). then, it should be re-divided into CU up to maximum depth in form of quad-tree for RDO (Rate-Distortion Optimization) in encoding precess. But, it is one of the reason why complexity is high in the encoding precess. In this paper, to reduce the high complexity in the encoding process, it proposed the method by determining the maximum depth of the CU using a hierarchical clustering at the pre-processing. The hierarchical clustering results represented an average combination of motion vectors (MV) on neighboring blocks. Experimental results showed that the proposed method could achieve an average of 16% time saving with minimal BD-rate loss at 1080p video resolution. When combined the previous fast algorithm, the proposed method could achieve an average 45.13% time saving with 1.84% BD-rate loss.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.4
• /
• pp.669-677
• /
• 2020

As the number of Internet users exploded, attacks on the web increased. In addition, the attack patterns have been diversified to bypass existing defense techniques. Traditional web firewalls are difficult to detect attacks of unknown patterns.Therefore, the method of detecting abnormal behavior by artificial intelligence has been studied as an alternative. Specifically, attempts have been made to apply natural language processing techniques because the type of script or query being exploited consists of text. However, because there are many unknown words in scripts and queries, natural language processing requires a different approach. In this paper, we propose a new classification model which uses byte pair encoding (BPE) technology to learn the embedding vector, that is often used for web attack payloads, and uses an attention mechanism-based Bi-GRU neural network to extract a set of tokens that learn their order and importance. For major web attacks such as SQL injection, cross-site scripting, and command injection attacks, the accuracy of the proposed classification method is about 0.9990 and its accuracy outperforms the model suggested in the previous study.

• ETRI Journal
• /
• v.38 no.5
• /
• pp.858-867
• /
• 2016

A high dynamic range (HDR) video service is an upcoming issue in the broadcasting industry. For compatibility with legacy devices receiving a non-constant luminance (NCL) signal, new tools supporting an HDR video service are required. The current pre-processing chain of HDR video can produce color noise owing to the chroma component down-sampling process for video encoding. Although a luma adjustment method has been proposed to solve this problem, some disadvantages still remain. In this paper, we present an adaptive color noise reduction method for an NCL signal of an HDR video service. The proposed method adjusts the luma component of an NCL signal adaptively according to the information of the luma component from a constant luminance signal and the level of color saturation. Experiment results show that the color noise problem is resolved by applying our proposed method. In addition, the speed of the pre-processing is increased more than two-fold compared to a previous method.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.11
• /
• pp.66-76
• /
• 2009

The motion estimation in video encoding system occupies the biggest part. So, we require the motion estimator with efficient structure for real-time operation. And for motion estimator's implementation, it is desired to design hardware module of an exclusive use that perform the encoding process at high speed. This paper proposes motion estimation detection block(MED), 41 SADs(Sum of Absolute Difference) calculation block, minimum SAD calculation and motion vector generation block based on parallel processing. The parallel processing can reduce effectively the amount of the operation. The minimum SAD calculation and MED block uses the pre-computation technique for reducing switching activity of the input signal. It results in high-speed operation. The MED and 41 SADs calculation blocks are composed of adder tree which causes the problem of critical path. So, the structure of adder tree has changed the most commonly used ripple carry adder(RCA) with carry skip adder(CSA). It enables adder tree to operate at high speed. In addition, as we enabled to easily control key variables such as control signal of search range from the outside, the efficiency of hardware structure increased. Simulation and FPGA verification results show that the delay of MED block generating the critical path at the motion estimator is reduced about 19.89% than the conventional strukcture.

• Journal of Broadcast Engineering
• /
• v.22 no.1
• /
• pp.28-41
• /
• 2017

In this paper, the fast encoding algorithm in High Efficiency Video Coding (HEVC) encoder was studied. For the encoding efficiency, the current HEVC reference software is divided the input image into Coding Tree Unit (CTU). then, it should be re-divided into CU up to maximum depth in form of quad-tree for RDO (Rate-Distortion Optimization) in encoding precess. But, it is one of the reason why complexity is high in the encoding precess. In this paper, to reduce the high complexity in the encoding process, it proposed the method by determining the maximum depth of the CU using a hierarchical clustering at the pre-processing. The hierarchical clustering results represented an average combination of motion vectors (MV) on neighboring blocks. Experimental results showed that the proposed method could achieve an average of 16% time saving with minimal BD-rate loss at 1080p video resolution. When combined the previous fast algorithm, the proposed method could achieve an average 45.13% time saving with 1.84% BD-rate loss.

• The KIPS Transactions:PartC
• /
• v.14C no.7
• /
• pp.553-558
• /
• 2007

In this paper, we introduce a set of structures and algorithms for communication efficient public key revocation in wireless sensor networks. Unlike the traditional networks, wireless sensor network is subjected to resources constraints. Thus, traditional public key revocation mechanisms such like the ordinary certificate revocation list is unsuitable to be used. This unsuitability is due to the huge size of required representation space for the different keys' identifiers and the revocation communication as the set of revoked keys grow. In this work, we introduce two communication-efficient schemes for the certificate revocation. In the first scheme, we utilize the complete subtree mechanism for the identifiers representation which is widely used in the broadcast encryption/user revocation. In the second scheme, we introduce a novel bit vector representation BVS which uses vector of relative identifiers occurrence representation. We introduce different revocation policies and present corresponding modifications of our scheme. Finally, we show how the encoding could reduce the communication overhead as well. Simulation results and comparisons are provided to show the value of our work.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.23 no.1
• /
• pp.28-36
• /
• 2020

Due to the continued demand for high-definition video, video compression technology is steadily developing and the High Efficiency Video Coding standard was established in 2013. However, despite the development of this compression technology, it is very difficult to smoothly transmit VGA-level videos in Ultra-narrowband environments. In this paper, the target information preprocessing algorithm is presented for smooth transmission of target images moving in forest or open-terrain in Ultra-narrowband environment. In addition, for algorithm verification, the target information preprocessing algorithm was simulated and the simulated results were compared with the video compression result without the algorithm being applied.