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

The ontology alignment has two kinds of major problems. First, the features used for ontology alignment are usually defined by experts, but it is highly possible for some critical features to be excluded from the feature set. Second, the semantic and the structural similarities are usually computed independently, and then they are combined in an ad-hoc way where the weights are determined heuristically. This paper proposes the modified parse tree kernel (MPTK) for ontology alignment. In order to compute the similarity between entities in the ontologies, a tree is adopted as a representation of an ontology. After transforming an ontology into a set of trees, their similarity is computed using MPTK without explicit enumeration of features. In computing the similarity between trees, the approximate string matching is adopted to naturally reflect not only the structural information but also the semantic information. According to a series of experiments with a standard data set, the kernel method outperforms other structural similarities such as GMO. In addition, the proposed method shows the state-of-the-art performance in the ontology alignment.

• 한국HCI학회:학술대회논문집
• /
• 2007.02a
• /
• pp.667-674
• /
• 2007

Facial expressions provide significant clues about one's emotional state; however, it always has been a great challenge for machine to recognize facial expressions effectively and reliably. In this paper, we report a method of feature-based adaptive motion energy analysis for recognizing facial expression. Our method optimizes the information gain heuristics of ID3 tree and introduces new approaches on (1) facial feature representation, (2) facial feature extraction, and (3) facial feature classification. We use minimal reasonable facial features, suggested by the information gain heuristics of ID3 tree, to represent the geometric face model. For the feature extraction, our method proceeds as follows. Features are first detected and then carefully "selected." Feature "selection" is finding the features with high variability for differentiating features with high variability from the ones with low variability, to effectively estimate the feature's motion pattern. For each facial feature, motion analysis is performed adaptively. That is, each facial feature's motion pattern (from the neutral face to the expressed face) is estimated based on its variability. After the feature extraction is done, the facial expression is classified using the ID3 tree (which is built from the 1728 possible facial expressions) and the test images from the JAFFE database. The proposed method excels and overcomes the problems aroused by previous methods. First of all, it is simple but effective. Our method effectively and reliably estimates the expressive facial features by differentiating features with high variability from the ones with low variability. Second, it is fast by avoiding complicated or time-consuming computations. Rather, it exploits few selected expressive features' motion energy values (acquired from intensity-based threshold). Lastly, our method gives reliable recognition rates with overall recognition rate of 77%. The effectiveness of the proposed method will be demonstrated from the experimental results.

• Journal of Intelligence and Information Systems
• /
• v.6 no.2
• /
• pp.41-47
• /
• 2000

Ideograph is a truly unifies data and procedural dependencies. Ideograph can be used to assist various program optimization, such as common expression elimination, code motion, constant folding etc. In this paper, we propose an improved representation of the data and control flow dependencies information for the efficient program execution. In pursuing this goal, we propose a model and in particularly implement a dependency information extractor and information table, which contains data and control flow information per a basic block And then we design and implementation of the optimized abstract syntax tree using Ideograph which has a control flow information and data flow information for source program.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.2
• /
• pp.103-112
• /
• 2000

CAD databases are the core element to the management of product information. A key to the successful use of the databases is a rational method of query to and retrieval from the databases. Although it is parts geometry that users eager to retrieve from the CAD databases, no system yet supports geometry-based query. This paper aims at developing a new method of assessing geometric similarity which can serve as the basis of geometric query for CAD database. The proposed method uses ASVP (Alternating Sums of Volumes with Partitioning) decomposition that is a volumetric representation of a part obtained from its boundary representation. A measure of geometric similarity between two solid models is defined on their ASVP tree representations. The measure can take into account overall shapes of parte, shapes of features and their locations. Several properties that a similarity measure needs to satisfy are discussed. The geometric query developed in this paper can be used in a wide range of applications using CAD databases, which include similarity-based design retrieval, variant process planning, and components selection from part library. An experiment has been carried out to demonstrate the effectiveness of the method, and the results are presented.

• The KIPS Transactions:PartA
• /
• v.9A no.3
• /
• pp.387-398
• /
• 2002

As whole genome sequences of many organisms have been revealed by small-scale genome projects, the intensive research on individual genes and their functions has been performed. However on-memory algorithms are inefficient to analysis of whole genome sequences, since the size of individual whole genome is from several million base pairs to hundreds billion base pairs. In order to effectively manipulate the huge sequence data, it is necessary to use the indexed data structure for external memory. In this paper, we introduce a workbench system for analysis and visualization of whole genome sequence using string B-tree that is suitable for analysis of huge data. This system consists of two parts : analysis query part and visualization part. Query system supports various transactions such as sequence search, k-occurrence, and k-mer analysis. Visualization system helps biological scientist to easily understand whole structure and specificity by many kinds of visualization such as whole genome sequence, annotation, CGR (Chaos Game Representation), k-mer, and RWP (Random Walk Plot). One can find the relations among organisms, predict the genes in a genome, and research on the function of junk DNA using our workbench.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.6
• /
• pp.132-140
• /
• 2003

