• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.7
• /
• pp.32-45
• /
• 1995

In this paper, we present a new method to tool path planning problem for rough cut of pocket milling operations. The key idea is to formulate the tool path problem into a TSP (Travelling Salesman Problem) so that the powerful neural network approach can be effectively applied. Specifically, our method is composed of three procedures: a) discretization of the pocket area into a finite number of tool points, b) neural network approach (called SOM-Self Organizing Map) for path finding, and c) postprocessing for path smoothing and feedrate adjustment. By the neural network procedure, an efficient tool path (in the sense of path length and tool retraction) can be robustly obtained for any arbitrary shaped pockets with many islands. In the postprocessing, a) the detailed shape of the path is fine tuned by eliminating sharp corners of the path segments, and b) any cross-overs between the path segments and islands. With the determined tool path, the feedrate adjustment is finally performed for legitimate motion without requiring excessive cutting forces. The validity and powerfulness of the algorithm is demonstrated through various computer simulations and real machining.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.16 no.3
• /
• pp.525-532
• /
• 2021

In the ocean, it is difficult to separate the effects of one cause due to the multiple causes, but the self-organizing map can be analyzed by adding other factors to the cluster result. Therefore, in this study, the results of the clustering of sea level data were applied to sea surface temperature. Sea level data was clustered into a total of 6 nodes. The difference between sea surface temperature and sea level height has a one-month delay, which applied sea surface temperature data a month ago to the clustered results. As a result of comparing the mean of sea surface temperature of 140 to 150°E, where the sea surface temperature was variously distributed, in the case of nodes 1, 3, and 5, it was possible to find a meandering sea surface temperature distribution that is clearly distinguished from the sea level data. While nodes 2, 4 and 6, the sea surface temperature distribution was smooth. In this study, sea surface temperature data were applied to the clustered results of sea level data, but later it is necessary to apply wind or geostrophic velocity data to compare.

• Journal of Korea Water Resources Association
• /
• v.41 no.10
• /
• pp.995-1007
• /
• 2008

Studies on modeling the rainfall-runoff relationship which shows nonlinear trend strongly use artificial neural networks theory not only for the prediction but also for the characteristics analysis of the data used by pattern classification. For the pattern classification, the results from Self-Organizing Map (SOM) mention that the map size and array for the SOM training have significantly influenced on the SOM performance. Since there is no deterministic method or theoretical equation to determine the number of rows and columns for the map size, hexagonal array is generally used for the map array. Therefore, this study present a determination of the optimized map structure for the rainfall-runoff analysis in Naju station considering the map size and array simultaneously which can represent the classified characterization of rainfall-runoff relationship. The result showed that the map size of 20$\times$16 hexagonal array with 8-clustered patterns was selected as an appropriate map structure for rainfall-runoff analysis in Naju station.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.1
• /
• pp.22-30
• /
• 2011

Plane detection is very important information for mission-critical of robot in 3D environment. A representative method of plane detection is Hough-transformation. Hough-transformation is robust to noise and makes the accurate plane detection possible. But it demands excessive memory and takes too much processing time. Iterative randomized Hough-transformation has been proposed to overcome these shortcomings. This method doesn't vote all data. It votes only one value of the randomly selected data into the Hough parameter space. This value calculated the value of the parameter of the shape that we want to extract. In Hough parameters space, it is possible to detect accurate plane through detection of repetitive maximum value. A common problem in these methods is that it requires too much computational cost and large number of memory space to find the distribution of mixed multiple planes in parameter space. In this paper, we detect multiple planes only via data sampling using Self Organizing Map method. It does not use conventional methods that include transforming to Hough parameter space, voting and repetitive plane extraction. And it improves the reliability of plane detection through division area searching and planarity evaluation. The proposed method is more accurate and faster than the conventional methods which is demonstrated the experiments in various conditions.

• The Korean Journal of Applied Statistics
• /
• v.24 no.6
• /
• pp.1077-1094
• /
• 2011

