• The Journal of the Korea Contents Association
• /
• v.13 no.11
• /
• pp.28-36
• /
• 2013

This study proposed a robust detection algorithm. It detects hands more stably with respect to changes in light and rotation for the identification of a hand shape. Also it satisfies both efficiency of calculation and the function of detection. The algorithm proposed segmented the hand area through pre-processing using a hand shape as input information in an environment with a single camera and then identified the shape using a Self Organized Feature Map(SOFM). However, as it is not easy to exactly recognize a hand area which is sensitive to light, it has a large degree of freedom, and there is a large error bound, to enhance the identification rate, rotation information on the hand shape was made into a database and then a principal component analysis was conducted. Also, as there were fewer calculations due to the fewer dimensions, the time for real-time identification could be decreased.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.2
• /
• pp.205-211
• /
• 2012

The retrieved documents have to be transformed into proper data structure for the clustering algorithms of statistics and machine learning. A popular data structure for document clustering is document-term matrix. This matrix has the occurred frequency value of a term in each document. There is a sparsity problem in this matrix because most frequencies of the matrix are 0 values. This problem affects the clustering performance. The sparseness of document-term matrix decreases the performance of clustering result. So, this research uses the factor score by factor analysis to solve the sparsity problem in document clustering. The document-term matrix is transformed to document-factor score matrix using factor scores in this paper. Also, the document-factor score matrix is used as input data for document clustering. To compare the clustering performances between document-term matrix and document-factor score matrix, this research applies two typed matrices to self organizing map (SOM) clustering.

• Journal of Convergence for Information Technology
• /
• v.12 no.5
• /
• pp.100-106
• /
• 2022

A longitudinal study refers to a research method based on longitudinal data repeatedly measured on the same object. Most of the longitudinal analysis methods are suitable for prediction or inference, and are often not suitable for use in exploratory study. In this study, an exploratory method to analyze longitudinal data is presented, which is to find the longitudinal trajectory after determining the best number of clusters by clustering longitudinal data using self-organizing map technique. The proposed methodology was applied to the longitudinal data of the Employment Information Service, and a total of 2,610 samples were analyzed. As a result of applying the methodology to the actual data applied, time-series clustering results were obtained for each panel. This indicates that it is more effective to cluster longitudinal data in advance and perform multilevel longitudinal analysis.

• Journal of the Korea Convergence Society
• /
• v.12 no.11
• /
• pp.27-33
• /
• 2021

With increasing interest in key areas of the 4th industrial revolution such as artificial intelligence, deep learning and big data, scientific approaches have developed in order to overcome the limitations of traditional decision-making methodologies. These scientific techniques are mainly used to predict the direction of financial products. In this study, the factors of apartment prices, which are of high social interest, were analyzed through SOM. For this analysis, we extracted the real prices of the apartments and selected a total of 16 input variables that would affect these prices. The data period was set from 1986 to 2021. As a result of examining the characteristics of the variables during the rising and faltering periods of the apartment prices, it was found that the statistical tendencies of the input variables of the rising and the faltering periods were clearly distinguishable. I hope this study will help us analyze the status of the real estate market and study future predictions through image learning.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2022.05a
• /
• pp.482-482
• /
• 2022

