• Communications for Statistical Applications and Methods
• /
• v.17 no.1
• /
• pp.39-45
• /
• 2010

As the value of environment is increasing, the water quality has been a matter of interest to the nation and people. Research on water quality has been widely studied, but focused on geographical characteristic and river characteristics like inflow, outflow, quantity and speed of water. In this paper, two approaches to measure the similarity of sampling sites by using water quality data are discussed and compared with two-years empirical data of Yongdam-Dam. The existing method has calculated their similarities with principal component scores. The proposed approach in this paper use correlation matrix of water quality related variables and MDS for measuring the similarity, which is shown to be better in the sense of being clustering which is identical to geographical clustering since it can consider the time series pattern of water quality.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.6
• /
• pp.57-65
• /
• 2019

In this paper, we study on finding the rail space in elevators by analyzing each image captured with CCD camera. We propose a method that applies one-dimensional matched filter to the pixels of a selected search space in the vertical line at a horizontal position and decides the position with the thickness of the space being represented by a black thick line in captured images. The pattern similarity representing how strongly the associated image pixels resemble with the thick line is defined and calculated with respect to each position along the vertical line of pixels. The position and thickness of the line are decided from the point having the maximum in pattern similarity graph. In the experiments of the proposed method under different illuminational conditions, it is observed that all the pattern similarity graphs show similar shape around door area independent of the conditions and the method can effectively detect the rail space if the rails are illuminated with even weak light. The method can be used for real-time embedded systems because of its simple algorithm, in which it is implemented in simple structure of program with small amount of operations in comparison with the conventional approaches using Canny edge detection and Hough transform.

• The Bulletin of The Korean Astronomical Society
• /
• v.46 no.2
• /
• pp.67.4-68
• /
• 2021

In studying the dynamical evolution of galaxy clusters, one intriguing approach is to compare the spatial distributions of various components, such as the dark matter, the member galaxies, the gas, and the intracluster light (ICL; the diffuse light from stars, which are not bound any individual cluster galaxy). If we find a visible component whose spatial distribution coincides with the dark matter distribution, then we could draw a dark matter map without requiring laborious weak lensing analysis. Furthermore, if the component traces the dark matter distribution better for more relaxed galaxy cluster, we could use the similarity as a dynamical stage estimator of the galaxy cluster. We present a novel new methodology to quantify the similarity of two or more 2-dimensional spatial distributions. We apply the method to a sample of galaxy clusters at different dynamical stages simulated within N-cluster Run, which is an N-body simulation using the galaxy replacement technique. Among the various components (stellar particles, galaxies, ICL), the velocity defined ICL+ brightest cluster galaxy (BCG) component traces the dark matter best. Between the sample galaxy clusters, the relaxed clusters show stronger similarity of the spatial distribution between the dark matter and ICL+BCG than the dynamically young clusters.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.11 no.1
• /
• pp.225-231
• /
• 2003

In order to improve efficiency of a system with three-dimensional flow characteristics, this paper presents a new method that overcomes three-dimensional effects by using two-dimensional CFD and response surface method. The method was applied to shape optimization of cut-off in a multi-blade fan/scroll system. As the entrance conditions of two-dimensional CFD, the experimental values at the positions out of the inactive zone were used. In order to examine the validity of the two-dimensional CFD the distributions of velocity and pressure obtained by two-dimensional CFD were compared with those of three-dimensional CFD and experimental results. It was found that the distributions of velocity and pressure show qualitatively similarity. The results of two-dimensional CFD were used for constructing the objective function with design variables using response surface method. The optimal angle and radius of cut-off were determined as $72.4^{\circ}$ and 0.092 times the outer diameter of impeller, respectively. It is quantified the previous report that the optimal angle and radius of cut-off are approximately $72^{\circ}$ and 0.08 times the outer diameter of impeller, respectively.

• Journal of KIISE:Software and Applications
• /
• v.28 no.9
• /
• pp.612-628
• /
• 2001

