• Journal of Electrical Engineering and information Science
• /
• v.2 no.5
• /
• pp.45-50
• /
• 1997

This paper present an advanced fault diagnosis expert system to assist the operators at local control center. The system utilizes all th information available in a local control center for the better diagnostic performance. The major feature of the system is dealing with multiple faults diagnosis based on the certainty factor method for the reasoning process. the overall performance and the generality are also enhanced by utilizing the general topological knowledge. ASCADA simulator is also developed for he test and demonstration.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10a
• /
• pp.165-167
• /
• 1999

공간 관계는 공간 데이터베이스에서 질의 최적화를 위해 중요한 역할을 한다. 만일 공간 객체간의 공간 관계를 미리 알 수 있다면, 비용이 많이 드는 질의 처리는 피할 수 있다. 공간 데이터에 대한 공간 관계의 질의를 효과적으로 답하기 위해서는 각 공간 객체들의 공간 관계 파악이 중요하다. 그러나 방대한 양의 공간 데이터에 대하여 객체간의 모든 공간 관계를 저장한다는 것을 사실상 불가능하다. 이러한 문제를 해결하기 위해서는 자주 사용하는 공간 관계를 저장하고 자주 사용하지 않는 관계는 필요시 생성하는 것이 효율적이다. 본 논문에서는 공간 관계가 일부 주어졌을 때 주어진 공간 관계로부터 새로운 공간관계를 추론하기 위한 공간 관계 추론 규칙을 제시하고자 한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.574-575
• /
• 2010

최근 생활이 발전할수록 조화로운 색의 선택에 관한 관심이 점점 높아지고 있다. 오스트발드 컬러조화이론에서 발전한 NCS 는 각 색상이 퍼센트 별로 수치화되어 시스템화되기 용이한 장점이 있다. 본 연구에서는 NCS 적용을 위한 오스트발드의 이론을 분석하고 이들 가운데 대표적인 컬러 조화론의 적용을 위한 위상적 매치 방안을 제안함으로써 향후 다양한 컬러 연구에 활용하고자 하였다.

• The KIPS Transactions:PartB
• /
• v.8B no.5
• /
• pp.515-522
• /
• 2001

Feature-based similarity retrieval become an important research issue in image database systems. The features of image data are useful to discrimination of images. In this paper, we propose the highspeed k-Nearest Neighbor search algorithm based on Self-Organizing Maps. Self-Organizing Map(SOM) provides a mapping from high dimensional feature vectors onto a two-dimensional space. A topological feature map preserves the mutual relations (similarity) in feature spaces of input data, and clusters mutually similar feature vectors in a neighboring nodes. Each node of the topological feature map holds a node vector and similar images that is closest to each node vector. We implemented about k-NN search for similar image classification as to (1) access to topological feature map, and (2) apply to pruning strategy of high speed search. We experiment on the performance of our algorithm using color feature vectors extracted from images. Promising results have been obtained in experiments.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.12 no.2
• /
• pp.11-17
• /
• 1975

The paper examined the character structure as a basic study for the recognition of Korean characters. In view of concave structure, line structure and node relationship of character graph, the algebraic structure of the basic Korean characters is are analized. Also, the degree of complexities in their character structure is discussed and classififed. Futhermore, by describing the fact that some equivalence relations are existed between the 10 vowels of rotational transformation group by Affine transformation of one element into another, it could be pointed out that the geometrical properting in addition to the topological properties are very important for the recognition of Korean characters.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.34 no.3
• /
• pp.329-338
• /
• 2016

As the need of indoor spatial information has grown, many applications have been developed. Nevertheless, the major representations of indoor spatial information are on the 2D or 3D, recently, the service based on omni-directional image has increased. Current service based on omni-directional image is used just for viewer. To provide various applications which can serve the identifying the attribute of indoor space, query based services and so on, topological data which can define the spatial relationships between spaces is required. For developing diverse applications based on omni-directional image, this study proposes the method to generate IndoorGML data which is the international standard of indoor topological data model. The proposed method is consist of 3 step to generate IndoorGML data; 1) Analysis the core elements to adopt IndoorGML concept to image, 2) Propose the method to identify the element of ‘Space’ which is the core element of IndoorGML concept, 3) Define the connectivity of indoor spaces. The proposed method is implemented at the 6-floor of 21centurybuilding of the University of Seoul to generate IndoorGML data and the demo service is implemented based on the generated data. This study has the significance to propose a method to generate the indoor topological data for the indoor spatial information services based on the IndoorGML.

