• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.4
• /
• pp.482-486
• /
• 2010

Recently, gesture recognition methods based on dynamic time warping (DTW) have been actively investigated as more mobile devices have equipped the accelerometer. DTW has no additional training step since it uses given samples as the matching templates. However, it is difficult to apply the DTW on mobile environments because of its computational complexity of matching step where the input pattern has to be compared with every templates. In order to address the problem, this paper proposes a gesture recognition method based on DTW that uses localized subset of templates. Here, the k-means clustering algorithm is used to divide each class into subclasses in which the most centered sample in each subclass is employed as the localized template. It increases the recognition speed by reducing the number of matches while it minimizes the errors by preserving the diversities of the training patterns. Experimental results showed that the proposed method was about five times faster than the DTW with all training samples, and more stable than the randomly selected templates.

• Transactions on Control, Automation and Systems Engineering
• /
• v.2 no.1
• /
• pp.40-46
• /
• 2000

In this paper, a transient identification based on a Hidden Markov Model (HMM) has been suggested and evaluated experimentally for the classification of transients in the dynamic process. The transient can be identified by its unique time dependent patterns related to the principal variables. The HMM, a double stochastic process, can be applied to transient identification which is a spatial and temporal classification problem under a statistical pattern recognition framework. The HMM is created for each transient from a set of training data by the maximum-likelihood estimation method. The transient identification is determined by calculating which model has the highest probability for the given test data. Several experimental tests have been performed with normalization methods, clustering algorithms, and a number of states in HMM. Several experimental tests have been performed including superimposing random noise, adding systematic error, and untrained transients. The proposed real-time transient identification system has many advantages, however, there are still a lot of problems that should be solved to apply to a real dynamic process. Further efforts are being made to improve the system performance and robustness to demonstrate reliability and accuracy to the required level.

• Smart Structures and Systems
• /
• v.21 no.4
• /
• pp.421-433
• /
• 2018

Carbon fiber reinforced polymer (CFRP) cable has good mechanical properties and corrosion resistance. However, the anchorage of CFRP cable is a big issue due to the anisotropic property of CFRP material. In this article, a high-efficient bonding anchorage with novel configuration is developed for CFRP cables. The acoustic emission (AE) technique is employed to evaluate the performance of anchorage in the fatigue test and post-fatigue ultimate bearing capacity test. The obtained AE signals are analyzed by using a combination of unsupervised K-means clustering and supervised K-nearest neighbor classification (K-NN) for quantifying the performance of the anchorage and damage evolutions. An AE feature vector (including both frequency and energy characteristics of AE signal) for clustering analysis is proposed and the under-sampling approaches are employed to regress the influence of the imbalanced classes distribution in AE dataset for improving clustering quality. The results indicate that four classes exist in AE dataset, which correspond to the shear deformation of potting compound, matrix cracking, fiber-matrix debonding and fiber fracture in CFRP bars. The AE intensity released by the deformation of potting compound is very slight during the whole loading process and no obvious premature damage observed in CFRP bars aroused by anchorage effect at relative low stress level, indicating the anchorage configuration in this study is reliable.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.2
• /
• pp.398-405
• /
• 2006

We propose a pattern classification model using a selective perception ability of human beings. Generally, human beings recognize an object by putting a selective concentration on it in the region of interest. Much better classification and recognition could be possible by adapting this phenomenon in pattern classification. First, the pattern classification model creates some reference cluster patterns in a usual way. Then it generates an SPM(Selective Perception Map) that reflects the mutual relation of the reference cluster patterns. In the recognition phase, the model applies the SPM as a weight for calculating the distance between an input pattern and the reference patterns. Our experiments show that the proposed classifier with the SPM acquired the better results than other approaches in pattern classification.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.11
• /
• pp.1536-1544
• /
• 1995

We propose a design scheme of a binary decision tree and apply it to the tire tread pattern recognition problem. In this scheme, a binary decision tree is constructed by using fuzzy C-means( FCM ) algorithm. All the available features are used while clustering. At each node, the best feature or feature subset among these available features is selected based on proposed similarity measure. The decision tree can be used for the classification of unknown patterns. The proposed design scheme is applied to the tire tread pattern recognition problem. The design procedure including feature extraction is described. Experimental results are given to show the usefulness of this scheme.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.39
• /
• pp.47-61
• /
• 1996

