• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.11
• /
• pp.1221-1226
• /
• 2014

In an effort to improve the efficiency of the speech recognition, we investigate the effect of the number of phoneme clusters. For this purpose, codebooks of varied number of phoneme clusters are prepared by modified k-means clustering algorithm. The subsequent processing is fuzzy vector quantization (FVQ) and hidden Markov model (HMM) for speech recognition test. The result shows that there are two distinct regimes. For large number of phoneme clusters, the recognition performance is roughly independent of it. For small number of phoneme clusters, however, the recognition error rate increases nonlinearly as it is decreased. From numerical calculation, it is found that this nonlinear regime might be modeled by a power law function. The result also shows that about 166 phoneme clusters would be the optimal number for recognition of 300 isolated words. This amounts to roughly 3 variations per phoneme.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.4
• /
• pp.569-577
• /
• 2018

In this paper, with the aid of information which is included within data, preprocessing algorithm-based black plastic classifier is designed. The slope and area of spectrum obtained by using laser induced breakdown spectroscopy(LIBS) are analyzed for each material and its ensuing information is applied as the input data of the proposed classifier. The slope is represented by the rate of change of wavelength and intensity. Also, the area is calculated by the wavelength of the spectrum peak where the material property of chemical elements such as carbon and hydrogen appears. Using informations such as slope and area, input data of the proposed classifier is constructed. In the preprocessing part of the classifier, Principal Component Analysis(PCA) and fuzzy transform are used for dimensional reduction from high dimensional input variables to low dimensional input variables. Characteristic analysis of the materials as well as the processing speed of the classifier is improved. In the condition part, FCM clustering is applied and linear function is used as connection weight in the conclusion part. By means of Particle Swarm Optimization(PSO), parameters such as the number of clusters, fuzzification coefficient and the number of input variables are optimized. To demonstrate the superiority of classification performance, classification rate is compared by using WEKA 3.8 data mining software which contains various classifiers such as Naivebayes, SVM and Multilayer perceptron.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.64 no.1
• /
• pp.107-112
• /
• 2015

This paper introduces an evolutionary nonlinear regression based compensation technique for the short-range prediction of wind speed using AWS(Automatic Weather Station) data. Development of an efficient MOS(Model Output Statistics) is necessary to correct systematic errors of the model, but a linear regression based MOS is hard to manage an irregular nature of weather prediction. In order to solve the problem, a nonlinear and symbolic regression method using GP(Genetic Programming) is suggested for a development of MOS wind forecast guidance. Also FCM(Fuzzy C-Means) clustering is adopted to mitigate bias of wind speed data. The purpose of this study is to evaluate the accuracy of the estimation by a GP based nonlinear MOS for 3 days prediction of wind speed in South Korean regions. This method is then compared to the UM model and has shown superior results. Data for 2007-2009, 2011 is used for training, and 2012 is used for testing.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.1
• /
• pp.91-96
• /
• 2015

In this study, we introduce robust face recognition system with illumination variation realized with the aid of CT preprocessing method. As preprocessing algorithm, Census Transform(CT) algorithm is used to extract locally facial features under unilluminated condition. The dimension reduction of the preprocessed data is carried out by using $(2D)^2$PCA which is the extended type of PCA. Feature data extracted through dimension algorithm is used as the inputs of proposed radial basis function neural networks. The hidden layer of the radial basis function neural networks(RBFNN) is built up by fuzzy c-means(FCM) clustering algorithm and the connection weights of the networks are described as the coefficients of linear polynomial function. The essential design parameters (including the number of inputs and fuzzification coefficient) of the proposed networks are optimized by means of artificial bee colony(ABC) algorithm. This study is experimented with both Yale Face database B and CMU PIE database to evaluate the performance of the proposed system.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.1
• /
• pp.195-201
• /
• 2014

In this study, face recognition system was designed based on polynomial Radial Basis Function Neural Networks(pRBFNNs) pattern classifier using 2-directional 2-dimensional principal component analysis algorithm. Existing one dimensional PCA leads to the reduction of dimension of image expressed by the multiplication of rows and columns. However $(2D)^2PCA$(2-Directional 2-Dimensional Principal Components Analysis) is conducted to reduce dimension to each row and column of image. and then the proposed intelligent pattern classifier evaluates performance using reduced images. The proposed pRBFNNs consist of three functional modules such as the condition part, the conclusion part, and the inference part. In the condition part of fuzzy rules, input space is partitioned with the aid of fuzzy c-means clustering. In the conclusion part of rules. the connection weight of RBFNNs is represented as the linear type of polynomial. The essential design parameters (including the number of inputs and fuzzification coefficient) of the networks are optimized by means of Differential Evolution. Using Yale and AT&T dataset widely used in face recognition, the recognition rate is obtained and evaluated. Additionally IC&CI Lab dataset is experimented with for performance evaluation.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.39 no.1
• /
• pp.25-30
• /
• 2016

