• Journal of the Korean Society for information Management
• /
• v.25 no.1
• /
• pp.149-171
• /
• 2008

Actually a diffusion of a Semantic Web application and utilization are situations insufficient extremely. Technology most important in Semantic Web application is construction of the Ontology which contents itself with characteristics of Semantic Web. Proposed a suitable a Method of Building Web Ontology for characteristics of Semantic Web and Web Ontology as we compared the existing Ontology construction and Ontology construction techniques proposed for Web Ontology construction, and we analyzed. And modeling did Ontology to bases to Description Logic and the any axiom rule that used an expression way of SWRL, and established Inference-based Web Ontology according to proposed ways. Verified performance of Ontology established through Ontology inference experiment. Also, established an Web Ontology-based Intelligence Image Retrieval System, to experiment systems for performance evaluation of established Web Ontology, and present an example of implementation of a Semantic Web application and utilization. Demonstrated excellence of a Semantic Web application to be based on Ontology through inference experiment of an experiment system.

• Genomics & Informatics
• /
• v.2 no.4
• /
• pp.191-194
• /
• 2004

Exponentially increasing biopathway data in recent years provide us with means to elucidate the large-scale modular organization of the cell. Given the existing information on metabolic and regulatory networks, inferring biopathway information through scientific reasoning or data mining of large scale array data or proteomics data get great attention. Naturally, there is a need for a user-friendly system allowing the user to combine large and diverse pathway data sets from different resources. We built a data warehouse - BIOWAY - for analyzing and visualizing biological pathways, by integrating and customizing resources. We have collected many different types of data in regards to pathway information, including metabolic pathway data from KEGG/LIGAND, signaling pathway data from BIND, and protein information data from SWISS-PROT. In addition to providing general data retrieval mechanism, a successful user interface should provide convenient visualization mechanism since biological pathway data is difficult to conceptualize without graphical representations. Still, the visual interface in the previous systems, at best, uses static images only for the specific categorized pathways. Thus, it is difficult to cope with more complex pathways. In the BIOWAY system, all the pathway data can be displayed in computer generated graphical networks, rather than manually drawn image data. Furthermore, it is designed in such a way that all the pathway maps can be expanded or shrinked, by introducing the concept of super node. A subtle graphic layout algorithm has been applied to best display the pathway data.

• The Transactions of the Korea Information Processing Society
• /
• v.13 no.7
• /
• pp.311-318
• /
• 2024

As the amount of data increases due to the development of artificial intelligence and the Internet, data management is becoming increasingly important, and the efficient utilization of data retrieval and memory space is crucial. In this study, we investigate how to optimize search speed and memory efficiency by analyzing data structure based on metadata. As a research method, we compared and analyzed the performance of the array, association list, dictionary binary tree, and graph data structures using metadata of photographic images, focusing on temporal and space complexity. Through experimentation, it was confirmed that dictionary data structure performs best in collection speed and graph data structure performs best in search speed when dealing with large-scale image data. We expect the results of this paper to provide practical guidelines for selecting data structures to optimize search speed and memory efficiency for the images data.

• Journal of the Korea Computer Graphics Society
• /
• v.17 no.4
• /
• pp.11-21
• /
• 2011

This paper proposes a method for decomposing a Hangul glyph of outline fonts into its initial, medial and final components using statistical-structural information. In a font family, the positions of components are statistically consistent and the stroke relationships of a Hangul character reflect its structure. First, we create the component histograms that accumulate the shapes and positions of the same components. Second, we make pixel clusters from character image based on pixel direction probabilities and extract the candidate strokes using position, direction, size of clusters and adjacencies between clusters. Finally, we find the best structural match between candidate strokes and predefined character model by relaxation labeling. The proposed method in this paper can be used for a study on formative characteristics of Hangul font, and for a font classification/retrieval system.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.05a
• /
• pp.338-341
• /
• 2003

According to a long-term master plan for the implementing of MOMAF's marine environmental informatization, we have developed marine environment portal web site which consists of 7 main-menu and 39 sub-menu including various types of contents (text, image and multimedia) based on RDBMS. This portal site was opened in Oct., 2002 (http://www.meps.info). Also, for the national institutions' distributed DB which is archived and managed respectively the marine chemical data and biological data, the integrated retrieval system was developed. This system is meaningful for the making collaborative use of real data and could be applied for data mining, marine research, marine environmental GIS and making-decisions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.7
• /
• pp.2599-2613
• /
• 2015