We propose a parallel neural network model in which patterns are clustered and patterns in a cluster are studied in a parallel neural network. The learning algorithm used in this paper is based on LVQ algorithm of Kohonen(1990) for clustering and ADALINE(Adaptive Linear Neuron) network of Widrow and Hoff(1990) for parallel learning. The proposed algorithm consists of two parts. First, N patterns to be learned are categorized into C clusters by LVQ clustering algorithm. Second, C patterns that was selected from each cluster of C are learned as input pattern of ADALINE(Adaptive Linear Neuron). Data used in this paper consists of 250 patterns of ASCII characters normalized into $8\times16$ and 1124. The proposed algorithm consists of two parts. First, N patterns to be learned are categorized into C clusters by LVQ clustering algorithm. Second, C patterns that was selected from each cluster of C are learned as input pattern of ADALINE(Adaptive Linear Neuron). Data used in this paper consists 250 patterns of ASCII characters normalized into $8\times16$ and 1124 samples acquired from signals generated from 9 car models that passed Inductive Loop Detector(ILD) at 10 points. In ASCII character experiment, 191(179) out of 250 patterns are recognized with 3%(5%) noise and with 1124 car model data. 807 car models were recognized showing 71.8% recognition ratio. This result is 10.2% improvement over backpropagation algorithm.

• Journal of Service Research and Studies
• /
• v.3 no.2
• /
• pp.53-60
• /
• 2013

Datamining from the large data in the form of various techniques for obtaining information have been developed. In recent years one of the most sought areas of pattern recognition and machine learning method is created with most of existing learning algorithms based on categorical attributes to a rule or decision model. However, the real-world data, it may consist of numeric attributes in many cases. In addition it contains attributes with numerical values to the normal categorical attribute. In this case, therefore, it is required processes in order to use the data to learn an appropriate value for the type attribute. In this paper, the domain of the numeric attributes are divided into several segments using learning algorithm techniques of discritization. It is described Clustering with other data mining techniques. Large amount of first cluster with characteristics is similar records from the database into smaller groups that split multiple given finite patterns in the pattern space. It is close to each other of a set of patterns that together make up a bunch. Among the set without specifying a particular category in a given data by extracting a pattern. It will be described similar grouping of data clustering technique to classify the data.

• Journal of Korean Society for Quality Management
• /
• v.39 no.1
• /
• pp.98-108
• /
• 2011

Clustering is an useful method to classify objects into subsets that have some meaning in the context of a particular problem and has been applied in variety of fields, customer relationship management, data mining, pattern recognition, and biotechnology etc. This paper addresses the unknown K clustering problems and presents a new approach based on a coevolutionary algorithm to solve it. Coevolutionary algorithms are known as very efficient tools to solve the integrated optimization problems with high degree of complexity compared to classical ones. The problem considered in this paper can be divided into two sub-problems; finding the number of clusters and classifying the data into these clusters. To apply to coevolutionary algorithm, the framework of algorithm and genetic elements suitable for the sub-problems are proposed. Also, a neighborhood-based evolutionary strategy is employed to maintain the population diversity. To analyze the proposed algorithm, the experiments are performed with various test-bed problems which are grouped into several classes. The experimental results confirm the effectiveness of the proposed algorithm.

• The KIPS Transactions:PartB
• /
• v.13B no.4 s.107
• /
• pp.439-448
• /
• 2006

Previous recognition/clustering algorithms such as Kohonen SOM(Self-Organizing Map), MLP(Multi-Layer Percecptron) and SVM(Support Vector Machine) might not adapt to unexpected input pattern. And it's recognition rate depends highly on the complexity of own training patterns. We could make up for and improve the weak points with lowering complexity of original problem without losing original characteristics. There are so many ways to lower complexity of the problem, and we chose a kernel concepts as an approach to do it. In this paper, using a kernel concepts, original data are mapped to hyper-dimension space which is near infinite dimension. Therefore, transferred data into the hyper-dimension are distributed spasely rather than originally distributed so as to guarantee the rate to be risen. Estimating ratio of recognition is based on a new similarity-probing and learning method that are proposed in this paper. Using CEDAR DB which data is written in cursive letters, 0 to 9, we compare a recognition/clustering performance of kSOM that is proposed in this paper with previous SOM.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.3
• /
• pp.217-222
• /
• 2015

Clustering is one of important data mining techniques known as exploratory data analysis and is being applied in various engineering and scientific fields such as pattern recognition, remote sensing, and so on. The method organizes data by abstracting underlying structure either as a grouping of individuals or as a hierarchy of groups. Weather radar observes atmospheric objects by utilizing reflected signals and stores observed data in corresponding coordinate. To analyze the radar data, it is needed to be separately organized precipitation and non-precipitation echo based on similarities. Thus, this paper studies to apply clustering method to radar data. In addition, in order to solve the problem when precipitation echo locates close to non-precipitation echo, fuzzy logic based clustering method which can consider both distance and other properties such as reflectivity and Doppler velocity is suggested in this paper. By using actual cases, the suggested clustering method derives better results than previous method in near-located precipitation and non-precipitation echo case.