• The Journal of the Korea Contents Association
• /
• v.9 no.12
• /
• pp.19-30
• /
• 2009

The service that has recently come into the spotlight utilizes the map to first approach the map and then provide various mash-up formed results through the interface. This service can provide precise information to the users but the map is barely reusable. The sketch-map system of this paper, unlike the existing large map system, uses the method of presenting the specific spot and route in XML document and then clustering among sketch-maps. The map service system is designed to show the optimum route to the destination in a simple outline map. It is done by renovating the spot presented by the map into optimum contents. This service system, through the process of analyzing, splitting and clustering of the sketch-map's XML document input, creates a valid form of a sketch-map. It uses the LCS(Longest Common Subsequence) algorithm for splitting and merging sketch-map in the process of query. In addition, the simulation of this system's expected effects is provided. It shows how the maps that share information and knowledge assemble to form a large map and thus presents the system's ability and role as a new research portal.

• Tunnel and Underground Space
• /
• v.14 no.6 s.53
• /
• pp.399-410
• /
• 2004

The utilization of AS(Artificial Intelligence) and Database could be considered as an useful access for the application of underground information from the point of a geotechnical methodology. Its detailed usage has been recently studied in many fields of geo-sciences. In this paper, the target of usage is on controlling the injection of grout which more scientific access is needed in the grouting that has been used a major method in many engineering application. As the proposals for this problem it is suggested the methodology consisting of a fuzzy-neural hybrid system and a database. The database was firstly constructed for parameters dynamically varied according to the conditions of rock mass during the injection of grout. And then the conceptional model for the fuzzy-neural hybrid system was investigated fer optimally finding the controlling range of the grout valve. The investigated model applied to four cases, and it is found that the controlling range of the grout valve was reasonably deduced corresponding to the mechanical phenomena occurred by the injection of grout. Consequently, the algorithm organizing the fuzzy-neural hybrid system and the database as a system can be considered as a tool for controlling the injection condition of grout.

• The KIPS Transactions:PartB
• /
• v.10B no.4
• /
• pp.465-472
• /
• 2003

For an effective pre-treatment process of a face input image, it is necessary to detect each of face components, calculate the face area, and estimate the rotary angle of the face. A proposed method of this study can estimate an robust result under such renditions as some different levels of illumination, variable fate sizes, fate rotation angels, and background color similar to skin color of the face. The first step of the proposed method detects the estimated face area that can be calculated by both adapted skin color Information of the band-wide HSV color coordinate converted from RGB coordinate, and skin color Information using histogram. Using the results of the former processes, we can detect a lip area within an estimated face area. After estimating a rotary angle slope of the lip area along the X axis, the method determines the face shape based on face information. After detecting eyes in face area by matching a partial template which is made with both eyes, we can estimate Y axis rotary angle by calculating the eye´s locations in three dimensional space in the reference of the face area. As a result of the experiment on various face images, the effectuality of proposed algorithm was verified.

• Journal of Korea Multimedia Society
• /
• v.10 no.4
• /
• pp.441-449
• /
• 2007

In clustering for image segmentation, large amount of computation and typical segmentation errors have been important problems. In the paper, we suggest a new method for minimizing these problems. Markers in marker-controlled watershed transform represent segmented areas because they are starting-points of extending areas. Thus, clustering restricted by marker pixels can reduce computational complexity. In our proposed method, the markers are selected by Gabor texture energy, and cluster information of them are generated by FCM (fuzzy c-mean) clustering. Generated areas from watershed transform are merged by using cluster information of markers. In the test of Brodatz' texture images, we improved typical partition-errors obviously and obtained less computational complexity compared with previous FCM clustering algorithms. Overall, it also took regular computational time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.12
• /
• pp.2318-2324
• /
• 2017

Quantum cryptography, which is emerging as a next generation password, is being studied by quantum cryptographic transfer protocols and quantum secret communication. Quantum key transfer protocol can be used in combination with the modern password because of the inefficiency of the use of the password, or the use of OTP(one time password). In this paper an algorithm for direct communication by means of direct cryptographic communications rather than quantum keys. The method of implementing quantum secure direct community was adopted using 2-channel methods using Einstein gravity field. Two channels were designed to adopt a quantum secret communication protocol that applies time delay between 2-channels of channel to apply time difference between 2-channels. The proposed time delay effect reflects the time delay by reflecting the gravitational lensing phenomenon. Gravity generator with centrifugal acceleration is incorporated in the viscometer, and the time delay using this implies the correlation between the variance of the metametry.