• Korean Journal of Computational Design and Engineering
• /
• v.6 no.1
• /
• pp.24-30
• /
• 2001

An efficient and robust algorithm to compute the exact Voronoi diagram of a circle set is presented. The circles are located in a two dimensional Euclidean space, the radii of the circles are non-negative and not necessarily equal, and the circles are allowed to intersect each other. The idea of the algorithm is to use the topology of the point set Voronoi diagram as a seed so that the correct topology of the circle set Voronoi diagram can be obtained through a number of edge flipping operations. Then, the geometries of the Voronoi edges of the circle set Voronoi diagram are computed. In particular, this paper discusses the topological aspect of the algorithm, and the following paper discusses the geometrical aspect. The main advantages of the proposed algorithm are in its robustness, speed, and the simplicity in its concept as well as implementation. Since the algorithm is based on the result of the point set Voronoi diagram and the flipping operation is the only topological operation, the algorithm is always as stable as the Voronoi diagram construction algorithm of a point set.

• Journal of the Korea society of information convergence
• /
• v.7 no.2
• /
• pp.59-65
• /
• 2014

Grassfire spot matching method is based on similarity comparison of topological patterns for neighbor spots. This is a method where spot matching is performed as if fire spreads all around on grass. Spot matching starts from a seed spot pair confirmed as a matched pair of spots and spot matching spreads to the direction where the best matching result is produced. In this paper, it is a bit complicated way of grassfire method where multi-seed matched spot pair are manually selected and spot matching is performed from each multi-seed matched spot pair. The proposed method shows better performance in detection rate and accuracy than that of the previous method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.8
• /
• pp.999-1007
• /
• 1999

이 논문은 재귀원형군 G(2^m , 2^k )를 그래프 이론적 관점에서 고찰하고 정점이 서로소인 사이클과 그래프 invariant에 관한 위상 특성을 제시한다. 재귀원형군은 1 에서 제안된 다중 컴퓨터의 연결망 구조이다. 재귀원형군 {{{{G(2^m , 2^k )가 길이 사이클을 가질 필요 충분 조건을 구하고, 이 조건하에서 G(2^m , 2^k )는 가능한 최대 개수의 정점이 서로소이고 길이가l`인 사이클을 가짐을 보인다. 그리고 정점 및 에지 채색, 최대 클릭, 독립 집합 및 정점 커버에 대한 그래프 invariant를 분석한다.Abstract In this paper, we investigate recursive circulant G(2^m , 2^k ) from the graph theory point of view and present topological properties of G(2^m , 2^k ) concerned with vertex-disjoint cycles and graph invariants. Recursive circulant is an interconnection structure for multicomputer networks proposed in 1 . A necessary and sufficient condition for recursive circulant {{{{G(2^m , 2^k ) to have a cycle of lengthl` is derived. Under the condition, we show that G(2^m , 2^k ) has the maximum possible number of vertex-disjoint cycles of length l`. We analyze graph invariants on vertex and edge coloring, maximum clique, independent set and vertex cover.

• The KIPS Transactions:PartB
• /
• v.9B no.1
• /
• pp.35-46
• /
• 2002

The EEG is a time series of electrical potentials representing the sum of a very large number of neuronal dendrite potentials in the brain. The collective dynamic behavior of neural mass of different brain structures can be assessed from EEG with depth electrodes measurements at regular time intervals. In recent years, the theory of nonlinear dynamics has developed methods for quantitative analysis of brain function. In this paper, we considered it is reasonable or not for ICA apply to EEG analysis. Then we applied ICA to EEG for big toe movement and separated the independent components for 15 samples. The strength of each independent component can be represented on the topological map. We represented ICA can be applied for time and spatial analysis of EEG.