• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.12
• /
• pp.2352-2360
• /
• 2011

In this paper, we introduce a comprehensive design methodology of Radial Basis Function Neural Networks (RBFNN) that is based on mechanism of clustering and optimization algorithm. We can divide some clusters based on similarity of input dataset by using clustering algorithm. As a result, the number of clusters is equal to the number of nodes in the hidden layer. Moreover, the centers of each cluster are used into the centers of each receptive field in the hidden layer. In this study, we have applied Fuzzy-C Means(FCM) and K-Means(KM) clustering algorithm, respectively and compared between them. The weight connections of model are expanded into the type of polynomial functions such as linear and quadratic. In this reason, the output of model consists of relation between input and output. In order to get the optimal structure and better performance, Particle Swarm Optimization(PSO) is used. We can obtain optimized parameters such as both the number of clusters and the polynomial order of weights connection through structural optimization as well as the widths of receptive fields through parametric optimization. To evaluate the performance of proposed model, NXT equipment offered by National Instrument(NI) is exploited. The situation awareness system-related intelligent model was built up by the experimental dataset of distance information measured between object and diverse sensor such as sound sensor, light sensor, and ultrasonic sensor of NXT equipment.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10a
• /
• pp.535-538
• /
• 2001

Since 1990s, many literatures have shown that connectionist models, such as back propagation, recurrent network, and RBF (Radial Basis Function) outperform the traditional models, MA (Moving Average), AR (Auto Regressive), and ARIMA (Auto Regressive Integrated Moving Average) in time series prediction. Neural based approaches to time series prediction require the enough length of historical measurements to generate the enough number of training patterns. The more training patterns, the better the generalization of MLP is. The researches about the schemes of generating artificial training patterns and adding to the original ones have been progressed and gave me the motivation of developing VTG schemes in 1996. Virtual term is an estimated measurement, X(t+0.5) between X(t) and X(t+1), while the given measurements in the series are called actual terms. VTG (Virtual Tern Generation) is the process of estimating of X(t+0.5), and VTG schemes are the techniques for the estimation of virtual terms. In this paper, the alternative VTG schemes to the VTG schemes proposed in 1996 will be proposed and applied to multivariate time series prediction. The VTG schemes proposed in 1996 are called deterministic VTG schemes, while the alternative ones are called stochastic VTG schemes in this paper.

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

The general solution for classification and regression problems can be found by matching and modifying matrices with the information in real world and then these matrices are teaming in neural networks. This paper treats primary space as a real world, and dual space that Primary space matches matrices using kernel. In practical study, there are two kinds of problems, complete system which can get an answer using inverse matrix and ill-posed system or singular system which cannot get an answer directly from inverse of the given matrix. Further more the problems are often given by the latter condition; therefore, it is necessary to find regularization parameter to change ill-posed or singular problems into complete system. This paper compares each performance under both classification and regression problems among GCV, L-Curve, which are well known for getting regularization parameter, and kernel methods. Both GCV and L-Curve have excellent performance to get regularization parameters, and the performances are similar although they show little bit different results from the different condition of problems. However, these methods are two-step solution because both have to calculate the regularization parameters to solve given problems, and then those problems can be applied to other solving methods. Compared with UV and L-Curve, kernel methods are one-step solution which is simultaneously teaming a regularization parameter within the teaming process of pattern weights. This paper also suggests dynamic momentum which is leaning under the limited proportional condition between learning epoch and the performance of given problems to increase performance and precision for regularization. Finally, this paper shows the results that suggested solution can get better or equivalent results compared with GCV and L-Curve through the experiments using Iris data which are used to consider standard data in classification, Gaussian data which are typical data for singular system, and Shaw data which is an one-dimension image restoration problems.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.39 no.1
• /
• pp.76-84
• /
• 2002

In this paper, it is studied to remove the baseline wander and to minimize the distortion of ST segment in the noise filtering of ECG. In general, the standard filter and adaptive filter are used to remove the baseline wander of the ECG. But the standard filter is limited because the frequency of the baseline signal is variable and the apative filter is difficult to select the reference signal in case of using the adaptive filter. So we proposed a new method of the structure without reference signal using neural networks. To be convinced of the performance of this method, we used ECG data of MIT-BIHs. and obtained the result of the high performance,(-53.3[dB]) than standard filter(-16.3[dB]) and adaptive filter (-44.9[dB]).

