• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.4
• /
• pp.354-359
• /
• 2013

In this paper, we suggested the method for implementation of unsupervised nonlinear classification using Binary Harmony Search (BHS) algorithm, which is known as a optimization algorithm. Various algorithms have been suggested for classification of feature vectors from the process of machine learning for pattern recognition or EEG signal analysis processing. Supervised learning based support vector machine or fuzzy c-mean (FCM) based on unsupervised learning have been used for classification in the field. However, conventional methods were hard to apply nonlinear dataset classification or required prior information for supervised learning. We solved this problems with proposed classification method using heuristic approach which took the minimal Euclidean distance between vectors, then we assumed them as same class and the others were another class. For the comparison, we used FCM, self-organizing map (SOM) based on artificial neural network (ANN). KEEL machine learning datset was used for simulation. We concluded that proposed method was superior than other algorithms.

• Proceedings of the KIEE Conference
• /
• 1990.07a
• /
• pp.535-538
• /
• 1990

The main problem in speech recognition is the enormous variability in acoustic signals due to complex but predictable contextual effects. Especially in plosive consonants it is very difficult to find invariant cue due to various contextual effects, but humans use these contextual effects as helpful information in plosive consonant recognition. In this paper we experimented on three artificial neural net models for the recognition of plosive consonants. Neural Net Model I used "Multi-layer Perceptron ". Model II used a variation of the "Self-organizing Feature Map Model". And Model III used "Interactive and Competitive Model" to experiment contextual effects. The recognition experiment was performed on 9 Korean plosive consonants. We used VCV speech chains for the experiment on contextual effects. The speech chain consists of Korean plosive consonants /g, d, b, K, T, P, k, t, p/ (/ㄱ, ㄷ, ㅂ, ㄲ, ㄸ, ㅃ, ㅋ, ㅌ, ㅍ/) and eight Korean monothongs. The inputs to Neural Net Models were several temporal cues - duration of the silence, transition and vot -, and the extent of the VC formant transitions to the presence of voicing energy during closure, burst intensity, presence of asperation, amount of low frequency energy present at voicing onset, and CV formant transition extent from the acoustic signals. Model I showed about 55 - 67 %, Model II showed about 60%, and Model III showed about 67% recognition rate.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.3
• /
• pp.1-7
• /
• 2009

An approach for the classification of music genres using a Fuzzy c-Means(FcM) with divergence-based kernel is proposed and presented in this paper. The proposed model utilizes the mean and covariance information of feature vectors extracted from music data and modelled by Gaussian Probability Density Function (GPDF). Furthermore, since the classifier utilizes a kernel method that can convert a complicated nonlinear classification boundary to a simpler linear one, he classifier can improve its classification accuracy over conventional algorithms. Experiments and results on collected music data sets demonstrate hat the proposed classification scheme outperforms conventional algorithms including FcM and SOM 17.73%-21.84% on average in terms of classification accuracy.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.4
• /
• pp.354-358
• /
• 2001

This paper presents a fuzzy neural network model which solves the underutilization problem. This fuzzy neural network has both stability and flexibility because it uses the control structure similar to AHT(Adaptive Resonance Theory)-l neural network. And this fuzzy nenral network does not need to initialize weights and is less sensitive to noise than ART-l neural network is. The learning rule of this fuzzy neural network is the modified and fuzzified version of Kohonen learning rule and is based on the fuzzification of leaky competitive leaming and the fuzzification of conditional probability. The similarity measure of vigilance test, which is performed after selecting a winner among output neurons, is the relative distance. This relative distance considers Euclidean distance and the relative location between a datum and the prototypes of clusters. To compare the performance of the proposed fuzzy neural network with that of Kohonen Self-Organizing Feature Map the IRIS data and Gaussian-distributed data are used.

• Journal of the Korean earth science society
• /
• v.22 no.2
• /
• pp.138-146
• /
• 2001

The land cover over Korean peninsula was classified using a multi-temporal NOAA/AVHRR (Advanced Very High Resolution Radiometer) data. Four types of phenological data derived from the 10-day composited NDVI (Normalized Differences Vegetation Index), maximum and annual mean land surface temperature, and topographical data were used not only reducing the data volume but also increasing the accuracy of classification. Self organizing feature map (SOFM), a kind of neural network technique, was used for the clustering of satellite data. We used a decision tree for the classification of the clusters. When we compared the classification results with the time series of NDVI and some other available ground truth data, the urban, agricultural area, deciduous tree and evergreen tree were clearly classified.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.7
• /
• pp.45-52
• /
• 2012

In this paper, an crowd density in elevator estimation method based on multi-class Adaboost classifier is proposed. The SOM (Self-Organizing Map) based conventional methods have shown insufficient performance in practical scenarios and have weakness for low reproducibility. The proposed method estimates the crowd density using multi-class Adaboost classifier with texture features, namely, GLDM(Grey-Level Dependency Matrix) or GGDM(Grey-Gradient Dependency Matrix). In order to classify into multi-label, weak classifier which have better performance is generated by modifying a weight update equation of general Adaboost algorithm. The crowd density is classified into four categories depending on the number of persons in the crowd, which can be 0 person, 1-2 people, 3-4 people, and 5 or more people. The experimental results under indoor environment show the proposed method improves detection rate by about 20% compared to that of the conventional method.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2011.05a
• /
• pp.189-193
• /
• 2011