It is critical to forecast the maximum daily and monthly demand for power with as little error as possible for our industry and national economy. In general, long-term forecasting of power demand has been studied from both the consumer's perspective and an econometrics model in the form of a generalized linear model with predictors. Time series techniques are used for short-term forecasting with no predictors as predictors must be predicted prior to forecasting response variables and containing estimation errors during this process is inevitable. In previous researches, seasonal exponential smoothing method, SARMA (Seasonal Auto Regressive Moving Average) with consideration to weekly pattern Neuron-Fuzzy model, SVR (Support Vector Regression) model with predictors explored through machine learning, and K-means clustering technique in the various approaches have been applied to short-term power supply forecasting. In this paper, SARMA and intervention model are fitted to forecast the maximum power load daily, weekly, and monthly by using the empirical data from 2011 through 2013. $ARMA(2,\;1,\;2)(1,\;1,\;1)_7$ and $ARMA(0,\;1,\;1)(1,\;1,\;0)_{12}$ are fitted respectively to the daily and monthly power demand, but the weekly power demand is not fitted by AREA because of unit root series. In our fitted intervention model, the factors of long holidays, summer and winter are significant in the form of indicator function. The SARMA with MAPE (Mean Absolute Percentage Error) of 2.45% and intervention model with MAPE of 2.44% are more efficient than the present seasonal exponential smoothing with MAPE of about 4%. Although the dynamic repression model with the predictors of humidity, temperature, and seasonal dummies was applied to foretaste the daily power demand, it lead to a high MAPE of 3.5% even though it has estimation error of predictors.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.62 no.5
• /
• pp.696-704
• /
• 2013

In this paper, we introduce the LED emotional lighting system realized with the aid of both intelligent algorithm and RGB LED combined with White LED. Generally, the illumination is known as a design factor to form the living place that affects human's emotion and action in the light- space as well as the purpose to light up the specific space. The LED emotional lighting system that can express emotional atmosphere as well as control the quantity of light is designed by using both RGB LED to form the emotional mood and W LED to get sufficient amount of light. RBFNNs is used as the intelligent algorithm and the network model designed with the aid of LED control parameters (viz. color coordinates (x and y) related to color temperature, and lux as inputs, RGBW current as output) plays an important role to build up the LED emotional lighting system for obtaining appropriate color space. Unlike conventional RBFNNs, Fuzzy C-Means(FCM) clustering method is used to obtain the fitness values of the receptive function, and the connection weights of the consequence part of networks are expressed by polynomial functions. Also, the parameters of RBFNN model are optimized by using PSO(Particle Swarm Optimization). The proposed LED emotional lighting can save the energy by using the LED light source and improve the ability to work as well as to learn by making an adequate mood under diverse surrounding conditions.

• Journal of Biomedical Engineering Research
• /
• v.25 no.5
• /
• pp.323-328
• /
• 2004

The development of group-specific tissue probability maps (TPM) provides a priori knowledge for better result of cerebral tissue classification with regard to the inter-ethnic differences of inter-subject variability. We present sequential procedures of group-specific TPM and evaluate the age effects in the structural differences of TPM. We investigated 100 healthy volunteers with high resolution MRI scalming. The subjects were classified into young (60, 25.92+4.58) and old groups (40, 58.83${\pm}$8.10) according to the age. To avoid any bias from random selected single subject and improve registration robustness, average atlas as target for TPM was constructed from skull-stripped whole data using linear and nonlinear registration of AIR. Each subject was segmented into binary images of gray matter, white matter, and cerebrospinal fluid using fuzzy clustering and normalized into the space of average atlas. The probability images were the means of these binary images, and contained values in the range of zero to one. A TPM of a given tissue is a spatial probability distribution representing a certain subject population. In the spatial distribution of tissue probability according to the threshold of probability, the old group exhibited enlarged ventricles and overall GM atrophy as age-specific changes, compared to the young group. Our results are generally consistent with the few published studies on age differences in the brain morphology. The more similar the morphology of the subject is to the average of the population represented by the TPM, the better the entire classification procedure should work. Therefore, we suggest that group-specific TPM should be used as a priori information for the cerebral tissue classification.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.6
• /
• pp.21-28
• /
• 2013

This paper proposes an effective fire detection approach that includes the following multiple heterogeneous algorithms: moving region detection using grey level histograms, color segmentation using fuzzy c-means clustering (FCM), feature extraction using a grey level co-occurrence matrix (GLCM), and fire classification using support vector machine (SVM). The proposed approach determines the optimal threshold values based on grey level histograms in order to detect moving regions, and then performs color segmentation in the CIE LAB color space by applying the FCM. These steps help to specify candidate regions of fire. We then extract features of fire using the GLCM and these features are used as inputs of SVM to classify fire or non-fire. We evaluate the proposed approach by comparing it with two state-of-the-art fire detection algorithms in terms of the fire detection rate (or percentages of true positive, PTP) and the false fire detection rate (or percentages of true negative, PTN). Experimental results indicated that the proposed approach outperformed conventional fire detection algorithms by yielding 97.94% for PTP and 4.63% for PTN, respectively.