• Journal of KIISE:Software and Applications
• /
• v.32 no.11
• /
• pp.1147-1155
• /
• 2005

This paper deals with Iris recognition as one of biometric techniques which is applied to identify a person using his/her behavior or congenital characteristics. The Iris of a human eye has a texture that is unique and time invariant for each individual. First, we obtain the feature vector from the 2D Iris pattern having a property of size invariant and using the fuzzy LDA which is further through four types of 2D Gabor wavelet. At the recognition process, we compute the similarity measure based on the correlation values. Here, since we use four different matching values obtained from four different directional Gabor wavelet and select the maximum value, it is possible to minimize the recognition error rate. To show the usefulness of the proposed algorithm, we applied it to a biometric database consisting of 300 Iris Patterns extracted from 50 subjects and finally got more higher than $90\%$ recognition rate.

• Journal of KIISE:Databases
• /
• v.34 no.5
• /
• pp.389-395
• /
• 2007

Collaborative filtering is a popular technique for information filtering to reduce information overload and widely used in application such as recommender system in the E-commerce domain. Collaborative filtering systems collect human ratings and provide Predictions based on the ratings of other people who share the same tastes. The quality of predictions depends on the number of items which are commonly rated by people. Therefore, it is difficult to apply pure collaborative filtering algorithm directly to dynamic collections where items are constantly added or removed. In this paper we suggest a method for managing dynamic collections. It creates taste space for items using a technique called Singular Vector Decomposition (SVD) and maintains clusters of core items on the space to estimate relevance of past and future items. To evaluate the proposed method, we divide database of user ratings into those of old and new items and analyze predicted ratings of the latter. And we experimentally show our method is efficiently applied to dynamic collections.

• Journal of Korean Society for Geospatial Information Science
• /
• v.19 no.3
• /
• pp.41-47
• /
• 2011

Processing of the raw LiDAR data requires the high-end processor, because data form is a vector. In contrast, if LiDAR data is converted into a regular grid pattern by filltering, that has advantage of being in a low-cost equipment, because of the simple structure and faster processing speed. Especially, by using grid data classification, such as Quadtree, some of trees and cars are removed, so it has advantage of modeling. Therefore, this study presents the algorithm for automatic extraction of ground points using Quadtree and refion growing method from LiDAR data. In addition, Error analysis was performed based on the 1:5000 digital map of sample area to analyze the classification of ground points. In a result, the ground classification accuracy is over 98%. So it has the advantage of extracting the ground points. In addition, non-ground points, such as cars and tree, are effectively removed as using Quadtree and region growing method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1690-1710
• /
• 2014

In this paper, we propose the rapid implementation of a 3-dimensional (3D) facial reconstruction from a single frontal face image and introduce a design for its application on a mobile device. The proposed system can effectively reconstruct human faces in 3D using an approach robust to lighting conditions, and a fast method based on a Canonical Correlation Analysis (CCA) algorithm to estimate the depth. The reconstruction system is built by first creating 3D facial mapping from a personal identity vector of a face image. This mapping is then applied to real-world images captured with a built-in camera on a mobile device to form the corresponding 3D depth information. Finally, the facial texture from the face image is extracted and added to the reconstruction results. Experiments with an Android phone show that the implementation of this system as an Android application performs well. The advantage of the proposed method is an easy 3D reconstruction of almost all facial images captured in the real world with a fast computation. This has been clearly demonstrated in the Android application, which requires only a short time to reconstruct the 3D depth map.

• Journal of the Institute of Convergence Signal Processing
• /
• v.8 no.1
• /
• pp.63-72
• /
• 2007

Recently, as recognizing the risk about the infection of an infectious wastes, the problems about the management and treatment of the infectious wastes stand out socially. In this paper, as being possible monitoring whole processing from the origin of the infectious waste to the processing plant, using the RFID which is the kernel technology of the next generation, we tried to solve the second infection problem by inefficient treatment of the infectious wastes. Through the research suggesting in this paper, as storing and monitoring the procedural business articles and the problem about miss-writing and input error being found in management system like documentary writing by the existing manager and computation input by the web application, we can understand the management state, immediately. And the Bio information for the personal authentication is carried out through storing the feature vector calculation by the PCA algorithm, into the tag. It suggested more systematic and safer management plan than previous thing, as giving attention about the wastes to manager.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6B
• /
• pp.579-585
• /
• 2002