하천의 합류부에서는 수질이 다른 유체가 혼합하여 합류 전과 다른 특성을 보인다. 하천의 합류부에서 수질을 효율적으로 관리하기 위해서는 수질의 공간적인 혼합 특성을 규명하는 것이 중요하다. 합류부에서 수질의 공간적인 혼합 특성을 분석하기 위해 본 연구에서는 토폴로지 데이터 분석(topological data analysis, TDA), 자기 조직화 지도(Self-Organizing Map, SOM), k-평균 알고리즘(K-means clustering algorithm) 세 가지 기법을 이용하였다. 세 가지 기법을 비교하여 어떤 알고리즘이 합류부의 수질 변화 특성을 더 뚜렷하게 나타내는지 분석하였다. 수질 변화 비교 인자들은 pH, chlorophyll, DO, Turbidity 등이 있고, 수질 인자들은 YSI를 활용해 측정하였다. 자료의 측정 지역은 낙동강과 황강이 합류하는 지역이며, 보트에 YSI 장비를 부착하고 횡단하여 측정하였다. 측정한 데이터를 R 프로그램을 통해 세 가지 기법을 적용시켜 수질 변화 비교를 분석한다. 토폴로지 데이터 분석(topological data analysis, TDA)은 거대하고 복잡한 데이터로부터 유의미한 정보를 추출하는 데 사용하고, 자기조직화지도(Self-Organizing Map, SOM) 기법은 차원 축소와 군집화를 동시에 수행한다. k-평균 알고리즘(K-means clustering algorithm) 기법은 주어진 데이터를 k개의 클러스터로 묶는 머신러닝 비지도학습에 속하는 알고리즘이다. 세 가지 방법들의 주목적은 클러스터링이다. 클러스터 분석(Cluster analysis)이란 주어진 데이터들의 특성을 고려해 동일한 성격을 가진 여러 개의 그룹으로 대상을 분류하는 데이터 마이닝의 한 방법이다. 군집화 방법들인 TDA, SOM, K-means를 이용해 합류 지역의 수질 특성들을 클러스터링하여 수질 패턴들을 분석해 하천 수질 오염을 방지할 수 있을 것이다. 본 연구에서는 토폴로지 데이터 분석(topological data analysis, TDA), 자기조직화지도(Self-Organizing Map, SOM), k-평균 알고리즘(K-means clustering algorithm) 세 가지 기법을 이용하여 합류부에서의 수질 특성을 비교하며 어떤 기법이 합류의 특성을 더욱 뚜렷하게 나타내는지 규명했다. 합류의 특성을 군집화 방법을 이용해 알게 된다면, 합류부의 수질 변화 패턴을 다른 합류 지역에서도 적용할 수 있을 것으로 기대된다.

• Journal of Korea Port Economic Association
• /
• v.30 no.1
• /
• pp.23-55
• /
• 2014

The purpose of this paper is to show the clustering trend and to choose the clustering ports for 3 Korean ports(Busan, Incheon and Gwangyang Ports) by using the self organizing maps based on neural network(SOM) and Tier models for 38 Asian ports during 11 years(2001-2011) with 4 input variables(birth length, depth, total area, and number of crane) and 1 output variable(container TEU). The main empirical results of this paper are as follows. First, clustering results by using SOM show that 3 Korean ports[Busan(26.5%), Incheon(13.05%), and Gwangyang(22.95%) each]can increase the efficiency. Second, according to Tier model, Busan(Hongkong, Sanghai, Manila, and Singapore), Incheon(Aden, Ningbo, Dabao, and Bangkog), and Gwangyang(Aden, Ningbo, Bangkog, Hipa, Dubai, and Guangzhou) should be clustered with those ports in parentheses. Third, when both SOM and Tier models are mixed, (1) efficiency improvement of Busan Port is greater than those of Incheon and Gwangyang ports. (2) Incheon port has shown the slow improvement during 2001-2007, but after 2008, improvement speed was high. (3) improvement level of Gwangyang port was high during 2001-2003, but after 2004, improvement level was constantly decreased. The policy implication of this paper is that Korean port policy planner should introduce the SOM, and Tier models with the mixed two models when clustering among the Asian ports for enhancing the efficiency of inputs and outputs.

• The KIPS Transactions:PartC
• /
• v.12C no.5 s.101
• /
• pp.649-658
• /
• 2005

