• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.64 no.6
• /
• pp.922-934
• /
• 2015

In this paper, The classification between precipitation echo(PRE) and non-precipitation echo(N-PRE) (including ground echo and clear echo) is carried out from weather radar data using neuro-fuzzy algorithm. In order to classify between PRE and N-PRE, Input variables are built up through characteristic analysis of radar data. First, the event classifier as the first classification step is designed to classify precipitation event and non-precipitation event using input variables of RBFNNs such as DZ, DZ of Frequency(DZ_FR), SDZ, SDZ of Frequency(SDZ_FR), VGZ, VGZ of Frequency(VGZ_FR). After the event classification, in the precipitation event including non-precipitation echo, the non-precipitation echo is completely removed by the echo classifier of the second classifier step that is built as Type-2 FCM based RBFNNs. Also, parameters of classification system are acquired for effective performance using PSO(Particle Swarm Optimization). The performance results of the proposed echo classifier are compared with CZ. In the sequel, the proposed model architectures which use event classifier as well as the echo classifier of Interval Type-2 FCM based RBFNN show the superiority of output performance when compared with the conventional echo classifier based on RBFNN.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.6
• /
• pp.828-835
• /
• 2008

We present a novel method for eye location by means of a two-level classifier scheme. Locating the eye by machine-inspection of an image or video is an important problem for Computer Vision and is of particular value to applications in biomedical imaging. Our method aims to overcome the significant challenge of an eye-location that is able to maintain high accuracy by disregarding highly variable changes in the environment. A first level of computational analysis processes this image context. This is followed by object detection by means of a two-class discrimination classifier(second algorithmic level).We have tested our eye location system using FERET and BioID database. We compare the performance of two-level classifier with that of non-level classifier, and found it's better performance.

• Management Science and Financial Engineering
• /
• v.3 no.1
• /
• pp.39-56
• /
• 1997

This paper applies the binary tree classifier and discriminant analysis methods to predicting failures of banks and insurance companies. In this study, discriminant analysis is generally better than the binary tree classifier in the classification of bank defaults; the binary tree is generally better than discriminant analysis in the classification of insurance company defaults. This situation can be explained that the performance of a classifier depends on the characteristics of the data. If the data are dispersed appropriately for the classifier, the classifier will show a good performance. Otherwise, it may show a poor performance. The two data sets (bank and insurance) are analyzed to explain the better performance of the binary tree in insurance and the worse performance in bank; the better performance of discriminant analysis in bank and the worse performance in insurance.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.2
• /
• pp.71-79
• /
• 1997