The investigation into the effect of various feedback errors on system performance can help the robust feedback channel design and transmission of exact feedback channel information as well. In this paper, we address the algorithm that determines space combining weight vector maximizing received signal power at mobile on frequency flat fading channel and investigate the performance degradation by feedback channel delay in the FDD/CDMA systems employing transmit beamforming. We observe the effect of feedback channel delay corresponding to the number of transmit antennas and the temporal/spatial correlation of channel. The results show that performance is more sensitive to feedback delay with the larger number of antennas when fadings at transmit antennas are not spatially correlated.

• Journal of the Korean Data and Information Science Society
• /
• v.12 no.2
• /
• pp.1-10
• /
• 2001

Neural networks we increasingly being seen as an addition to the statistics toolkit which should be considered alongside both classical and modern statistical methods. Neural networks are usually useful for classification and function estimation. In this paper we concentrate on function estimation using neural networks with weight decay factor The use of weight decay seems both to help the optimization process and to avoid overfitting. In this type of neural networks, the problem to decide the number of hidden nodes, weight decay parameter and iteration number of learning is very important. It is called the optimization of weight decay neural networks. In this paper we propose a automatic optimization based on genetic algorithms. Moreover, we compare the weight decay neural network automatically learned according to automatic optimization with ordinary neural network, projection pursuit regression and support vector machines.

• The Journal of the Acoustical Society of Korea
• /
• v.24 no.3
• /
• pp.178-185
• /
• 2005

This paper presents a new music identification method using probabilistic and dynamic characteristics of melody. The propo3ed method uses pitch and MFCC parameters as feature vectors for the characteristics of music notes and represents melody pattern by pitch histogram and temporal sequence of codeword indices. We also propose a new pattern matching method for the hybrid method. We have tested the proposed algorithm in small (drama OST) and broad (1.005 popular songs) search spaces. The experimental results on search areas of OST and 1,005 popular songs showed better performance of the proposed method over conventional methods. We achieved the performance improvement of average $9.9\%$ and $10.2\%$ in error reduction rate on each search area.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.8
• /
• pp.39-47
• /
• 2011

Ergezinger's method, one of the layer-by-layer algorithms used for multilyer perceptrons, consists of an output node and can make premature saturations in the output's weight because of using linear least squared method in the output layer. These saturations are obstacles to learning time and covergence. Therefore, this paper expands Ergezinger's method to be able to use an output vector instead of an output node and introduces a learning rate to improve learning time and convergence. The learning rate is a variable rate that reflects the correlation coefficient between new weight and previous weight while updating hidden's weight. To compare the proposed method with Ergezinger's method, we tested iris recognition and nonlinear approximation. It was found that the proposed method showed better results than Ergezinger's method in learning convergence. In the CPU time considering correlation coefficient computation, the proposed method saved about 35% time than the previous method.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.17 no.4
• /
• pp.386-395
• /
• 2005

With the development of a living standard, the importance of indoor air conditioning system in all kinds of buildings and vehicles has increased. A lot of researches on energy losses in a duct and various kinds of flow pattern in branches or junctions have been carried out over many years, because the primary object of a duct system used in HVAC is to provide equal flow rate in the interior of each room by minimizing pressure drop. In this study, to get equal flow distribution in each branch, a blockage is applied to the rectangular duct system. The flow analysis for flow distribution of a rectangular duct with two branches was performed by CFD. By using SIMPLE algorithm and finite volume method, flow analysis is performed in the case of 3-D, incompressible, turbulent flow. Also, the standard $k-{\varepsilon}$ model and wall function method were used for analysis of turbulent fluid flow. The distribution diagrams of static pressure, velocity vector, turbulent energy and kinetic energy in accordance with variation of Reynolds number and blockages location in a rectangular duct show that flow distribution at duct outlets is improved by a blockage. In this rectangular duct system, mean velocity and flow rate distribution in two branch outlets are nearly constant regardless of variation of Reynolds number, and a flow pattern of the internal duct has a same tendency as well.