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

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.11 no.4
• /
• pp.254-258
• /
• 2011

In this paper, we introduce the notion of fuzzy (r, s)-S1-pre-semicontinuous mappings on intuitionistic fuzzy topological spaces in $\check{S}$ostak's sense, which is a generalization of $S_1$-pre-semicontinuous mappings by Shi-Zhong Bai. The relationship between fuzzy (r, s)-pre-semicontinuous mapping and fuzzy (r, s)-$S_1$-pre-semicontinuous mapping is discussed. The characterizations for the fuzzy (r, s)-$S_1$-pre-semicontinuous mappings are obtained.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.5 no.2
• /
• pp.20-28
• /
• 1996

Compound surface modeling is widely used for die cavities and punches. A compound surface is defined in 3-D space by specifying the topological relationship of several anlytic surface elements and a sculptured surface. A constructive solid gemonetry scheme is employed to model the analytic compound surface. the desired compound surface can be accomplished by specifying topological reationship in terms of boolean relations between pimitives and the sculptured surfaces. Additionally, a method is presented for checking and avoiding the tool interference occuued in machining the compound surface. Using this method. the interference of concave, convex, and side region can be checked easily and avoided rpapidly.

• Journal of the Korean Mathematical Society
• /
• v.44 no.6
• /
• pp.1383-1396
• /
• 2007

The aim of this paper is to study L-fuzzy uniformizable spaces. A new kind of topological fuzzy remote neighborhood system is defined and used for investigating the relationship between L-fuzzy co-topology and L-fuzzy (quasi-)uniformity. It is showed that this fuzzy remote neighborhood system is different from that in [23] when $\mathcal{U}$ is an L-fuzzy quasi-uniformity and they will be coincident when $\mathcal{U}$ is an L-fuzzy uniformity. It is also showed that each L-fuzzy co-topological space is L-fuzzy quasi-uniformizable.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.612-614
• /
• 2003

In this paper we propose four-dimensional (4D) operators, which can be used to deal with sequential changes of topological relationships between 4D moving objects and we call them 4D development operators. In contrast to the existing operators, we can apply the operators to real applications on 4D moving objects. We also propose a new approach to define them. The approach is based on a dimension-separated method, which considers x-y coordinates and z coordinates separately. In order to show the applicability of our operators we show the algorithms for the proposed operators and development graph between 4D moving objects.

• Journal of the Korean Mathematical Society
• /
• v.56 no.5
• /
• pp.1285-1307
• /
• 2019

For a multiplication R-module M we consider the Zariski topology in the set Spec (M) of prime submodules of M. We investigate the relationship between the algebraic properties of the submodules of M and the topological properties of some subspaces of Spec (M). We also consider some topological aspects of certain frames. We prove that if R is a commutative ring and M is a multiplication R-module, then the lattice Semp (M/N) of semiprime submodules of M/N is a spatial frame for every submodule N of M. When M is a quasi projective module, we obtain that the interval ${\uparrow}(N)^{Semp}(M)=\{P{\in}Semp(M){\mid}N{\subseteq}P\}$ and the lattice Semp (M/N) are isomorphic as frames. Finally, we obtain results about quantales and the classical Krull dimension of M.

• Spatial Information Research
• /
• v.18 no.5
• /
• pp.93-105
• /
• 2010

Spatial neighborhoods are spaces which are relate to target space. A 3D spatial query which is a function for searching spatial neighborhoods is a significant function in spatial analysis. Various methodologies have been proposed in related these studies, this study suggests an adjacent based methodology. The methodology of this paper implements topological data for represent a adjacency via using network based topological data model, then apply modifiable Dijkstra's algorithm to each topological data. Results of ordering analysis about an adjacent space from a target space were visualized and considered ways to take advantage of. Object of this paper is to implement a 3D spatial query for searching a target space with a adjacent relationship in 3D space. And purposes of this study are to 1)generate adjacency based 3D network data via network based topological data model and to 2)implement a 3D spatial query for searching spatial neighborhoods by applying Dijkstra's algorithms to these data.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.15 no.1
• /
• pp.79-86
• /
• 2015

This paper is devoted to finding relationship between intuitionistic fuzzy preorders and intuitionistic fuzzy topologies. For any intuitionistic fuzzy preordered space, an intuitionistic fuzzy topology will be constructed. Conversely, for any intuitionistic fuzzy topological space, we obtain an intuitionistic fuzzy preorder on the set. Moreover, we will show that the family of all intuitionistic fuzzy preorders on an underlying set has a very close link to the family of all intuitionistic fuzzy topologies on the set satisfying some extra condition.

• Journal for History of Mathematics
• /
• v.10 no.1
• /
• pp.19-32
• /
• 1997

This paper deals with the relationship between the order structure and topological structure in the historical point of view. We first investigate how the order structure has developed along with the set theory and logic in the second half of the nineteenth century. After the general topology has emerged in the beginning of the twentieth century, two disciplines of the order theory and topology give each other a great deal of effect for their development via various dualities, compactifications by maximal filter spaces and Alexandroff's specialization order, which form eventually a fundamental setting for the development of the category theory or functor theory.

• Journal of the Chungcheong Mathematical Society
• /
• v.36 no.2
• /
• pp.135-148
• /
• 2023

We prove that for any preordered intuitionistic fuzzy approximation space, an intuitionistic fuzzy topology can be created, and conversely, for any intuitionistic fuzzy topology, a reflexive intuitionistic fuzzy relation can be constructed. We also show that there is a relationship, called Galois correspondence, between the functors of these categories. Additionally, by applying certain limitations on the category of intuitionistic fuzzy topological spaces, we obtain an isomorphism between these categories.