• Journal of Korea Multimedia Society
• /
• v.20 no.3
• /
• pp.465-473
• /
• 2017

Electrocardiogram(ECG) signal is one of the unique bio-signals of individuals and is used for personal authentication. The existing studies on personal authentication method using ECG signals show a high detection rate for a small group of candidates, but a low detection rate and increased execution time for a large group of candidates. In this paper, we propose a hierarchical algorithm that extracts fiducial points based on curvature of ECG signals as feature values for grouping candidates ​and identifies candidates using waveform-based comparisons. As a result of experiments on 74 ECG signal records of QT-DB provided by Physionet, the detection rate was about 97% at 3-heartbeat input and about 99% at 5-heartbeat input. The average execution time was 22.4 milliseconds. In conclusion, the proposed method improves the detection rate by the hierarchical personal authentication process, and also shows reduced amount of computation which is plausible in real-time personal authentication usage in the future.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.2
• /
• pp.462-466
• /
• 2005

The extraction and recognition of shipping container's identifier is difficult since the scale or the location of identifiers are not fixed-form and input images have some external noises. In this paper, based on these facts, first, edges are detected from input images using canny masking, and regions of container's Identifiers are extracted by applying horizontal and vertical histogram method to canny masked images. We use a fuzzy thresholding method to binaries the extracted container's identifier regions, and contour tracking algorithm to extract individual identifiers. In experimental results, we confirmed that the proposed method is superior In performance.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.204-206
• /
• 2007

In this study, we introduce the optimization method of fuzzy inference systems that is based on Hierarchical Fair Competition-based Parallel Genetic Algorithms (HFCGA) and information data granulation, The granulation is realized with the aid of the Hard C-means clustering and HFCGA is a kind of multi-populations of Parallel Genetic Algorithms (PGA), and it is used for structure optimization and parameter identification of fuzzy model. It concerns the fuzzy model-related parameters such as the number of input variables to be used, a collection of specific subset of input variables, the number of membership functions, the order of polynomial, and the apexes of the membership function. In the optimization process, two general optimization mechanisms are explored. The structural optimization is realized via HFCGA and HCM method whereas in case of the parametric optimization we proceed with a standard least square method as well as HFCGA method as well. A comparative analysis demonstrates that the proposed algorithm is superior to the conventional methods. Particularly, in parameter identification, we use the UNDX operator which uses multiple parents and generate offsprings around the geographic center off mass of these parents.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.8
• /
• pp.2119-2132
• /
• 1996

This paper proposes four approaches for approximately realizing nonlinear mappling of interval vectors by neural networks. In the proposed approaches, training data for the learning of neural networks are the paris of interval input vectors and interval target output vectors. The first approach is a direct application of the standard BP (Back-Propagation) algorithm with a pre-processed training data. The second approach is an application of the two BP algorithms. The third approach is an extension of the BP algorithm to the case of interval input-output data. The last approach is an extension of the third approach to neural network with interval weights and interval biases. These approaches are compared with one another by computer simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4A
• /
• pp.303-311
• /
• 2011

In this paper, we propose the adaptive multibeamforming algorithm to remove the same subcarrier interference and multipath signals in the MIMO(Multi-Input Multi-Out)-OFDMA (Orthogonal Frequency Division Multiplexing Access)system allocated the same subcarrier partially in order to improve spectrum efficiency. In addition to removing the interference, we can get diversity gain and combat the detriment of the performance according to time delay by the proposed approach. BER performance improvement and combating the delay spread detrimental effects of the proposed approach is investigated through computer simulation by applying it to MIMO-OFDMA.

• Journal of information and communication convergence engineering
• /
• v.8 no.4
• /
• pp.349-354
• /
• 2010

Moving pixel displacement detection algorithm using correlation functions for making panorama image on the continuous images is presented in this paper. The input images get from a CMOS image sensor (CIS). The camera is maintained by constant brightness and uniform sensing area in test input pattern. For simple navigation and capture image has to 70% overlapped region. A correlation rate in two image data is evaluated by using reference image with first captures, and compare image with next captures. The displacement of the two images are expressed to second order function of x, y and solved with finding the coefficient in second order function. That results in the change in the peak correlation displacement from the reference to the compare image, is moving to pixel length. The navigating error is reduced by varying the path because the error is shown in the difference of the positioning vector between the true pixel position and the navigated pixel position. The algorithm performance is evaluated to be different from the error vector to vary the navigating path grid.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.4 no.2
• /
• pp.103-110
• /
• 2011

It is necessary to accurate and efficient management for measured digital data from sensors in u-health system. It is not efficient that sensor network process input stream data of mass storage stored in database the same time. We propose to improve the processing performance of multidimensional stream data continuous incoming from multiple sensor. We propose process query based on sliding window for efficient input stream and found multiple query plan to Mjoin method and we reduce stored data using backpropagation algorithm. As a result, we obtained to efficient result about 18.3% reduction rate of database using 14,324 data sets.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.7 no.1
• /
• pp.55-60
• /
• 2014

In this paper, we proposed a method for face region extraction by skin-color hue, saturation and facial feature extraction in natural images. The proposed algorithm is composed of lighting correction and face detection process. In the lighting correction step, performing correction function for a lighting change. The face detection process extracts the area of skin color by calculating Euclidian distances to the input images using as characteristic vectors color and chroma in 20 skin color sample images. Eye detection using C element in the CMY color model and mouth detection using Q element in the YIQ color model for extracted candidate areas. Face area detected based on human face knowledge for extracted candidate areas. When an experiment was conducted with 10 natural images of face as input images, the method showed a face detection rate of 100%.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.3
• /
• pp.433-442
• /
• 1995

This paper presents an improved VLSI implementation of a parallel sorter to achieve O(Ν) time complexity. Many fast VLSI sort algorithms have been proposed for sorting N elements in O(log Ν) time. However, most such algorithms proposed have complex network structure without considering data input and output time. They are also very difficult to expand or to use in real applications. After analyzing the chip area and time complexity of several parallel sort algorithms with overlapping data input and output time, the most effective algorithm, the rebound sort algorithm, is implemented in VLSI with some improvements. To achieve O(Ν) time complexity, an improved rebound sorter is able to sort 8 16-bits records on a chip. And it is possible to sort more than 8 records by connecting chips in a chain vertically.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.2
• /
• pp.616-627
• /
• 1997

We porpose a new VLSI architecture for the three step search algorithm for the mition estimation of moving images.In the proposed architecture the regular data input is possible and the data are passed through all computational processes ,minimiuzing the input bandwidth.The performandce is analyzed in detail,and compared with other architectures.The performance is approaching to the ideal computation speed,with less hardware than for the existing architectures.