Since the Network based attack Is extensive in the real state of damage, It is very important to detect intrusion quickly at the beginning. But the intrusion detection using supervised learning needs either the preprocessing enormous data or the manager's analysis. Also it has two difficulties to detect abnormal traffic that the manager's analysis might be incorrect and would miss the real time detection. In this paper, we propose a traffic attributes correlation analysis mechanism based on self-organizing maps(SOM) for the real-time intrusion detection. The proposed mechanism has three steps. First, with unsupervised learning build a map cluster composed of similar traffic. Second, label each map cluster to divide the map into normal traffic and abnormal traffic. In this step there is a rule which is created through the correlation analysis with SOM. At last, the mechanism would the process real-time detecting and updating gradually. During a lot of experiments the proposed mechanism has good performance in real-time intrusion to combine of unsupervised learning and supervised learning than that of supervised learning.

• Journal of Broadcast Engineering
• /
• v.26 no.3
• /
• pp.283-295
• /
• 2021

This paper proposes a method for generating dense depth map using information of color images and depth map generated based on lidar based on self-organizing map. The proposed depth map upsampling method consists of an initial depth prediction step for an area that has not been acquired from LiDAR and an initial depth filtering step. In the initial depth prediction step, stereo matching is performed on two color images to predict an initial depth value. In the depth map filtering step, in order to reduce the error of the predicted initial depth value, a self-organizing map technique is performed on the predicted depth pixel by using the measured depth pixel around the predicted depth pixel. In the process of self-organization map, a weight is determined according to a difference between a distance between a predicted depth pixel and an measured depth pixel and a color value corresponding to each pixel. In this paper, we compared the proposed method with the bilateral filter and k-nearest neighbor widely used as a depth map upsampling method for performance comparison. Compared to the bilateral filter and the k-nearest neighbor, the proposed method reduced by about 6.4% and 8.6% in terms of MAE, and about 10.8% and 14.3% in terms of RMSE.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.38 no.6
• /
• pp.839-850
• /
• 2018

The flood damage in urban areas due to torrential rain is increasing with urbanization. For this reason, accurate and rapid flooding forecasting and expected inundation maps are needed. Predicting the extent of flooding for certain rainfalls is a very important issue in preparing flood in advance. Recently, government agencies are trying to provide expected inundation maps to the public. However, there is a lack of quantifying the extent of inundation caused by a particular rainfall scenario and the real-time prediction method for flood extent within a short time. Therefore the real-time prediction of flood extent is needed based on rainfall-runoff-inundation analysis. One/two dimensional model are continued to analyize drainage network, manhole overflow and inundation propagation by rainfall condition. By applying the various rainfall scenarios considering rainfall duration/distribution and return periods, the inundation volume and depth can be estimated and stored on a database. The Rainfall-Duration-Flooding Quantity (RDF) relationship curve based on the hydraulic analysis results and the Self-Organizing Map (SOM) that conducts unsupervised learning are applied to predict flooded area with particular rainfall condition. The validity of the proposed methodology was examined by comparing the results of the expected flood map with the 2-dimensional hydraulic model. Based on the result of the study, it is judged that this methodology will be useful to provide an unknown flood map according to medium-sized rainfall or frequency scenario. Furthermore, it will be used as a fundamental data for flood forecast by establishing the RDF curve which the relationship of rainfall-outflow-flood is considered and the database of expected inundation maps.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.2
• /
• pp.536-544
• /
• 2017

Wireless RSSI (Received Signal Strength Indication) fingerprinting is one of the most popular methods for indoor positioning as it provides reasonable accuracy while being able to exploit existing wireless infrastructure. However, the process of radio map construction (aka fingerprint calibration) is laborious and time consuming as precise physical coordinates and wireless signals have to be measured at multiple locations of target environment. This paper proposes a method to build the map from a combination of RSSIs without location information collected in a crowdsourcing fashion, and a handful of labeled RSSIs using a semi-supervised self organizing map learning algorithm. Experiment on simulated data shows promising results as the method is able to recover the full map effectively with only 1% RSSI samples from the fingerprint database.