• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.9
• /
• pp.38-45
• /
• 2007

With the emergence of new applications, packet classification is essential for supporting advanced internet applications, such as network security and QoS provisioning. As the packet classification on multiple-fields is a difficult and time consuming problem, internet routers need to classify incoming packet quickly into flows. In this paper, we present multi-phase packet classification architecture using an internal buffer for fast packet processing. Using internal buffer between address pair searching phase and remained fields searching phases, we can hide latency from the characteristic that search times of source and destination header fields are different. Moreover we guarantee the improvement by using single entry caching. The proposed architecture is easy to apply to different needs owing to its simplicity and generality.

• Journal of Internet Computing and Services
• /
• v.18 no.1
• /
• pp.21-26
• /
• 2017

In this paper, an USB-OTG (Uiversal Serial Bus On-the-go) interface module was designed with the iris information for personal identification. The image recognition algorithm which was searching face and iris areas, was proposed with pixel differences from eye blinking after several facial images were captured and then detected without any activities like as pressing the button of smart phone. The region of pupil and iris could be fast involved with the proper iris area segmentation from the pixel value calculation of frame difference among the images which were detected with two adjacent open-eye and close-eye pictures. This proposed iris recognition could be fast processed with the proper grid size of the eye region, and designed with the frame difference between the adjacent images from the USB-OTG interface with this camera module with the restrict of searching area in face and iris location. As a result, the detection time of iris location can be reduced, and this module can be expected with eliminating the standby time of eye-open.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.650-663
• /
• 2004

In molecular biology, DNA sequence searching is one of the most crucial operations. Since DNA databases contain a huge volume of sequences, a fast indexing mechanism is essential for efficient processing of DNA sequence searches. In this paper, we first identify the problems of the suffix tree in aspects of the storage overhead, search performance, and integration with DBMSs. Then, we propose a new index structure that solves those problems. The proposed index consists of two parts: the primary part represents the trie as bit strings without any pointers, and the secondary part helps fast accesses of the leaf nodes of the trio that need to be accessed for post processing. We also suggest an efficient algorithm based on that index for DNA sequence searching. To verify the superiority of the proposed approach, we conducted a performance evaluation via a series of experiments. The results revealed that the proposed approach, which requires smaller storage space, achieves 13 to 29 times performance improvement over the suffix tree.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.9
• /
• pp.1747-1754
• /
• 2016

This paper presents a high accuracy and fast hybrid on-chip temperature sensor. The proposed temperature sensor combines a SAR type temperature sensor with a ${\Sigma}{\Delta}$ type temperature sensor. The SAR type temperature sensor has fast temperature searching time but it has more error than the ${\Sigma}{\Delta}$ type temperature sensor. The ${\Sigma}{\Delta}$ type temperature sensor is accurate but it is slower than the SAR type temperature sensor. The proposed temperature sensor uses both the SAR and ${\Sigma}{\Delta}$ type temperature sensors, so that the proposed temperature sensor has high accuracy and fast temperature searching. Also, the proposed temperature sensor includes a temperature error compensating circuit by storing the temperature errors in a memory circuit after chip fabrication. The proposed temperature sensor was fabricated in 3.3V CMOS $0.35{\mu}m$ process. Its temperature resolution, power consumption, and area are $0.15^{\circ}C$, $540{\mu}W$, and $1.2mm^2$, respectively.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.5
• /
• pp.388-396
• /
• 2003

In this paper, a fast motion search algorithm that performs motion search for variable blocks in integer pixel unit is proposed. The proposed method is based on the successive elimination algorithm (SEA) using sum norms to find the best estimate of motion vector and obtains the best estimate of the motion vectors of blocks, including 16${\times}$8, 8${\times}$16, and 8${\times}$8, by searching eight pixels around the best motion vector of 16${\times}$16 block obtained from all candidates. And the motion vectors of blocks, including 8${\times}$4, 4${\times}$8, and 4${\times}$4, is obtained by searching eight pixels around the best motion vector of 8${\times}$8 block. The proposed motion search is applied to the H.264 encoder that performs variable blocks motion estimation (ME). In terms of computational complexity, the proposed search algorithm for motion estimation (ME) calculates motion vectors in about 23.8 times speed compared with the spiral full search without early termination and 4.6 times speed compared with the motion estimation method using hierarchical sum of absolute difference (SAD) of 4${\times}$4 blocks, while it shows 0.1dB∼0.4dB peak signal-to-noise ratio (PSNR) drop in comparison to the spiral full search.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.9
• /
• pp.1059-1064
• /
• 2015

To write a medical record using SNOMED CT standard clinical terminologies, it is necessary to find and select an appropriate terminology from the huge volume of terminologies within short time. Using previous SNOMED CT search browsers, it is very difficult to select appropriate one from search results since they provide a simple list-up of similar candidate terminologies. This paper proposes a novel search browser which supports effect searching of clinical terminology by utilizing characteristics of SNOMED CT. The proposed system provides a simplified tree-view representing hierarchical structures of search results which enables fast selection of appropriate terminology from the search results. Design and Implementation of the system proves effectiveness of the proposed approach.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1A
• /
• pp.99-106
• /
• 2004

In this Paper, the matched filter for searching initial synchronization in DSSS (direct sequence spread spectrum) receiver is studied. The matched filter with a single data flow path is described which can be presented by HDL (Hardware Description Language). In order to improve the processing time of operations for the filter, equations are arranged to represent two data flow paths and the associated hardware model is proposed. The model has an architecture based on parallelism and pipeline for fast processing, in which two data flow paths with a series of memory, multiplier and accumulator are placed in parallel. The performance of the model is analyzed and compared with the matched filter with a single data flow path.

• The Journal of the Korea Contents Association
• /
• v.11 no.2
• /
• pp.54-60
• /
• 2011

The study is content-based video retrieval system based on the news video domain as researching for the video data processing method for searching the multimedia information. For the implementation of effective system, We retrieval meaning information and special information using the knowing knowledge about formation and structure of the video data. These are possible to retrieval searching by articles fast and accurately by indexing contents the users want to search. The news domain used in experiment of our system is the KBS news on the air nowadays and precision and recall is used to evaluate the experiment and performance.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.286-289
• /
• 2009

This paper presents an effective approach to minimize recursive computations for balancing stereo pairs by using disparity vector errors and its directional histogram. A stereo balancing function is computed from the correspondent pixels between two images, and a simple approach is to find the matching blocks of two images. However, this procedure requires recursive operation, and its computation cost is very high. Therefore, in this paper, we propose an efficient balance method using structural similarity index and a partial re-searching scheme to reduce the computation cost considerably. For this purpose, we determine if re-searching for each block is necessary or not by using the errors and the directional histogram of disparity vectors. Experiment results show that the performance of the proposed approach can save the computations significantly with ignorable image quality degradation compared with full re-search approach.

• Journal of Broadcast Engineering
• /
• v.22 no.2
• /
• pp.240-252
• /
• 2017

Multi-view video codec based on the High Efficiency Video Coding (MV-HEVC) has high encoding complexity because it exploits an additional reference picture for disparity compensation prediction (DCP) when the picture of dependent view is encoded. In this paper, we propose an efficient method to reduce the complexity of disparity motion vector search for the MV-HEVC. The proposed method includes the initial search point decision method using affine transform and the adaptive search range decision method. The simulation results show that the proposed method reduces the complexity of disparity motion vector search up to 90.78% with negligible coding efficiency degradation. Also the results show that the proposed method outperforms other conventional techniques reducing complexity.