Multi-index hashing (MIH) is the state-of-the-art method for indexing binary codes, as it di-vides long codes into substrings and builds multiple hash tables. However, MIH is based on the dataset codes uniform distribution assumption, and will lose efficiency in dealing with non-uniformly distributed codes. Besides, there are lots of results sharing the same Hamming distance to a query, which makes the distance measure ambiguous. In this paper, we propose a data-oriented multi-index hashing method (DOMIH). We first compute the covariance ma-trix of bits and learn adaptive projection vector for each binary substring. Instead of using substrings as direct indices into hash tables, we project them with corresponding projection vectors to generate new indices. With adaptive projection, the indices in each hash table are near uniformly distributed. Then with covariance matrix, we propose a ranking method for the binary codes. By assigning different bit-level weights to different bits, the returned bina-ry codes are ranked at a finer-grained binary code level. Experiments conducted on reference large scale datasets show that compared to MIH the time performance of DOMIH can be improved by 36.9%-87.4%, and the search accuracy can be improved by 22.2%. To pinpoint the potential of DOMIH, we further use near-duplicate image retrieval as examples to show the applications and the good performance of our method.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.1
• /
• pp.1-14
• /
• 2010

With the rapid growth of 3D content industry fields, 3D content-based hashing (or hash function) has been required to apply to authentication, trust and retrieval of 3D content. A content hash can be a random variable for compact representation of content. But 3D content-based hashing has been not researched yet, compared with 2D content-based hashing such as image and video. This paper develops a robust 3D content-based hashing based on key-dependent 3D surface feature. The proposed hashing uses the block surface coefficient using shape coordinate of 3D SSD and curvedness for 3D surface feature and generates a binary hash by a permutation key and a random key. Experimental results verified that the proposed hashing has the robustness against geometry and topology attacks and has the uniqueness of hash in each model and key.

• The Korean Journal of Applied Statistics
• /
• v.32 no.1
• /
• pp.41-68
• /
• 2019

Multi-view learning considers data from various viewpoints as well as attempts to integrate various information from data. Multi-view learning has been studied recently and has showed superior performance to a model learned from only a single view. With the introduction of deep learning techniques to a multi-view learning approach, it has showed good results in various fields such as image, text, voice, and video. In this study, we introduce how multi-view learning methods solve various problems faced in human behavior recognition, medical areas, information retrieval and facial expression recognition. In addition, we review data integration principles of multi-view learning methods by classifying traditional multi-view learning methods into data integration, classifiers integration, and representation integration. Finally, we examine how CNN, RNN, RBM, Autoencoder, and GAN, which are commonly used among various deep learning methods, are applied to multi-view learning algorithms. We categorize CNN and RNN-based learning methods as supervised learning, and RBM, Autoencoder, and GAN-based learning methods as unsupervised learning.

• Korean Journal of Remote Sensing
• /
• v.32 no.6
• /
• pp.589-601
• /
• 2016

Sea surface currents were estimated by applying the Maximum Cross Correlation (MCC), Zero-mean Sum of Absolute Distances (ZSAD), and Zero-mean Sum of Squared Distances (ZSSD) algorithms to Himawari-8/Advanced Himawari Imager (AHI) thermal infrared channel data, and the comparative analysis was performed between the results of these algorithms. The sea surface currents of the Kuroshio Current region that were retrieved using each algorithm showed similar results. The ratio of errors to the total number of estimated surface current vectors had little difference according to the algorithms, and the time required for sea surface current calculation was reduced by 24% and 18%, relative to the MCC algorithm, for the ZSAD and ZSSD algorithms, respectively. The estimated surface currents were validated against those from satellite-tracked surface drifter and altimeter data, and the accuracy evaluation of these algorithms showed results within similar ranges. In addition, the accuracy was affected by the magnitude of brightness temperature gradients and the time interval between satellite image data.

• Journal of Korean Society for Geospatial Information Science
• /
• v.17 no.3
• /
• pp.81-87
• /
• 2009

This study aims to evaluate how efficiently time-worn building could be managed by using GPS-based video-logging systems. The digitally georeferencing video data taken by a hand-hold GPS-based video-logging system allows quick retrieval and effective management for the complicate and various superannuated building in urban area. The results of the study are as follows. Georeferencing data are possible to trace observed positions by using GPS linked with video and to provide building crack information anytime that could be used to inspect and analyze the safety hazard diagnosis of buildings. Building crack information were measured by the proposed method that is merged with feature tracking and image mosaic of sequenced images. From the study, it reveals that the georeferencing video technique provides more realistic and reliable information in safety diagnosis and it can also be used as the essential and modern tool in urban building management.