• Journal of KIISE:Software and Applications
• /
• v.28 no.12
• /
• pp.875-884
• /
• 2001

Although the self organizing map (SOM) is widely utilized in such fields of data visualization and topology preserving mapping, since it should have the topology fixed before trained, it has some shortcomings that it is difficult to apply it to practical problems, and classification capability is quite low despite better clustering performance. To overcome these points this paper proposes the dynamic topology preserving self-organizing map(DTSOM) that dynamically splits the output nodes on the map and trains them, and attempts to improve the classification capability by combining multiple DTSOMs K-Winner method has been applied to combine DTSOMs which produces K outputs with winner node selection method. This produces even better performance than the conventional combining methods such as majority voting weighting, BKS Bayesian, Borda, Condorect and reliability sum. DTSOM remedies the shortcoming of determining the topology in advance, and the classification rate increases significantly by combing multiple maps trained with different features. Experimental results with handwritten digit recognition indicate that the proposed method works out to problems of conventional SOM effectively so to improve the classification rate to 98.1%.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.2
• /
• pp.126-135
• /
• 2002

The study is concerned with an approach to the design of new architectures of fuzzy neural networks and the discussion of comprehensive design methodology supporting their development. We propose an Adaptive Fuzzy Polynomial Neural Networks(APFNN) based on Fuzzy Neural Networks(FNN) and Self-organizing Networks(SON) for model identification of complex and nonlinear systems. The proposed AFPNN is generated from the mutually combined structure of both FNN and SON. The one and the other are considered as the premise and the consequence part of AFPNN, respectively. As the premise structure of AFPNN, FNN uses both the simplified fuzzy inference and error back-propagation teaming rule. The parameters of FNN are refined(optimized) using genetic algorithms(GAs). As the consequence structure of AFPNN, SON is realized by a polynomial type of mapping(linear, quadratic and modified quadratic) between input and output variables. In this study, we introduce two kinds of AFPNN architectures, namely the basic and the modified one. The basic and the modified architectures depend on the number of input variables and the order of polynomial in each layer of consequence structure. Owing to the specific features of two combined architectures, it is possible to consider the nonlinear characteristics of process system and to obtain the better output performance with superb predictive ability. The availability and feasibility of the AFPNN are discussed and illustrated with the aid of two representative numerical examples. The results show that the proposed AFPNN can produce the model with higher accuracy and predictive ability than any other method presented previously.

• Journal of KIISE:Databases
• /
• v.29 no.5
• /
• pp.358-366
• /
• 2002

Feature-based similarity retrieval become an important research issue in image database systems. The features of image data are useful to discrimination of images. In this paper, we propose the high speed k-Nearest Neighbor search algorithm based on Self-Organizing Maps. Self-Organizing Maps(SOM) provides a mapping from high dimensional feature vectors onto a two-dimensional space and generates a topological feature map. A topological feature map preserves the mutual relations (similarities) in feature spaces of input data, and clusters mutually similar feature vectors in a neighboring nodes. Therefore each node of the topological feature map holds a node vector and similar images that is closest to each node vector. We implemented a k-NN search for similar image classification as to (1) access to topological feature map, and (2) apply to pruning strategy of high speed search. We experiment on the performance of our algorithm using color feature vectors extracted from images. Promising results have been obtained in experiments.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.9
• /
• pp.6260-6268
• /
• 2015

In LTE-Advanced that different networks coexist, it is considered that it is actually difficult to provide service continuity with a procedural and static control method applied to the existing voice service. This paper suggests Service Self-Organization to support the service continuity effectively based on SON. It means a method in which a subscriber's terminal collects information about its current condition and base station around, and a base station, through the data collected by monitoring inner or adjacent base station, shares related data and converges, controlling service continuity on its own. In other words, as context information of mobile terminal and base station changes, set-up of related functions such as ISHO, cell selection, source allocation, load control, and QoS mapping is adapted; each function fits into the change, exchanges the process of reorganization, and interacts; these actions go toward to satisfy service continuity. Simulation results show that it provides better performances than the conventional one with the measure of resource utilization rate and outage probability.

• Bulletin of the Korean Mathematical Society
• /
• v.30 no.2
• /
• pp.251-263
• /
• 1993

