• Journal of KIISE:Databases
• /
• v.32 no.6
• /
• pp.650-661
• /
• 2005

As the Internet is growing, the use of XML which is a standard of semi-structured document is increasing. Therefore, there are on going works about integration and retrieval of XML documents. However, the basis of efficient integration and retrieval of documents is to cluster XML documents with similar structure. The conventional XML clustering approaches use the hierarchical clustering algorithm that produces the demanded number of clusters through repeated merge, but it have some problems that it is difficult to compute the similarity between XML documents and it costs much time to compare similarity repeatedly. In order to address this problem, we use clustering algorithm for transactional data that is scale for large size of data. In this paper we use common structures from XML documents that don't have DTD or schema. In order to use common structures of XML document, we extract representative structures by decomposing the structure from a tree model expressing the XML document, and we perform clustering with the extracted structure. Besides, we show efficiency of proposed method by comparing and analyzing with the previous method.

• The KIPS Transactions:PartD
• /
• v.14D no.5
• /
• pp.491-500
• /
• 2007

In order to classify and manage on-line trading goods, the product classification scheme must be maintained. In most systems for handling product information, the classification scheme is managed manually by experts, which in general incurs a lot of time and cost. Effective management of classification system becomes more important as rapid development of industry expedites diversity and convergence of goods and services. There have been many researches on developing classification scheme, and continuing in this line of research, this paper proposes a new method for automatic generation of product classification scheme. Our main idea starts from the concept that a product is a set of attributes, and we propose a novel algorithm for automatically creating hierarchical classification scheme by utilizing inclusive relationships between products. We then prove the effectiveness of proposed algorithm by conducting an experiment.

• The KIPS Transactions:PartC
• /
• v.12C no.3 s.99
• /
• pp.419-428
• /
• 2005

This paper divides domains into the intra, inter domain according to the mobile node's movement and .proposes the Fast RSVP algorithm on the HMIPv6. It is done to advance reservation using L2 beacon signal when MN is located to overlapped cell area. In case of intra-region handoff, the advance reservation is reserved at the nearest common router and In case of inter-region handoff, it is done to advance reservation through the other site MAP's QA(QoS Agent) to the AR and optimize CN's path. Because of using the bandwidth efficiently and switching the data path quickly, the proposal algorithm minimizes the service disruption by data routing.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.5
• /
• pp.616-621
• /
• 2006

Recently many cars are equipping a navigation system. The main purpose of the early system guides a user through the route. A navigation system includes various abilities by development of various technologies and it has given more convenience to user. It can play various records on the tape and announces which are useful information about each road. Also it can use various multi-media contents by DMB device during driving. However, guide function of basic and important road in the navigation system has not grown greatly yet. In this paper, we proposed recommendation method of human-friendly road considering user's condition through various information of outside environment, user's velocity intention, a driver's emotion and a preference of the road. Modules consists of hierarchical structure that can easily correct and add each algorithm and those use fuzzy logic algorithm.

• Korean Journal of Remote Sensing
• /
• v.20 no.2
• /
• pp.125-137
• /
• 2004

In case of using image sequence taken from a moving camera along a road in an urban area, general video mosaicing technique based on a single baseline cannot create 2-D image mosaics. To solve the drawback, this paper proposed a new image mosaicing technique through 3-D multi-baselines that can create image mosaics in 3-D space. The core of the proposed method is that each image frame has a dependent baseline, an equation of first order, calculated by using ground control point (GCP) of optical flows. The proposed algorithm consists of 4 steps: calculation of optical flows using hierarchical strategy, calculation of camera exterior orientation, determination of multi-baselines, and seamless image mosaics. This paper realized and showed the proposed algorithm that can create efficient image mosaics in 3-D space from real image sequence.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.941-944
• /
• 2009

In this paper, we present a improved algorithm for thinning vein pattern. The vein image scanned using near infra-red is sliced in the horizontality or verticality direction, and then average value is gained from each slice image. Using curvature value changed from average value, search candidate part and extract vein pattern through re-searched candidate part in overlapping area. For the extracted vein pattern connecting, we proposed a DAL method that verify distance, angle and luminosity on pattern before tracking pattern extracted. The proposed improved thinning method is helpful for accurate connecting of vein pattern more than method used distance material in candidate part.

• The Journal of Korean Association of Computer Education
• /
• v.21 no.6
• /
• pp.39-47
• /
• 2018

This paper dealt with investigating the number of minimal spanning ladders originated from ladder game and their properties as well as the related computational thinking aspects. The author modified the filtering techniques to enhance Mathematica project where a new type of graph was generated based on the algorithm using a generator of firstly found minimal spanning graph by repeatedly applying independent ladder operator to a subsequence of ladder sequence. The newly produced YC graphs had recursive and hierarchical graph structures and showed the properties of edge-symmetric. As the computational complexity increased the author divided the whole search space into the each floor of the newly generated minimal spanning graphs for the (5, 10) YC graph and the higher (6, 15) YC graph. It turned out that the computational thinking capabilities such as data visualization, abstraction, and parallel computing with Mathematica contributed to enumerating the new YC graphs in order to investigate their structures and properties.

• Smart Media Journal
• /
• v.10 no.3
• /
• pp.23-30
• /
• 2021

Although the manufacturing time series data clustering technique is an important grouping solution in the field of detecting and improving manufacturing large data-based equipment and process defects, it has a disadvantage of low accuracy when applying the existing static data target clustering technique to time series data. In this paper, an evolutionary computation-based time series cluster analysis approach is presented to improve the coherence of existing clustering techniques. To this end, first, the image shape resulting from the manufacturing process is converted into one-dimensional time series data using linear scanning, and the optimal sub-clusters for hierarchical cluster analysis and split cluster analysis are derived based on the Pearson distance metric as the target of the transformation data. Finally, by using a genetic algorithm, an optimal cluster combination with minimal similarity is derived for the two cluster analysis results. And the performance superiority of the proposed clustering is verified by comparing the performance with the existing clustering technique for the actual manufacturing process image.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.11
• /
• pp.1477-1483
• /
• 2020

The stability guarantee of wireless network based control systems is still challenging due to the lossy links and node failures. This paper proposes a hierarchical cluster-based network protocol called robust wireless sensor and actuator network (R-WSAN) by combining time, channel, and space resource diversity. R-WSAN includes a scheduling algorithm to support the network resource allocation and a control task sharing scheme to maintain the control stability of multiple plants. R-WSAN was implemented on a real test-bed using Zolertia RE-Mote embedded hardware platform running the Contiki-NG operating system. Our experimental results demonstrate that R-WSAN provides highly reliable and robust performance against lossy links and node failures. Furthermore, the proposed scheduling algorithm and the task sharing scheme meet the stability requirement of control systems, even if the controller fails to support the control task.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.12
• /
• pp.1528-1534
• /
• 2019

Recently, due to the popularization of 3D depth cameras, new researches and opportunities have been made in research conducted on RGB images, but estimation of human hand pose is still classified as one of the difficult topics. In this paper, we propose a robust estimation method of human hand pose from various input 3D depth images using a learning algorithm. The proposed approach first generates a skeleton-based hand model and then aligns the generated hand model with three-dimensional point cloud data. Then, using a random forest-based learning algorithm, the hand pose is strongly estimated from the aligned hand model. Experimental results in this paper show that the proposed hierarchical approach makes robust and fast estimation of human hand posture from input depth images captured in various indoor and outdoor environments.