• Imaging Science in Dentistry
• /
• v.43 no.3
• /
• pp.153-161
• /
• 2013

Purpose: To prevent low bone mineral density (BMD), that is, osteoporosis, in postmenopausal women, it is essential to diagnose osteoporosis more precisely. This study presented an automatic approach utilizing a histogram-based automatic clustering (HAC) algorithm with a support vector machine (SVM) to analyse dental panoramic radiographs (DPRs) and thus improve diagnostic accuracy by identifying postmenopausal women with low BMD or osteoporosis. Materials and Methods: We integrated our newly-proposed histogram-based automatic clustering (HAC) algorithm with our previously-designed computer-aided diagnosis system. The extracted moment-based features (mean, variance, skewness, and kurtosis) of the mandibular cortical width for the radial basis function (RBF) SVM classifier were employed. We also compared the diagnostic efficacy of the SVM model with the back propagation (BP) neural network model. In this study, DPRs and BMD measurements of 100 postmenopausal women patients (aged >50 years), with no previous record of osteoporosis, were randomly selected for inclusion. Results: The accuracy, sensitivity, and specificity of the BMD measurements using our HAC-SVM model to identify women with low BMD were 93.0% (88.0%-98.0%), 95.8% (91.9%-99.7%) and 86.6% (79.9%-93.3%), respectively, at the lumbar spine; and 89.0% (82.9%-95.1%), 96.0% (92.2%-99.8%) and 84.0% (76.8%-91.2%), respectively, at the femoral neck. Conclusion: Our experimental results predict that the proposed HAC-SVM model combination applied on DPRs could be useful to assist dentists in early diagnosis and help to reduce the morbidity and mortality associated with low BMD and osteoporosis.

• IEIE Transactions on Smart Processing and Computing
• /
• v.6 no.1
• /
• pp.10-17
• /
• 2017

We propose classification algorithms for human and dog movement. The proposed algorithms use micro-Doppler signals obtained from humans and dogs moving in four different directions. A two-stage classifier based on a support vector machine (SVM) is proposed, which uses a radial-based function (RBF) kernel and $16^{th}$-order linear predictive code (LPC) coefficients as feature vectors. With the proposed algorithms, we obtain the best classification results when a first-level SVM classifies the type of movement, and then, a second-level SVM classifies the moving object. We obtain the correct classification probability 95.54% of the time, on average. Next, to deal with the difficult classification problem of human and dog running, we propose a two-layer convolutional neural network (CNN). The proposed CNN is composed of six ($6{\times}6$) convolution filters at the first and second layers, with ($5{\times}5$) max pooling for the first layer and ($2{\times}2$) max pooling for the second layer. The proposed CNN-based classifier adopts an auto regressive spectrogram as the feature image obtained from the $16^{th}$-order LPC vectors for a specific time duration. The proposed CNN exhibits 100% classification accuracy and outperforms the SVM-based classifier. These results show that the proposed classifiers can be used for human and dog classification systems and also for classification problems using data obtained from an ultra-wideband (UWB) sensor.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.6
• /
• pp.2168-2187
• /
• 2021

The smart grid replaces the traditional power structure with information inventiveness that contributes to a new physical structure. In such a field, malicious information injection can potentially lead to extreme results. Incorrect, FDI attacks will never be identified by typical residual techniques for false data identification. Most of the work on the detection of FDI attacks is based on the linearized power system model DC and does not detect attacks from the AC model. Also, the overwhelming majority of current FDIA recognition approaches focus on FDIA, whilst significant injection location data cannot be achieved. Building on the continuous developments in deep learning, we propose a Deep Learning based Locational Detection technique to continuously recognize the specific areas of FDIA. In the development area solver gap happiness is a False Data Detector (FDD) that incorporates a Convolutional Neural Network (CNN). The FDD is established enough to catch the fake information. As a multi-label classifier, the following CNN is utilized to evaluate the irregularity and cooccurrence dependency of power flow calculations due to the possible attacks. There are no earlier statistical assumptions in the architecture proposed, as they are "model-free." It is also "cost-accommodating" since it does not alter the current FDD framework and it is only several microseconds on a household computer during the identification procedure. We have shown that ANN-MLP, SVM-RBF, and CNN can conduct locational detection under different noise and attack circumstances through broad experience in IEEE 14, 30, 57, and 118 bus systems. Moreover, the multi-name classification method used successfully improves the precision of the present identification.