• Journal of information and communication convergence engineering
• /
• v.8 no.6
• /
• pp.609-617
• /
• 2010

This paper is concerned with the use of a selforganizing map (SOM) to estimate the desired channel states of an unknown digital communication channel for blind equalization. The modification of SOM is accomplished by using the Bayesian likelihood fitness function and the relation between the desired channel states and channel output states. At the end of each clustering epoch, a set of estimated clusters for an unknown channel is chosen as a set of pre-defined desired channel states, and used to extract the channel output states. Next, all of the possible desired channel states are constructed by considering the combinations of extracted channel output states, and a set of the desired states characterized by the maximal value of the Bayesian fitness is subsequently selected for the next SOM clustering epoch. This modification of SOM makes it possible to search the optimal desired channel states of an unknown channel. In simulations, binary signals are generated at random with Gaussian noise, and both linear and nonlinear channels are evaluated. The performance of the proposed method is compared with those of the "conventional" SOM and an existing hybrid genetic algorithm. Relatively high accuracy and fast search speed have been achieved by using the proposed method.

• The KIPS Transactions:PartB
• /
• v.15B no.5
• /
• pp.407-412
• /
• 2008

Color segmentation is one of the most challenging problems in image processing especially in case of handling the images with cluttered background. Great amount of color segmentation methods have been developed and applied to real problems. In this paper, we suggest a new methodology. Our approach is focused on background extraction, as a complimentary operation to standard foreground object segmentation, using self-organizing feature selective property of unsupervised self-learning paradigm based on the competitive algorithm. The results of our studies show that background segmentation can be achievable in efficient manner.

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

• Proceedings of the KAIS Fall Conference
• /
• 2003.11a
• /
• pp.223-230
• /
• 2003

Feature-based similarity retrieval has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects (e 'g', documents, images, video, music score, etc.). For example, images are represented by their color histograms, texture vectors, and shape descriptors, and are usually high-dimensional data. The performance of conventional multidimensional data structures(e'g', R- Tree family, K-D-B tree, grid file, TV-tree) tends to deteriorate as the number of dimensions of feature vectors increases. The R＊-tree is the most successful variant of the R-tree. In this paper, we propose a SOM-based R＊-tree as a new indexing method for high-dimensional feature vectors.The SOM-based R＊-tree combines SOM and R＊-tree to achieve search performance more scalable to high dimensionalities. Self-Organizing Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two dimensional space. The mapping preserves the topology of the feature vectors. The map is called a topological of the feature map, and preserves the mutual relationship (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. A best-matching-image-list. (BMIL) holds similar images that are closest to each codebook vector. In a topological feature map, there are empty nodes in which no image is classified. When we build an R＊-tree, we use codebook vectors of topological feature map which eliminates the empty nodes that cause unnecessary disk access and degrade retrieval performance. We experimentally compare the retrieval time cost of a SOM-based R＊-tree with that of an SOM and an R＊-tree using color feature vectors extracted from 40, 000 images. The result show that the SOM-based R＊-tree outperforms both the SOM and R＊-tree due to the reduction of the number of nodes required to build R＊-tree and retrieval time cost.

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.3
• /
• pp.257-264
• /
• 2005

This paper suggests a heuristic algorithm for the clustering problem. Clustering involves grouping similar objects into a cluster. Clustering is used in a wide variety of fields including data mining, marketing, and biology. Until now there are a lot of approaches using Self-Organizing Feature Maps(SOFMs). But they have problems with a small output-layer nodes and initial weight. For example, one of them is a one-dimension map of k output-layer nodes, if they want to make k clusters. This approach has problems to classify elaboratively. This paper suggests one-dimensional output-layer nodes in SOFMs. The number of output-layer nodes is more than those of clusters intended to find and the order of output-layer nodes is ascending in the sum of the output-layer node's weight. We can find input data in SOFMs output node and classify input data in output nodes using Euclidean distance. We use the well known IRIS data as an experimental data. Unsupervised clustering of IRIS data typically results in 15 - 17 clustering error. However, the proposed algorithm has only six clustering errors.

• KSBB Journal
• /
• v.20 no.4
• /
• pp.291-298
• /
• 2005

Two-dimensional (2D) spectrofluorometer is often used to monitor various fermentation processes. The change in fluorescence intensities resulting from various combinations of excitation and emission wavelengths is investigated by using a spectra subtraction technique. But it has a limited capacity to classify the entire fluorescence spectra gathered during fermentations and to extract some useful information from the data. This study shows that the self-organizing map (SOM) is a useful and interpretative method for classification of the entire gamut of fluorescence spectral data and selection of some combinations of excitation and emission wavelengths, which have useful fluorometric information. Some results such as normalized weights and variances indicate that the SOM network is capable of interpreting the fermentation processes of S. cerevisiae and recombinant E. coli monitored by a 2D spectrofluorometer.

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

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.51 no.6
• /
• pp.276-283
• /
• 2002

This Paper Presents the method for detecting a partial discharge(PD) using an electromagnetic wave measured by an antenna. The various electromagnetic waves are measured in the laboratory and wavelet transform, which is provides a direct quantitative measure of spectral content in the time-frequency domain, are applied for identifying the property of electromagnetic waves. Also, the statistical method and self-organizing feature map(SOFM) are applied for the pattern recognition of electromagnetic waves. The proposed method is shown to be useful for detecting electromagnetic waves emitted for PD in test data.

• Korean Journal of Ecology and Environment
• /
• v.39 no.1 s.115
• /
• pp.52-61
• /
• 2006

The aim of this study was to analyze the seasonal patterns of zooplankton community dynamics in the lower Nakdong River (Mulgum, RK; river kilometer; 27 km from the estuarine barrage), with a Self-Organizing Map (SOM) based on weekly sampled data collected over ten years(1994 ${\sim}$ 2003). It is well known that zooplankton groups had important role in the food web of freshwater ecosystems, however, less attention has been paid to this group compared with other community constituents. A non-linear patterning algorithm of the SOM was applied to discover the relationship among river environments and zooplankton community dynamics. Limnological variables (water temperature, dissolved oxygen, pH , Secchi transparency, turbidity, chlorophyll a, discharge, etc.) were taken into account to implement patterning seasonal changes of zooplankton community structures (consisting of rotifers, cladocerans and copepods). The trained SOM model allocated zooplankton on the map plane with limnological parameters. Three zooplankton groups had high similarities to one another in their changing seasonal patterns, Among the limnological variables, water temporature was highly related to the zooplankton community dynamics (especially for cladocerans). The SOM model illustrated the suppression of zooplankton due to the increased river discharge, particularly in summer. Chlorophyll a concentrations were separated from zooplankton data set on the map plane, which would intimate the herbivorous activity of dominant grazers. This study introduces the zooplankton dynamics associated with limnological parameters using a nonlinear method, and the information will be useful for managing the river ecosystem, with respect to the food web interactions.

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