The purpose of this paper is to study the solvability of the equation (E). In Section 2, we give preliminary definitions. In Section 3, we prove related two results (Theorem 1 and Corollary 1) concerning the closedness property of accretive operators in the class of spaces whose nonempty bounded closed convex subsets have the fixed point property for nonexpansive self-mapping. Using therem 1, we derive a result (Theorem 2) on the range of accetive operators in (.pi.)$_{1}$ spaces with a view to establishing a new result, which improves a result of Kartsatos [8] and Webb [15]. Further, we give an interesting consequence (Corollary 3) of Theorem 2. In section 4, we apply Corollary 1 to obtain two results (Theorem 3 and 4) for the range of sums of two accretive operators, which generalize two results of Reich [12].

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.39 no.12
• /
• pp.1306-1316
• /
• 1990

A controller using a multilayer neural network is proposed to the dynamic control of a PUMA 560 robot arm. This controller is developed based on an error back-propagation (BP) neural network. Since the neural network can model an arbitrary nonlinear mapping, it is used as a commanded feedforward torque generator. A Proportional Derivative (PD) feedback controller is used in parallel with the feedforward neural network to train the system. The neural network was trained by the current state of the manipulator as well as the PD feedback error torque. No a priori knowledge on system dynamics is needed and this information is rather implicitly stored in the interconnection weights of the neural network. In another experiment, the neural network was trained with the current, past and future positions only without any use of velocity sensors. Form this thim window of position values, BP network implicitly filters out the velocity and acceleration components for each joint. Computer simulation demonstrates such powerful characteristics of the neurocontroller as adaptation to changing environments, robustness to sensor noise, and continuous performance improvement with self-learning.

• 한국HCI학회:학술대회논문집
• /
• 2007.02a
• /
• pp.994-999
• /
• 2007

전방향(omnidirectional) 카메라 시스템은 보다 적은 수의 영상으로부터 주변 장면(scene)에 대한 많은 정보를 취득할 수 있는 장점이 있기 때문에 전방향 영상을 이용한 자동교정(self-calibration)과 3차원 재구성 등의 연구가 활발히 진행되고 있다. 본 논문에서는 기존에 제안된 교정 방법들을 이용하여 추정된 사영모델(projection model)의 정확성을 검증하기 위한 새로운 방법이 제안된다. 실 세계에서 다양하게 존재하는 직선 성분들은 전방향 영상에 컨투어(contour)의 형태로 사영되며, 사영모델과 컨투어의 양 끝점 좌표 값을 이용하여 그 궤적을 추정할 수 있다. 추정된 컨투어의 궤적과 영상에 존재하는 컨투어와의 거리 오차(distance error)로부터 전방향 카메라의 사영모델의 정확성을 검증할 수 있다. 제안된 방법의 성능을 평가하기 위해서 구 맵핑(spherical mapping)된 합성(synthetic) 영상과 어안렌즈(fisheye lens)로 취득한 실제 영상에 대해 제안된 알고리즘을 적용하여 사영모델의 정확성을 판단하였다.

• The Pure and Applied Mathematics
• /
• v.18 no.3
• /
• pp.201-217
• /
• 2011

The aim of this paper is to define a new commutativity condition for a pair of self mappings i.e., (DS)-weak commutativity condition, which is weaker that compatibility of mappings in the settings of intuitionistic Menger spaces. We show that a common fixed point theorem can be proved for nonlinear contractive condition in intuitionistic Menger spaces without assuming continuity of any mapping. To prove the result we use (DS)-weak commutativity condition for mappings. We also give examples to validate our results.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.3
• /
• pp.235-241
• /
• 2007

This paper proposes a self-calibration method of robots those are used in industrial assembly lines. The proposed method is a position compensation using laser sensor and vision camera. Because the laser sensor is cross type laser sensor which can scan a horizontal and vertical line, it is efficient way to detect a feature of vehicle and winding shape of vehicle's body. For position compensation of 3-Dimensional axis, we applied block interpolation method. For selecting feature point, pattern matching method is used and 3-D position is selected by Euclidean distance mapping between 462 feature values and evaluated feature point. In order to evaluate the proposed algorithm, experiments are performed in real industrial vehicle assembly line. In results, robot's working point can be displayed 3-D points. These points are used to diagnosis error of position and reselecting working point.

• Journal of Industrial Technology
• /
• v.15
• /
• pp.93-101
• /
• 1995

Fractal coding is a promising method for image compression, but it has not lived up to its promise as low bit-rate image compression scheme. The existing algorithms for finding self-mapping contractive transforms are computationally expensive and offer a poor rate-quality tradeoff. In this paper, we propose a segment based fractal coding. We classify the range blocks into shade, midrange or edge blocks, and segment edge block along the edge. And we apply midrange coding scheme for each segment. Our experiments show that our method gives better rate-qualty trade of than current fractal block coding methods.