• 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.

• The KIPS Transactions:PartB
• /
• v.13B no.2 s.105
• /
• pp.121-126
• /
• 2006

In this paper, we propose an approach to increase the power of clustering Web images by using high-level semantic features from text information relevant to Web images as well as low-level visual features of image itself. These high-level text features can be obtained from image URLs and file names, page titles, hyperlinks, and surrounding text. As a clustering engine, self-organizing map (SOM) proposed by Kohonen is used. In the SOM-based clustering using high-level text features and low-level visual features, the 200 images from 10 categories are divided in some suitable clusters effectively. For the evaluation of clustering powers, we propose simple but novel measures indicating the degrees of scattering images from the same category, and degrees of accumulation of the same category images. From the experiment results, we find that the high-level text features are more useful in SOM-based Web image clustering.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1549-1552
• /
• 1997

In this paper, a optimal algorithm that can produce the FOV is proposed in terms of using the Kohonen's Self-Organizing Map(KSOM). A FOV, that stands for "Field Of View", means maximum area where a camera could be wholly seen and influences the total time of inspection of vision system. Therefore, we draw algorithm with a KSOM which aims to map an input space of N-dimensions into a one-or two-dimensional lattice of output layer neurons in order to optimize the number and location of FOV, instead of former sequentila method. Then, we show demonstratin through computer simulation using the real PCB data. PCB data.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.995-998
• /
• 2013

Aerial imaging is one of the most common and versatile ways of obtaining information from the Earth surface. In this paper, we present an approach by SOM(Self Organization Map) algorithm with 2 phase learning to be applied successfully to aerial images clustering due to its signal-to-noise independency. A comparison with other classical method, such as K-means and traditional SOM, of real-world areal image clustering demonstrates the efficacy of our approach.

• Structural Engineering and Mechanics
• /
• v.63 no.2
• /
• pp.237-249
• /
• 2017

The Self-Organization Feature Map as an unsupervised network is very widely used these days in engineering science. The applied network in this paper is the Self Organization Feature Map with constant weights which includes Kohonen Network. In this research, Reinforced Concrete Shear Wall buildings with different stories and heights are analyzed and a database consisting of measured fundamental periods and characteristics of 78 RC SW buildings is created. The input parameters of these buildings include number of stories, height, length, width, whereas the output parameter is the fundamental period. In addition, using Genetic Algorithm, the structure of the Self-Organization Feature Map algorithm is optimized with respect to the numbers of layers, numbers of nodes in hidden layers, type of transfer function and learning. Evaluation of the SOFM model was performed by comparing the obtained values to the measured values and values calculated by expressions given in building codes. Results show that the Self-Organization Feature Map, which is optimized by using Genetic Algorithm, has a higher capacity, flexibility and accuracy in predicting the fundamental period.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.11
• /
• pp.1857-1866
• /
• 1989

In this paper, an algorithm to update a codebook using a neural network in consecutive images, is proposed. With the Kohonen's self-organizing feature map, we adopt the iterative technique to update a centroid of each cluster instead of the unsupervised learning technique. Because the performance of this neural model is comparable to that of the LBG algorithm, it is possible to update the codebooks of consecutive frames sequentially in TV and to realize the hardwadre on the real-time implementation basis.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.768-772
• /
• 1991

The Self Creating and organizing (SCO) is a new architecture and one of the unsupervized learning algorithm for the artificial neural network. SCO begins with only one output node which has a sufficiently wide response range, and the response ranges of all the nodes decrease with time. Self Creating and Organizing Neural Network (SCONN) decides automatically whether adapting the weights of existing node or creating a new node. It is compared to the Kohonen's Self Organizing Feature Map (SOFM). The results show that SCONN has lots of advantages over other competitive learning architecture.

• Information and Communications Magazine
• /
• v.11 no.6
• /
• pp.68-84
• /
• 1994

입력된 영상정보로부터 3차원 물체를 찾아내거나 인식하는 것은 컴퓨터에게 인간과 같은 능력을 부여하기 위한 가장 기본적인 과제라 할 수 있다. 본 글에서는 우선 3차원 정보를 취득하는 다양한 방법을 간단히 살펴보고 이에서 받아들인 3차원 정보를 가지고 어떻게 3차원 문체의 형태를 서술하는가를 기존의 발표된 많은 문헌에 근거해설 요약해 보았다. 3차원 물체의 인식기법을 살펴보고 신경망을 이용한 3차원 물체인식 특히 Kohonen Map을 통한 3차원 인식을 중점적으로 다루었다. 마지막으로 보행 로보트의 주행에 필요한 3차원 정보 취득 및 그 이용 방법을 제시하였다.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.11 no.4
• /
• pp.217-222
• /
• 2011

Genetic algorithms are one of the most important methods used to solve the Traveling Salesman Problem. Therefore, many researchers have tried to improve the Genetic Algorithm by using different methods and operations in order to find the optimal solution within reasonable time. This paper intends to find a new approach that adopts an improved genetic algorithm to solve the Traveling Salesman Problem, and compare with the well known heuristic method, namely, Kohonen Self-Organizing Map by using different data sets of symmetric TSP from TSPLIB. In order to improve the search process for the optimal solution, the proposed approach consists of three strategies: two separate tour segments sets, the improved crossover operator, and the improved mutation operator. The two separate tour segments sets are construction heuristic which produces tour of the first generation with low cost. The improved crossover operator finds the candidate fine tour segments in parents and preserves them for descendants. The mutation operator is an operator which can optimize a chromosome with mutation successfully by altering the mutation probability dynamically. The two improved operators can be used to avoid the premature convergence. Simulation experiments are executed to investigate the quality of the solution and convergence speed by using a representative set of test problems taken from TSPLIB. The results of a comparison between the new approach using the improved genetic algorithm and the Kohonen Self-Organizing Map show that the new approach yields better results for problems up to 200 cities.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.3
• /
• pp.600-611
• /
• 1996

Recently, neural network-based speech recognition has been studied to utilize the adaptivity and learnability of neural network models. However, conventional neural network models have difficulty in the co-articulation processing and the boundary detection of similar phonmes of the Korean speech. Also, in case of using one phonotopic map, learning speed may dramatically increase and inaccuracies may be caused because homogeneous learning and recognition method should be applied for heterogenous data. Hence, in this paper, a neural net typewriter has been designed using a hierarchical self-organizing classifier(HSOC), and related algorithms are presented. This HSOC, during its learing stage, distributed phoneme data on hierarchically structured multiple phonotopic maps, using Kohonen's self-organizing feature maps(SOFM). Presented and experimented in this paper were the algorithms for deciding the number of maps, map sizes, the selection of phonemes and their placement per map, an approapriate learning and preprocessing method per map. If maps are divided according to a priorlinguistic knowledge, we would have difficulty in acquiring linguistic knowledge and how to alpply it(e.g., processing extended phonemes). Contrarily, our HSOC has an advantage that multiple phonotopic maps suitable for given input data are self-organizable. The resulting three korean phonotopic maps are optimally labelled and have their own optimal preprocessing schemes, and also confirm to the conventional linguistic knowledge.