In this paper, we propose a new nearest-neighbor classifier with reduced computational complexity in search process. In the proposed classifier, the classes are divided into two sets: reference and non-reference sets. It reduces computational requriement by approximating the distance between the input and a class iwth the information of distances among the calsses. It calculates only the distance between the input and the reference classes. We convert a given classifier into RCC (reduced computational complexity but smal lincrease in misclassification probability of its corresponding RCC classifier. We designed RCC classifiers for the recognition of digits from the NIST database. We obtained an RCC classifier with 60% reduction in the computational complexity with the cost of 0.5% increase in misclassification probability.

• International journal of advanced smart convergence
• /
• v.10 no.3
• /
• pp.51-58
• /
• 2021

In this paper, we propose a deep learning classifier for estimating the number of layers in the Earth's structure. When installing a grounding system, knowledge of the subsurface in the area is absolutely necessary. The subsurface structure can be modeled by the earth parameters. Knowing the exact number of layers can significantly reduce the amount of computation to estimate these parameters. The classifier consists of a feedforward neural network. Apparent resistivity curves were used to train the deep learning classifier. The apparent resistivity at 20 equally spaced log points in each curve are used as the features for the input of the deep learning classifier. Apparent resistivity curve data sets are collected either by theoretical calculations or by Wenner's measurement method. Deep learning classifiers are coded by Keras, an open source neural network library written in Python. This model has been shown to converge with close to 100% accuracy.

• KIISE Transactions on Computing Practices
• /
• v.23 no.7
• /
• pp.408-416
• /
• 2017

This paper proposes a real-time side-rear vehicle detection algorithm that detects vehicles quickly and accurately in blind spot areas when driving. The proposed algorithm uses a cascade classifier created by AdaBoost Learning using the MCT (modified census transformation) feature vector. Using this classifier, the smaller the detection window, the faster the processing speed of the MCT classifier, and the larger the detection window, the greater the accuracy of the MCT classifier. By considering these characteristics, the proposed algorithm uses two classifiers with different detection window sizes. The first classifier quickly generates candidates with a small detection window. The second classifier accurately verifies the generated candidates with a large detection window. Furthermore, the vehicle classifier and the wheel classifier are simultaneously used to effectively detect a vehicle entering the blind spot area, along with an adjacent vehicle in the blind spot area.

• Journal of KIISE:Software and Applications
• /
• v.34 no.9
• /
• pp.857-868
• /
• 2007

The good classifier ensemble should have a high complementarity among classifiers in order to produce a high recognition rate and its size is small in order to be efficient. This paper proposes a classifier ensemble selection algorithm with coarse-to-fine stages. for the algorithm to be successful, the original classifier pool should be sufficiently diverse. This paper produces a large classifier pool by combining several different classification algorithms and lots of feature subsets. The aim of the coarse selection is to reduce the size of classifier pool with little sacrifice of recognition performance. The fine selection finds near-optimal ensemble using genetic algorithms. A hybrid genetic algorithm with improved searching capability is also proposed. The experimentation uses the worldwide handwritten numeral databases. The results showed that the proposed algorithm is superior to the conventional ones.

• Journal of KIISE:Software and Applications
• /
• v.30 no.3_4
• /
• pp.339-346
• /
• 2003

This paper proposes a multiple classifier system having massive micro classifiers. The micro classifiers are trained by using a local set of training patterns. The k nearest neighboring training patterns of one training pattern comprise the local region for training a micro classifier. Each training pattern is incorporated with one or more micro classifiers. Two types of micro classifiers are adapted in this paper. SVM with linear kernel and SVM with RBF kernel. Classification is done by selecting the best micro classifier among the micro classifiers in vicinity of incoming test pattern. To measure the goodness of each micro classifier, the weighted sum of correctly classified training patterns in vicinity of the test pattern is used. Experiments have been done on Elena database. Results show that the proposed method gives better classification accuracy than any conventional classifiers like SVM, k-NN and the conventional classifier combination/selection scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.4C
• /
• pp.425-432
• /
• 2007

In this paper, we deals with automatic modulation classification capable of classifying incident signals without a priori information. The 7 key features which have good properties of sensitive with modulation types and insensitive with SNR variation are selected. The numerical simulations for classifying 9 modulation types using the these features are performed. The numerical simulations of the 4 types of modulation classifiers are performed the investigation of classification accuracy and execution time to implement the fast modulation classifier in software radio. The simulation result indicated that the execution time of DTC was best and SVC and MDC showed good classification performance. The prototype was implemented with DTC type. With the result of field trials, we confirmed the performance in the prototype was agreed with the numerical simulation result of DTC.

• Journal of Digital Convergence
• /
• v.11 no.11
• /
• pp.409-414
• /
• 2013

Naive Bayesian classifiers are a powerful and well-known type of classifiers that can be easily induced from a dataset of sample cases. However, the strong conditional independence assumptions can sometimes lead to weak classification performance. Normally, naive Bayesian classifiers use Gaussian distributions to handle continuous attributes and to represent the likelihood of the features conditioned on the classes. The probability density of attributes, however, is not always well fitted by a Gaussian distribution. Another eminent type of classifier is the neuro-fuzzy classifier, which can learn fuzzy rules and fuzzy sets using supervised learning. Since there are specific structural similarities between a neuro-fuzzy classifier and a naive Bayesian classifier, the purpose of this study is to apply learning distribution graphs constructed by a neuro-fuzzy network to naive Bayesian classifiers. We compare the Gaussian distribution graphs with the fuzzy distribution graphs for the naive Bayesian classifier. We applied these two types of distribution graphs to classify leukemia and colon DNA microarray data sets. The results demonstrate that a naive Bayesian classifier with fuzzy distribution graphs is more reliable than that with Gaussian distribution graphs.