유역관리 및 수질 향상을 위해 다양한 환경정책이 시행되고 있으며, 최근 수질오염총량관리제의 시행으로 인해 보다 집중적인 유역관리와 수질 향상을 위한 노력이 배가되고 있다. 이러한 노력의 일환으로 현재 환경부 국립환경과학원에서는 수질오염총량관리를 위하여 단위유역의 말단지점에서 수질 및 유량자료에 대한 정기적인 측정을 8일 간격으로 시행하고 있으며, 데이터 베이스 및 웹시스템을 통하여 자료를 공개하고 있다(이호열, 2009). 이와 같은 자료의 측정과 축적은 그 분석을 통해 수질 개선을 위한 우선 관리 대상지점의 파악 등과 같이 수질오염총량관리제의 시행과 평가를 위해 사용될 수 있을 뿐만 아니라 새로운 환경정책의 수립에도 활용될 수 있을 것으로 기대된다. 그러나 현재 소수의 연구들에서만 상기의 자료를 단순히 활용한 결과를 찾을 수 있으며, 특히 측정된 수질 및 유량자료를 분석하여 발표한 연구결과 역시 소수에 지나지 않는다(김철겸 등, 2009). 측정 자료에 대한 분석 및 이에 따른 자료의 활용성 제고를 위해서 다양한 자료 분석 기법의 개발과 적용이 절실하다. 이러한 자료 분석 기법의 개발 및 적용에 관한 연구의 일환으로 최근 패턴분류를 위해 다양한 분야에서 활용되고 있는 자기조직화 특성 지도(Self Organizing Feature Map: SOFM)를 상기의 측정 자료에 적용한 연구 결과가 보고된 바 있다(진영훈 등, 2009; 2010). 본 연구에서는 수질오염총량관리제를 위해 측정되고 있는 수질 및 유량자료를 수집하여 자료에 내재되어 있는 시 공간적 특성을 분석하고자 하였다. 영산강 유역을 대상으로 하여, 본 유역 내의 단위유역들 중 황룡_A, 지석_A, 영본_A, 영본_B, 영본_C, 영본_D의 말단지점에서 측정되고 있는 BOD (Biochemical Oxygen Demand), TOC (Total Organic Carbon), T-N (Total Nitrogen), T-P (Total Phosphorus), SS (Suspended Solids) 수질농도 및 유량자료를 대상으로 연구를 진행하였다.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.44 no.4 s.316
• /
• pp.8-14
• /
• 2007

Social participation of the elderly and people with disabilities continuously becomes more active due to improvement of social systems and technological development. Various assistive systems, such as intelligence robots and intelligence home systems, have been developed to support the social participation, and obviously contributed to independent lives of the elderly and people with disabilities. These systems, however, usually require expensive special hardware. To relieve a financial burden software-oriented approaches, which utilizes existing hardware such as laptops, can be an alternative. The software should be developed considering users with physical limitation and without much knowledge of computers. This paper suggests software-oriented approaches to solve these problems and describes an actual development procedure of the software with related theories. We also introduce an unified user interface for a special work chair as a real application.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.3
• /
• pp.56-63
• /
• 2015

Several fields of science have demanded large-scale workflow support, which requires thousands of CPU cores or more. In order to support such large-scale scientific workflows, high capacity parallel systems such as supercomputers are widely used. In order to increase the utilization of these systems, most schedulers use backfilling policy: Small jobs are moved ahead to fill in holes in the schedule when large jobs do not delay. Since an estimate of the runtime is necessary for backfilling, most parallel systems use user's estimated runtime. However, it is found to be extremely inaccurate because users overestimate their jobs. Therefore, in this paper, we propose a novel system for the runtime prediction based on workload-aware clustering with the goal of improving prediction performance. The proposed method for runtime prediction of parallel applications consists of three main phases. First, a feature selection based on factor analysis is performed to identify important input features. Then, it performs a clustering analysis of history data based on self-organizing map which is followed by hierarchical clustering for finding the clustering boundaries from the weight vectors. Finally, prediction models are constructed using support vector regression with the clustered workload data. Multiple prediction models for each clustered data pattern can reduce the error rate compared with a single model for the whole data pattern. In the experiments, we use workload logs on parallel systems (i.e., iPSC, LANL-CM5, SDSC-Par95, SDSC-Par96, and CTC-SP2) to evaluate the effectiveness of our approach. Comparing with other techniques, experimental results show that the proposed method improves the accuracy up to 69.08%.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.4 s.310
• /
• pp.74-86
• /
• 2006

This paper proposes a robust and computationally efficient algorithm for automatic video object segmentation. For implementing the spatio-temporal segmentation, which aims for efficient combination of the motion segmentation and the color segmentation, an SOM-based hierarchical clustering method in which the segmentation process is regarded as clustering of feature vectors is employed. As results, problems of high computational complexity which required for obtaining exact segmentation results in conventional video object segmentation methods, and the performance degradation due to noise are significantly reduced. A measure of motion vector reliability which employs MRF-based MAP estimation scheme has been introduced to minimize the influence from the motion estimation error. In addition, a noise elimination scheme based on the motion reliability histogram and a clustering validity index for automatically identifying the number of objects in the scene have been applied. A cross projection method for effective object tracking and a dynamic memory to maintain temporal coherency have been introduced as well. A set of experiments has been conducted over several video sequences to evaluate the proposed algorithm, and the efficiency in terms of computational complexity, robustness from noise, and higher segmentation accuracy of the proposed algorithm have been proved.