In this paper, we propose a new scheme for view-dependent transmission of three-dimensional (3-D) polygonal mesh models with hierarchial partitioning. In order to make a view-dependent representation of 3-D mesh models, we combine sequential and progressive mesh transmission techniques. By setting higher priorities to visible parts than invisible parts, we can obtain good qualify of 3-D models in a limited transmission bandwidth. In this paper, we use a multi -layer representation of 3-D mesh models based on hierarchical partitioning. After representing the 3-D mesh model in a hierarchical tree, we determine resolutions of partitioned submeshes in the last level. Then, we send 3-D model data by view-dependent selection using mesh merging and mesh splitting operations. By the partitioned mesh merging operation, we can reduce the joint boundary information coded redundantly in the partitioned submeshes. We may transmit additional mesh information adaptively through the mesh spritting operation.

• Journal of Korean Society for Geospatial Information Science
• /
• v.18 no.2
• /
• pp.113-118
• /
• 2010

Recently, 3D-reconstruction for geographic information and study of geospatial information is progressing in various fields through national policy such as R&D business and pilot project. LiDAR system has a advantage of acquisition the 3D information data easily and densely so that is used in many different fields. Considering to characterist of the point data formed with 3D, it need a high specification CPU because it requires a number of processing operation for 2D form expressed by monitor. In contrast, 2D grid structure, like DEM, has a advantage on costs because of simple structure and processing speed. Therefore, purpose of this study is to solve the problem of requirement of more storage space, when LiDAR data stored in forms of 3D is used for 3D-geographic and 3D-buliding representation. Additionally, This study reconstitutes 2D-gird data to supply the representation data of 3D-geographic and presents the storage method which is available for detailed representation applying tree-structure and reduces the storage space.

• Science of Emotion and Sensibility
• /
• v.9 no.spc3
• /
• pp.209-224
• /
• 2006

Hierarchy which is often named as the tree-structure is used to reduce complexity and show primitive structures of complicated information. This paper aims at explaining information-visualization methods using hierarchies in multimedia domains and prospecting the possible applications by examining how they affect the user's tasks involved in information-seeking activities. As a result, four types of information visualization methods named Treemap, Hyperbolic, Cone Tree and DOI Tree employed in multimedia domain, are presented and pros and cons of each method are explained in this paper. Another important part is defining the core tasks and other related-tasks in information-seeking activities, such as, overview, zoom, filter, details-on-demand, relate, history, and extract. Followings are major findings. Treemap uses 'overview' as the core task, which makes user to gain a overall meaning of the whole information cluster. Hyperbolic and DOI Tree apply 'Boom' task through the function of focus+context or by the function of meaningful scaling to magnify or downsize each node. Cone Tree, also, makes the information organizer to classify the patterns of information acquired in the process of users' information-seeking activities by using 'extract' task. Through this study, it is finally found out that the information-visualization methods using hierarchies in multimedia domains should incorporate the wide variety of functional needs related to users' information-seeking behaviors beyond the visual representation of information.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.781-790
• /
• 1996

processors must be allocated to incoming tasks in a way that will maximize the processor utilization and minimize the system fragmentation. Thus, an efficient method of allocating processors in a hypercube is a key to system performance. In order to achieve this goal, it is necessary to detect the availability of a subcube of required size and merge the released small cubes to form a larger ones. This paper presents the tree-exchange algorithm which detemines the levels and partners of the binary tree representation of a hypercube, and an efficient allocation strategy using the algorithm. The complexity for search time of the algorithm is $O\ulcorner$n/2$\lrcorner$$\times$2n)and it shows good performance in comparison with other strategies.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.466-469
• /
• 2007

최근 늘어가는 통신 서비스에 대한 관심은 관련 이론 및 기술의 발전을 주도해 왔다. 이러한 통신 시스템에 관련한 문제들 중에 가장 근간이 되는 문제 중 하나는 최적 통신 걸침 나무 (OCST: Optimal Communication Spanning Tree) 문제이다. 본 논문에서는 이러한 최적 통신 걸침 나무 문제에 대한 해법으로 최적 통신 걸침 나무 문제에 적합한 새로운 유전자 표현법을 이용한 유전 알고리즘을 설계하여 구현한다. 제안하는 유전 알고리즘은 n개의 노드에 대해 n-2개의 숫자 열로 표현가능하다고 알려진 기존의 $Pr\ddot{u}fer$수 기반의 유전자 표현법을 개선하여 보다 더 최적 통신 걸침 문제에 적합하도록 고안한 새로운 유전자 표현법을 이용한다. 임의로 생성된 예제에 대한 수치 실험을 통해 통신시스템의 기본 문제 중 하나인 최적 통신 걸침 문제의 해법으로서의 제안 알고리즘의 유용성과 효율성을 확인한다.