• 한국지능시스템학회논문지
• /
• 제19권5호
• /
• pp.725-729
• /
• 2009

intuitionistic fuzzy generalized topological space와 intuitionistic gradation of generalized openness의 개념을 소개한다. 한편 IFG-mapping, weak IFG-mapping과 IFG-open mapping의 개념을 소개하며 특성을 조사한다.

• 대한수학회논문집
• /
• 제25권3호
• /
• pp.335-342
• /
• 2010

The structure of fuzzy topological spaces based on WFI-algebras is considered. The notions of WFI-fuzzy topological spaces and WFI-fuzzy continuous mappings are introduced, and several properties are investigated. A relation between WFI-homomorphism and WFI-fuzzy continuous mapping is given.

• ETRI Journal
• /
• 제29권2호
• /
• pp.189-200
• /
• 2007

This paper addresses the localization and navigation problem in the movement of service robots by using invisible two dimensional barcodes on the floor. Compared with other methods using natural or artificial landmarks, the proposed localization method has great advantages in cost and appearance since the location of the robot is perfectly known using the barcode information after mapping is finished. We also propose a navigation algorithm which uses a topological structure. For the topological information, we define nodes and edges which are suitable for indoor navigation, especially for large area having multiple rooms, many walls, and many static obstacles. The proposed algorithm also has the advantage that errors which occur in each node are mutually independent and can be compensated exactly after some navigation using barcodes. Simulation and experimental results were performed to verify the algorithm in the barcode environment, showing excellent performance results. After mapping, it is also possible to solve the kidnapped robot problem and to generate paths using topological information.

• 대한기계학회논문집A
• /
• 제30권9호
• /
• pp.1124-1133
• /
• 2006

This paper addresses the localization and navigation problem using invisible two dimensional barcodes on the floor. Compared with other methods using natural/artificial landmark, the proposed localization method has great advantages in cost and appearance, since the location of the robot is perfectly known using the barcode information after the mapping is finished. We also propose a navigation algorithm which uses the topological structure. For the topological information, we define nodes and edges which are suitable for indoor navigation, especially for large area having multiple rooms, many walls and many static obstacles. The proposed algorithm also has an advantage that errors occurred in each node are mutually independent and can be compensated exactly after some navigation using barcode. Simulation and experimental results. were performed to verify the algorithm in the barcode environment, and the result showed an excellent performance. After mapping, it is also possible to solve the kidnapped case and generate paths using topological information.

• 전자공학회논문지S
• /
• 제35S권5호
• /
• pp.48-58
• /
• 1998

In this paper, we proposed a new algorithm using characteristics of th ereconstructed phase trajectory by topological mapping developed for a real-tiem detection of the QRS complexes of ECG signals. Using fill-factor algorithm and mutual information algorithm which are in genral used to find out the chaotic characteristics of sampled signals, we inferred the proper mapping parameter, time delay, in ECG signals and investigated QRS detection rates with varying time delay in QRS complex detection. And we compared experimental time dealy with the theoretical one. As a result, it shows that the experimental time dealy which is proper in topological mapping from ECG signals is 20ms and theoretical time delays of fill-factor algorithm and mutual information algorithm are 20.+-.0.76ms and 28.+-.3.51ms, respectively. From these results, we could easily infer that the fill-factor algorithm in topological mapping from one-dimensional sampled ECG signals to two-dimensional vectors, is a useful algorithm for the detemination of the proper ECG signals to two-dimensional vectors, is a useful algorithm for the detemination of the proper time delay. Also with the proposed algorithm which is very simple and robust to low-frequency noise as like baseline wandering, we could detect QRS complex in real-time by simplifying preprocessing stages. For the evaluation, we implemented the proposed algorithm in C-language and applied the MIT/BIH arrhythmia database of 48 patients. The proposed algorithm provides a good performance, a 99.58% detection rate.

• International Journal of CAD/CAM
• /
• 제5권1호
• /
• pp.69-81
• /
• 2005

As collaborative design and configuration design gain increasing importance in product development, it becomes essential to exchange parametric CAD models among participants. Parametric CAD models can be represented and exchanged in the form of a macro file or a part file that contains the modeling history of a product. The modeling history of a parametric CAD model contains feature specifications and each feature has selection information that records the name of the referenced topological entities. Translating this selection information requires solving the problems of how to identify the referenced topological entities of a feature (persistent naming problem) and how to convert the selection information into the format of the receiving CAD system (naming mapping problem). The present paper introduces the problem of exchanging parametric CAD models and proposes a solution to naming mapping.

• Korean Journal of Mathematics
• /
• 제24권4호
• /
• pp.663-679
• /
• 2016

In this paper, we introduce the concepts of several types of interval-valued intuitionistic fuzzy mappings and several types of interval-valued intuitionistic fuzzy compactness in interval-valued intuitionistic smooth topological spaces and then investigate their properties.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제10권2호
• /
• pp.142-145
• /
• 2010

We introduce the concept of IVF almost M-continuity and investigate characterizations for such mappings on the interval-valued fuzzy topological spaces. We study the relationships between IVF almost M-continuous mapping and IVF compactness.

• Journal of applied mathematics & informatics
• /
• 제9권2호
• /
• pp.793-806
• /
• 2002

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 Maps (SOM) provides a mapping from high dimensional feature vectors onto a two-dimensional space. The mapping preserves the topology of the feature vectors. The map is called topological feature map. 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. In topological feature map, there are empty nodes in which no image is classified. We experiment on the performance of our algorithm using color feature vectors extracted from images. Promising results have been obtained in experiments.

• 대한수학회보
• /
• 제44권3호
• /
• pp.537-545
• /
• 2007

Necessary conditions for the existence of common fixed points for noncommuting mappings satisfying generalized contractive conditions in the setup of certain metrizable topological vector spaces are obtained. As applications, related results on best approximation are derived. Our results extend, generalize and unify various known results in the literature.