This paper presents a methodology to extract classes and inheritance relations from procedural software. The methodology is based on the idea of generating all groups of class candidates, based on the combinatorial groups of object candidates, and their inheritance with all possible combinations and selecting a group of object candidates, and their inheritance with all possible combinations and selecting a group with the best or optimal combination of candidates with respect to the degree of relativity and similarity between class candidates in the group and classes in a domain model. The methodology has innovative features in class candidates in the group and classes in a domain model. The methodology has innovative features in class and inheritance extraction: a clustering method based on both static (attribute) and dynamic (method) clustering, the combinatorial cases of grouping class candidate cases based on abstraction, a signature similarity measurement for inheritance relations among n class candidates or m classes, two-dimensional similarity measurement for inheritance relations among n class candidates or m classes, two-dimensional similarity measurement, that is, the horizontal measurement for overall group similarity between n class candidates and m classes, and the vertical measurement for specific similarity between a set of classes in a group of class candidates and a set of classes with the same class hierarchy in a domain model, etc. This methodology provides reengineering experts with a comprehensive and integrated environment to select the best or optimal group of class candidates.

• Journal of KIISE:Databases
• /
• v.31 no.1
• /
• pp.13-22
• /
• 2004

With the proliferation of multimedia data, there is an increasing need to support the indexing and retrieval of high-dimensional image data. Although there have been many efforts, the performance of existing multidimensional indexing methods is not satisfactory in high dimensions. Thus the dimensionality reduction and the approximate solution methods were tried to deal with the so-called dimensionality curse. But these methods are inevitably accompanied by the loss of precision of query results. Therefore, recently, the vector approximation-based methods such as the VA- file and the LPC-file were developed to preserve the precision of query results. However, the performance of the vector approximation-based methods depend largely on the size of the approximation file and they lose the advantages of the multidimensional indexing methods that prune much search space. In this paper, we propose a new index structure called the GC-tree for efficient similarity search in image databases. The GC-tree is based on a special subspace partitioning strategy which is optimized for clustered high-dimensional images. It adaptively partitions the data space based on a density function and dynamically constructs an index structure. The resultant index structure adapts well to the strongly clustered distribution of high-dimensional images.

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

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.26 no.10
• /
• pp.1341-1347
• /
• 2002

In order to improve efficiency of a system with three-dimensional flow characteristics, this paper presents a new method that overcomes three-dimensional effects by using two-dimensional CFD and neural network. The method was applied to shape optimization of cut-off in a multi-blade fan/scroll system. As the entrance conditions of two-dimensional CFD, the experimental values at the positions out of the inactive zone were used. The distributions of velocity and pressure obtained by two-dimensional CFD were compared with those of three-dimensional CFD and experimental results. It was found that the distributions of velocity and pressure have qualitative similarity. The results of two-dimensional CFD were used for teaming as target values of neural network. The optimal angle and radius of cut-off were determined as 71$^{\circ}$and 0.092 times the outer diameter of impeller, respectively. It is quantified in the previous report that the optimal angle and radius of cut-off are approximately 72$^{\circ}$and 0.08 times the outer diameter of impeller, respectively.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.768-772
• /
• 2009

This paper proposes a method for measurement three-dimensional trajectories of bubbles generated around a swimmer's arms from stereo high-speed camera videos. This method is based on two techniques: two-dimensional trajectory estimation in single-camera images and trajectory pair matching in stereo-camera images. The two-dimensional trajectory is estimated by block matching using similarity of bubble shape and probability of bubble displacement. The trajectory matching is achieved by a consistensy test using epipolar constraint in multiple frames. The experimental results in two-dimensional trajectory estimation showed the estimation accuracy of 47% solely by the general optical flow estimation, whereas 71% taking the bubble displacement into consideration. This concludes bubble displacement is an efficient aspect in this estimation. In three-dimensional trajectory estimation, bubbles were visually captured moving along the flow generated by an arm; which means an efficient material for swimmers to swim faster.

• Journal of Educational Research in Mathematics
• /
• v.16 no.2
• /
• pp.115-138
• /
• 2006

The purpose of this paper is to investigate students' constructing similarities in the understanding the problem phase and the devising a plan phase of problem solving. the relation between similarities that students construct and how students construct similarities is researched through case study. Based on the results from the research, authors reached a conclusion as following. All of two students constructed surface similarities in the beginning of the problem solving process and responded to the context of the problem information sensitively. Specially student who constructed the similarities and the difference in terms of a specific dimension by using diagram for herself could translate the equation which used to solve the base problem or the experienced problem into the equation of the target problem solution. However student who understood globally the target problem being based on the surface similarity could not translate the equation that she used to solve the base problem into the equation of target problem solution.