We accomplish clustering analyses for yeast cell cycle microarray expression data. To reflect the characteristics of a time-course data, we screen the genes using the test statistics with Fourier coefficients applying a FDR procedure. We compare the results done by model-based clustering, K-means, PAM, SOM, hierarchical Ward method and Fuzzy method with the yeast data. As the validity measure for clustering results, connectivity, Dunn index and silhouette values are computed and compared. A biological interpretation with GO analysis is also included.

• The Journal of the Acoustical Society of Korea
• /
• v.13 no.6
• /
• pp.83-90
• /
• 1994

In this paper, we propose a new learning algorithm, ASOFM(Adaptive Self Organizing Feature Map), to solve the defects of Kohonen's Self Organiaing Feature Map. Kohonen's algorithm is sometimes stranded on local minima for the initial weights. The proposed algorithm uses an object function which can evaluate the state of network in learning and adjusts the learning rate adaptively according to the evaluation of the object function. As a result, it is always guaranteed that the state of network is converged to the global minimum value and it has a capacity of generalized learning by adaptively. It is reduce that the learning time of our algorithm is about $30\%$ of Kohonen's.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2003.10a
• /
• pp.170-177
• /
• 2003

Gene expression data are the quantitative measurements of expression levels and ratios of numberous genes in different situations based on microarray image analysis results. The process to draw meaningful information related to genomic diseases and various biological activities from gene expression data is known as gene expression data analysis. In this paper, we present a hierarchical clustering method of gene expression data based on self organizing map which can analyze the clustering result of gene expression data more efficiently. Using our proposed method, we could eliminate the uncertainty of cluster boundary which is the inherited disadvantage of self organizing map and use the visualization function of hierarchical clustering. And, we could process massive data using fast processing speed of self organizing map and interpret the clustering result of self organizing map more efficiently and user-friendly. To verify the efficiency of our proposed algorithm, we performed tests with following 3 data sets, animal feature data set, yeast gene expression data and leukemia gene expression data set. The result demonstrated the feasibility and utility of the proposed clustering algorithm.

• Journal of KIISE:Software and Applications
• /
• v.30 no.7_8
• /
• pp.713-718
• /
• 2003

The CONDENSATION (Conditional Density Propagation) algorithm has a robust tracking performance and suitability for real-time implementation. However, the CONDENSATION tracker has some difficulties with real-time implementation for multiple people tracking since it requires very complicated shape modeling and a large number of samples for precise tracking performance. Further, it shows a poor tracking performance in the case of close or partially occluded people. To overcome these difficulties, we present three improvements: First, we construct effective templates of people´s shapes using the SOM (Self-Organizing Map). Second, we take the discrete HMM (Hidden Markov Modeling) for an accurate dynamical model of the people´s shape transition. Third, we use the competition rule to separate close or partially occluded people effectively. Simulation results shows that the proposed CONDENSATION algorithm can achieve robust and real-time tracking in the image sequences of a crowd of people.

• Journal of KIISE:Software and Applications
• /
• v.33 no.5
• /
• pp.499-507
• /
• 2006

Recently human gait has been considered as a useful biometric supporting high performance human identification systems. This paper proposes a view-based pedestrian identification method using the dynamic silhouettes of a human body modeled with the Hidden Markov Model(HMM). Two types of gait models have been developed both with an endless cycle architecture: one is a discrete HMM method using a self-organizing map-based VQ codebook and the other is a continuous HMM method using feature vectors transformed into a PCA space. Experimental results showed a consistent performance trend over a range of model parameters and the recognition rate up to 88.1%. Compared with other methods, the proposed models and techniques are believed to have a sufficient potential for a successful application to gait recognition.

• The Journal of the Acoustical Society of Korea
• /
• v.14 no.1
• /
• pp.13-21
• /
• 1995

In this paper, we improve an image classifier algorithm based on neural network learning. It consists of two steps. The first is input pattern generation and the second, the global neural network implementation using an improved back-propagation algorithm. The feature vector for pattern recognition consists of the codebook data obtained from self-organization feature map learning. It decreases the input neuron number as well as the computational cost. The global neural network algorithm which is used in classifier inserts a control part and an address memory part to the back-propagation algorithm to control weights and unit-offsets. The simulation results show that it does not fall into the local minima and can implement easily the large-scale neural network. And it decreases largely the learning time.