• Journal of Broadcast Engineering
• /
• v.7 no.2
• /
• pp.126-135
• /
• 2002

An image contains various features such as color, shape, texture and location information. When only one of those features is used to retrieve an image, it is difficult to acquire satisfactory retrieval efficiency. Especially, in the database with huge capacity, such phenomenon happens frequently. Therefore, by using moi·e features, efficiency of the contents-based image retrieval (CBIR) system can be improved. This paper proposes a technique to consider location information about specific color as well as color information in image using centroid situation vector. Centroid situation vectors are calculated for specific color of the query image. Then, location similarity is determined through comparing distances between extracted centroid situation vectors of query image and target image in the database. Simulation results show that the proposed method is robust in zoom-in or zoom-out processed images and improves discrimination ability in fliped or rotated images. In addition, the suggested method reduced computational complexity by overlapping information extraction, and that improved the retrieval speed using an efficient index file.

• Journal of KIISE
• /
• v.42 no.3
• /
• pp.390-398
• /
• 2015

Spatial web objects refer to web documents that contain geographic information. Recently, services that create spatial web objects have increased greatly because of the advancements in devices such as smartphones. For services such as Twitter or Facebook, simple texts posted by users is stored along with information about the post's location. To search for such spatial web objects, a method that uses spatial information and text information simultaneously is required. Conventional spatial web object search methods mostly use R-tree and inverted file methods. However, these methods have a disadvantage of requiring a large volume of space when building indices. Furthermore, such methods are efficient for searching with many keywords but are inefficient for searching with a few keywords.. In this paper, we propose a spatial web object search method that uses a quad-tree and a patricia-trie. We show that the proposed technique is more effective than existing ones in searching with a small number of keywords. Furthermore, we show through an experiment that the space required by the proposed technique is much smaller than that required by existing ones.

• Journal of KIISE:Software and Applications
• /
• v.27 no.7
• /
• pp.712-722
• /
• 2000

In this paper, we suggest and test a classification technique of offence pattern from group formation to automatically index highlights of soccer games. A BP (Back-propagation) neural nets technique was applied to the information of the position of both the player and the ball on a ground, and the distance between the player and the ball to identify the group formation in space and time. The real soccer game scenes including '98 France World Cup were used to extract 297 video clips of various types of offence patterns; Left Running 60, Right Running 74, Center Running 72, Corner-kick 39 and Free-kick 52. The results are as follows: Left Running comes to 91.7%, Right Running 100%. Center Running 87.5%, Corner-kick 97.4% and Free-kick 75%, and these showed quite a satisfactory rate of recognition.

• Journal of KIISE:Databases
• /
• v.34 no.6
• /
• pp.546-553
• /
• 2007

As ontologies are used widely, interest for semantic similarity search is also increasing. In this paper, we suggest a query evaluation scheme for k-nearest neighbor query, which retrieves k most similar objects to the query object. We use the best match method to calculate the semantic similarity between objects and use the signature tree to index annotation information of objects in database. The signature tree is usually used for the set similarity search. When we use the signature tree in similarity search, we are required to predict the upper-bound of similarity for a node; the highest similarity value which can be found when we traverse into the node. So we suggest a prediction function for the best match similarity function and prove the correctness of the prediction. And we modify the original signature tree structure for same signatures not to be stored redundantly. This improved structure of signature tree not only reduces the size of signature tree but also increases the efficiency of query evaluation. We use the Gene Ontology(GO) for our experiments, which provides large ontologies and large amount of annotation data. Using GO, we show that proposed method improves query efficiency and present several experimental results varying the page size and using several node-splitting methods.

• The Journal of Society for e-Business Studies
• /
• v.14 no.4
• /
• pp.1-17
• /
• 2009

E-Catalogs which describe products or services are one of the most important data for the electronic commerce. E-Catalogs are created, updated, and removed in order to keep up-to-date information in e-Catalog database. However, when the number of catalogs increases, information integrity is violated by the several reasons like catalog duplication and abnormal classification. Catalog search, duplication checking, and automatic classification are important functions to utilize e-Catalogs and keep the integrity of e-Catalog database. To implement these functions, probabilistic models that use statistics of index words extracted from e-Catalogs had been suggested and the feasibility of the methods had been shown in several papers. However, even though these functions are used together in the e-Catalog management system, there has not been enough consideration about how to share common data used for each function and how to effectively manage statistics of index words. In this paper, we suggest a method to implement these three functions by using simple SQL supported by relational database management system. In addition, we use materialized views to reduce the load for implementing an application that manages statistics of index words. This brings the efficiency of managing statistics of index words by putting database management systems optimize statistics updating. We showed that our method is feasible to implement three functions and effective to manage statistics of index words with empirical evaluation.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.1 s.33
• /
• pp.93-100
• /
• 2005

