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

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.18 no.11
• /
• pp.2902-2912
• /
• 1994

The ultrasonic array sensor system, consisting of one transmitter and fourreceivers instead of the traditional combination of a transmitter and a receiver is proposed in order to identify the location of objects. From the theoretical analysis and the experimental results, it is found that this new array sensor system could derive the information on the position of objects accurately, while the traditional sensor system could provide only the informatioin on the distance to objects. This sensor system is used to develop a sonar-based local mapping algorithm. The local map is used to find the existence of possible gates, through which the mobile robots can pass, and to select the suitable one in order for the robots to reach the goal safely in the presence of obstacles. The performance of the proposed local map algorithm is demonstrated experimentally in a small working area with several obstacles. It is found that the quality of the resulting local map is sufficient for the avoidance of collisions between the robots and obstacles and for the selection of the suitable gate leading to the goal. It is also shown that the global map of the working area could be obtained by integrating several local maps constructed from different locations and that it matches the actual layout of the working area well.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.15 no.1
• /
• pp.81-88
• /
• 2004

Turbo code has been adopted in the 3GPP standard, since its performance is very close to the Shannon limit. However, the turbo decoder requires a lot of computations and the amount of the memory increases as the block size of turbo codes becomes larger. In order to reduce the complexity of the turbo decoder, the Log-MAP, the Max-Log-MAP and the sliding window algorithm have been proposed. In this paper, the performance of turbo codes adopted in the 3GPP standard is analyzed by using the floating point and the fixed point implementation. The efficient decoding method is also proposed. It is shown that the BER performance of the proposed method is close to that of the Log-MAP algorithm.

• International Journal of Precision Engineering and Manufacturing
• /
• v.9 no.2
• /
• pp.69-74
• /
• 2008

Robotics and artificial intelligence are components of IT that involve networks, electrical and electronic engineering, and wireless communication. We consider an algorithm for efficient navigation by building a precise map in a multi-robot system under conditions of limited and unlimited communications. The basis of the navigation algorithm described in this paper is a wave algorithm, which is effective in obtaining an accurate map. Each robot in a multi-robot system has its own task such as building a map for its local position. By combining their data into a shared map, the robots can actively seek to verify their relative locations. Using shared maps, they coordinate their exploration strategies to maximize exploration efficiency. To prove the efficiency of the proposed technique, we compared the final results with the results in $Burgard^{8}$ and $Stachniss.^{9-10}$ All of the simulation comparisons, which are shown as graphs, were made in four different environments.

• Journal of Korean Institute of Industrial Engineers
• /
• v.20 no.2
• /
• pp.65-76
• /
• 1994

The most effective computer algorithms for facility layout that have been found are mainly based on the improvement heuristic such as CRAFT. In this paper, we present a new algorithm which is based on the Kohonen neual network. The algorithm firstly forms a self-organizing feature map where the most important similarity relationships among the facilities are converted into their spatial relationships. A layout is then obtained by a minor adjustment to the map. Some simulation results are given to show the performance of the algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.92.3-92
• /
• 2002

A lot of localization algorithms have been developed in order to achieve autonomous navigation. However, most of localization algorithms are restricted to certain conditions. In this paper, Monte Carlo localization scheme with a map-matching algorithm is suggested as a robust localization method for the Public Service Robot to accomplish its tasks autonomously. Monte Carlo localization can be applied to local, global and kidnapping localization problems. A range image based measure function and a geometric pattern matching measure function are applied for map matching algorithm. This map matching method can be applied to both polygonal environments and un-polygonal environments and achieves...

• Journal of Communications and Networks
• /
• v.6 no.3
• /
• pp.209-215
• /
• 2004

In this paper, a butterfly Log-MAP decoding algorithm for turbo code is proposed. Different from the conventional turbo decoder, we derived a generalized formula to calculate the log-likelihood ratio (LLR) and drew a modified butterfly states diagram in 8-states systematic turbo coded system. By comparing the complexity of conventional implementations, the proposed algorithm can efficiently reduce both the computations and work units without bit error ratio (BER) performance degradation.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.1
• /
• pp.145-151
• /
• 2014

This paper proposes an image haze removal algorithm for a single image. The conventional Dark Channel Prior(DCP) algorithm estimates a transmission map using the dark information in an image, and the haze regions are then detected using a matting algorithm. However, since the DCP algorithm uses block-based processing, block artifacts are invariably formed in the transmission map. To solve this problem, the proposed algorithm generates a modified transmission map using a Hidden Markov Random Field(HMRF) and Expectation-Maximization(EM) algorithm. Experimental results confirm that the proposed algorithm is superior to conventional algorithms in image haze removal.

• The Transactions of the Korean Institute of Electrical Engineers C
• /
• v.53 no.10
• /
• pp.515-522
• /
• 2004

In this study, we tried to investigate that the advantages of SOM(Self Organizing Map) algorithm such as data accumulation ability and the degradation trend trace ability would be adaptable to the analysis of partial discharge pattern recognition. For the purpose, we analyzed partial discharge data obtained from the typical artificial defects in GIS and XLPE power cable system through SOM algorithm. As a result, partial discharge pattern recognition could be well carried out with an acceptable error by use of Kohonen map in SOM algorithm. Also, it was clarified that the additional data could be accumulated during the operation of the algorithm. Especially, we found out that the data accumulation ability of Kohonen map could make it possible to suggest new patterns, which is impossible through the conventional BP(Back Propagation) algorithm. In addition, it is confirmed that the degradation trend could be easily traced in accordance with the degradation process. Therefore, it is expected to improve on-site applicability and to trace real-time degradation trends using SOM algorithm in the partial discharge pattern recognition

• The Journal of the Korea Contents Association
• /
• v.4 no.4
• /
• pp.79-87
• /
• 2004

In this paper, we propose a probability map based genetic algorithm to detect lips from portrait image. The existing genetic algorithm used to get an optimal solution is modified in order to get multiple optimal solutions for lips detection. Each individual consists of two chromosomes to represent coordinates x, y in space. Also the algorithm introduce a preserving zone in the population, a modified uniform crossover, a selection without individual duplication. Using probability map of H, 5 components, the proposed algorithm has adaptability in the segmentation of objects with similar colors. In experiments, we analyzed relationships of primary parameters and found that the algorithm can apply to the detection of other ROIs easily