• Journal of KIISE:Software and Applications
• /
• v.36 no.4
• /
• pp.298-305
• /
• 2009

In contrast to content_based filtering systems, collaborative filtering systems not only don't contain information of items, they can not recommend items when users don't provide the information of their interests. In this paper, we propose the recommender agent using association item tree to solve the shortcomings of collaborative filtering systems. Firstly, the proposed method clusters users into groups using vector space model and K-means algorithm and selects group typical rating values. Secondly, the degree of associations between items is extracted from computing mutual information between items and an associative item tree is generated by group. Finally, the method recommends items to an active user by using a group typical rating value and an association item tree. The recommender agent recommends items by combining user information with item information. In addition, it can accurately recommend items to an active user, whose information is insufficient at first rate, by using an association item tree based on mutual information for the similarity between items. The proposed method is compared with previous methods on the data set of MovieLens recommender system.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.22 no.4
• /
• pp.215-228
• /
• 2019

HDF5 data format is used to effectively store and distribute large volume of Geostationary Ocean Color Imager(GOCI) satellite data. The Korea Ocean Satellite Center has developed and provided a GOCI Data Processing System(GDPS) for general users who are not familiar with HDF5 format. Nevertheless, it is not easy to merge and process Hierarchical Data Format version5(HDF5) data that requires an understanding of satellite data characteristics, needs to learn how to use GDPS, and stores location and attribute information separately. Therefore, the open source R and rhdf5, data.table, and matrixStats packages were used to develop algorithm that could easily utilize satellite data in HDF5 format without the need for the process of using GDPS.

• Journal of Internet Computing and Services
• /
• v.8 no.3
• /
• pp.75-83
• /
• 2007

Multithreaded model is an effective parallel system in that it can reduce the long memory reference latency time and solve the synchronization problems. When compiling the non-strict functional programs for the multithreaded parallel machine, the most important thing is to find an set of sequentially executable instructions and to partitions them into threads. The existing partitioning algorithm partitions the condition of conditional expression, true expression and false expression into the basic blocks and apply local partitioning to these basic blocks. We can do the better partitioning if we modify the definition of the thread and allow the branching within the thread. The branching within the thread do not reduce the parallelism, do not increase the number of synchronization and do not violate the basic rule of the thread partitioning. On the contrary, it can lengthen the thread and reduce the number of synchronization. In the paper, we enhance the method of the partition of threads by combining the three basic blocks into one of two blocks.

• Journal of Advanced Navigation Technology
• /
• v.22 no.5
• /
• pp.472-477
• /
• 2018

In this paper, we develop interactive content services for preventing depression of users through an intelligent Internet of Things(IoT) mirror system. For interactive content services, an IoT mirror device measures attention and meditation data from an EEG headset device and also measures facial expression data such as "sad", "angery", "disgust", "neutral", " happy", and "surprise" classified by a multi-layer perceptron algorithm through an webcam. Then, it sends the measured data to an oneM2M-compliant IoT server. Based on the collected data in the IoT server, a machine learning model is built to classify three levels of depression (RED, YELLOW, and GREEN) given by a proposed merge labeling method. It was verified that the k-nearest neighbor (k-NN) model could achieve about 93% of accuracy by experimental results. In addition, according to the classified level, a social network service agent sent a corresponding alert message to the family, friends and social workers. Thus, we were able to provide an interactive content service between users and caregivers.

• Journal of Broadcast Engineering
• /
• v.18 no.2
• /
• pp.185-195
• /
• 2013

In this paper, we propose a video summarization technique on a smartphone, based on spatiotemporal saliency. The proposed technique detects scene changes by computing the difference of the color histogram, which is robust to camera and object motion. Then the similarity between adjacent frames, face region, and frame saliency are computed to analyze the spatiotemporal saliency in a video clip. Over-segmented hierarchical tree is created using scene changes and is updated iteratively using mergence and maintenance energies computed during the analysis procedure. In the updated hierarchical tree, segmented frames are extracted by applying a greedy algorithm on the node with high saliency when it satisfies the reduction ratio and the minimum interval requested by the user. Experimental result shows that the proposed method summaries a 2 minute-length video in about 10 seconds on a commercial smartphone. The summarization quality is superior to the commercial video editing software, Muvee.