This study is to desist and implement an efficient microbial medical image retrieval system based on knowledge and content of them which can make use of more accurate decision on colony as doll as efficient education for new techicians. For this. re first address overall inference to set up flexible search path using rule-base in order U redure time required original microbial identification by searching the fastest path of microbial identification phase based on heuristics knowledge. Next, we propose a color ffature gfraction mtU, which is able to extract color feature vectors of visual contents from a inn microbial image based on especially bacteria image using HSV color model. In addition, for better retrieval performance based on large microbial databases, we present an integrated indexing technique that combines with B+-tree for indexing simple attributes, inverted file structure for text medical keywords list, and scan-based filtering method for high dimensional color feature vectors. Finally. the implemented system shows the possibility to manage and retrieve the complex microbial images using knowledge and visual contents itself effectively. We expect to decrease rapidly Loaming time for elementary technicians by tell organizing knowledge of clinical fields through proposed system.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.11
• /
• pp.79-86
• /
• 2019

It is very important to analyze and provide information resources for research output produced in the computer field, the core science of the 4th Industrial Revolution. In this paper, SCI journals cited from domestic journals in the computer field were identified and the citation rankings and their co-citation networks were generated, analyzed, mapped and visualized. For this, the bibliographic and citation index information from 2015 to 2017 in the KSCD were used as the basis data, and the co-citation method and network centrality analysis were used. As a result of this study, the number of citations and the citation ranks of SCI journals and papers cited by korean journals in the computer field were analyzed, and peak time(2 years), half-life(6.6 years), and immediacy citation rate(2.4%) were measured by citation age analysis. As a result of network centrality analysis, Three network centralities(degree, betweenness, closeness) of the cited SCI journals were calculated, and the ranking of journals by each network centrality was measured, and the relationship between the subject classifications of the cited SCI journals was visualized through the mapping of the network.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.6 no.4
• /
• pp.59-70
• /
• 2003

Spatial data base system provides many query types and most of them are required frequent disk I/O and much CPU time. k-NN search is to find k-th closest object from the query point and up to now, several k-NN search methods have been proposed. Among these, MINMAX distance method has an aim not to access unnecessary node by adapting pruning technique. But this method accesses more disks than necessary while pruning unnecessary nodes. In this paper, we propose new k-NN search algorithm based on density of object. With this method, we predict the radius to be expected to contain k-NN objects using density of data set and search those objects within this radius and then adjust radius if failed. Experimental results show that this method outperforms the previous MINMAX distance method. This algorithm visit less disks than MINMAX method by the factor of maximum 22% and average 7%.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.4 s.346
• /
• pp.31-38
• /
• 2006

In this paper, we propose an efficient preceding scheme for STBC-Spatial Muiltiplexing OFDM systems. In MIMO systems, the precoder is designed on the assumption that feedback channel information is perfectly known to transmitter and receiver. However, feedback delay and link errors in real environment make the transmitter use the incorrect channel information and consequently cause the performance degradation. The proposed precoder is designed to compensate for the performance degradation by the diversity gain provided by STBC. At the transmitter, the precoder for each subcarrier is constructed by using the index of codebook, subcarrier correlation, and auto correlation of channel. From the simulation results, STBC-spatial multiplexing OFDM outperforms the preceded-spatial multiplexing OFDM at $SER=10^{-3}$ when the Doppler frequency is greater than 60Hz.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.5
• /
• pp.2383-2389
• /
• 2011

Ubiquitous applications require hybrid continuous query processing which processes both on-line data stream and spatial data in the disk. In the hybrid continuous spatial query processing, disk access costs for the high-volume spatial data should be minimized. However, previous indexing methods cannot reduce the disk seek time, because it is difficult that the data are stored in contiguity with others. Also, existing methods for the space-filling curve considering data cluster have the problem which does not cluster available data for queries. Therefore, we propose the region storage structure for efficient data access in hybrid continues spatial query processing. This paper shows that there is an obvious improvement of query processing costs through the contiguous data storing method and the group processing for user queries based on the region storage structure.