• The Journal of the Korea Contents Association
• /
• v.12 no.4
• /
• pp.476-484
• /
• 2012

Family member network of kings in Chosun dynasty shows scale free network properties as if most social networks do. One of distinct topological properties of the network is relatively high diameter that reflects dataset composed of the one generation continuously falling to next one. When k-core algorithm as a useful tool for obtaining a core network from the complex family member network was employed, it is possible to obtain hidden and valuable information from a complex network. Unfortunately, it is found that k-core algorithm is not useful tool for applying narrow and deep structural network. The family member network is composed of kings, queens, princes, and princesses. It is possible to separate sub-family members and to construct sub-family member networks such as queen-centered, prince-centered, and princess-centered networks. Sub-family member networks provide an useful and hidden information. These results provide new insight that is analyzed by network-based approaches for the family member of the kings in the Chosun dynasty.

• Journal of Intelligence and Information Systems
• /
• v.15 no.4
• /
• pp.159-182
• /
• 2009

We construct product networks from the retail transaction dataset of an off-line department store. In the product networks, nodes are products, and an edge connecting two products represents the existence of co-purchases by a customer. We measure the quantities frequently used for characterizing network structures, such as the degree centrality, the closeness centrality, the betweenness centrality and the centralization. Using the quantities, gender, age, seasonal, and regional differences of the product networks were analyzed and network characteristics of each product category containing each product node were derived. Lastly, we analyze the correlations among the three centrality quantities and draw a marketing strategy for the cross-selling.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.75-83
• /
• 1999

recently, a new hypercube-like interconnection network, the Z-cube, was proposed. The Z-cube retains most good topological properties, however, its node degree is 3/4 of hypercube's one. Considering hardware implementations, the Z-cube is a good alternative to the hypercube. In this paper, we obtained the diameter, fault diameter and the average distance between two nodes to evaluate the communication performance of the Z-cube. The recursive structure, the shortest path between two nodes I Z-cube and recurrence relation on the average distance were deduced, and node disjoint path was introduced. Although it is generally expected that the communication performance in an interconnection network with reduced node degree falls as much as that, this paper shows that the Z-cube's diameter is the same as the hypercube's one and the average distance between two nodes in Z-cube is about 1.125 times the average distance between two nodes in the hypercube and the fault diameter of Z-cube ranges approximately from 1.4times to 1.7times the fault diameter of the hypercube.

• The KIPS Transactions:PartA
• /
• v.10A no.4
• /
• pp.357-368
• /
• 2003

Evaluation of shape similarity for 3D models is essential in many areas - medicine, mechanical engineering, molecular biology, etc. Moreover, as 3D models are commonly used on the Web, many researches have been made on the classification and retrieval of 3D models. In this paper, we describe methods for 3D shape representation and major concepts of similarity evaluation, and analyze the key features of recent researches for shape comparison after classifying them into four categories including multi-resolution, topology, 2D image, and statistics based methods. In addition, we evaluated the performance of the reviewed methods by the selected criteria such as uniqueness, robustness, invariance, multi-resolution, efficiency, and comparison scope. Multi-resolution based methods have resulted in decreased computation time for comparison and increased preprocessing time. The methods using geometric and topological information were able to compare more various types of models and were robust to partial shape comparison. 2D image based methods incurred overheads in time and space complexity. Statistics based methods allowed for shape comparison without pose-normalization and showed robustness against affine transformations and noise.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.1
• /
• pp.67-78
• /
• 2005

We proposed a blind watermarking for 3D mesh model using the patch CEGIs. The CEGI is the 3D orientation histogram with complex weight whose magnitude is the mesh area and phase is the normal distance of the mesh from the designated origin. In the proposed algorithm we divide the 3D mesh model into the number of patch that determined adaptively to the shape of model and calculate the patch CEGIs. Some cells for embedding the watermark are selected according to the rank of their magnitudes in each of patches after calculating the respective magnitude distributions of CEGI for each patches of a mesh model. Each of the watermark bit is embedded into cells with the same rank in these patch CEGI. Based on the patch center point and the rank table as watermark key, watermark extraction and realignment process are performed without the original mesh. In the rotated model, we perform the realignment process using Euler angle before the watermark extracting. The results of experiment verify that the proposed algorithm is imperceptible and robust against geometrical attacks of cropping, affine transformation and vertex randomization as well as topological attacks of remeshing and mesh simplification.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.7
• /
• pp.821-829
• /
• 2004

A face recognition has been used for verifying and authorizing valid users, but its applications have been restricted according to lighting conditions. In order to minimizing the restricted conditions, this paper proposes a new algorithm of detecting the face from the input image obtained under the irregular lighting condition. First, the proposed algorithm extracts an edge difference image from the input image where a skin color and a face contour are disappeared due to the background color or the lighting direction. In the next step, it extracts a face region using the histogram of the edge difference image and the intensity information. Using the intensity information, the face region is divided into the horizontal regions with feasible facial features. The each of horizontal regions is classified as three groups with the facial features(including eye, nose, and mouth) and the facial features are extracted using empirical properties of the facial features. Only when the facial features satisfy their topological rules, the face region is considered as a face. It has been proved by the experiments that the proposed algorithm can detect faces even when the large portion of face contour is lost due to the inadequate lighting condition or the image background color is similar to the skin color.

• Spatial Information Research
• /
• v.19 no.3
• /
• pp.43-52
• /
• 2011

Recently, interest in location-based service (LBS) which utilizes a DBMS in mobile system environment has been increasing, and it is expected to overcome the existing file-based system's limitation in advanced in-vehicle system by utilizing DBMS's advantages such as efficient storage, transaction management, modelling and spatial queries etc. In particular, the road network data corresponds to the most essential domain in a route planning system, which needs efficient management and maintenance. Accordingly, this study aims to develop an efficient graph-based geodata model for topological network data and to support dynamic path computation algorithm based on heuristic approach in mobile LBS system. To achieve this goal, we design a data model for supporting the hierarchy of network, and implement a path planning system to evaluate its performance in mobile LBS system. Last but not least, we find out that the designed path computation algorithm with hierarchical graph model reduced the number of nodes used for finding and improved the efficiency of memory.

• Journal of Korea Spatial Information System Society
• /
• v.9 no.3
• /
• pp.25-33
• /
• 2007

The local governments of major cities in Korea are giving focus on public transportation to reduce congestion and improve accessibility in city areas. In this regards, the proper measurement of accessibility is now a key policy requirement for reorganizing the public transport network. Public transport routing problems, however, are considered to be highly complicated since a multi-mode travel generates different combinations of accessibility. While most of the previous research efforts on measuring transport accessibility are found at zone-levels, an alternative approach at a finer scale such as bus links and stops is presented in this study. We proposes a method to compute the optimal route choice of origin-destination pairs and measure the accessibility of the chosen modes combination based on topological configuration. The genetic algorithm is used for the computation of the journey paths, whereas the space syntax theory is used for the accessibility. This study used node-link data in GIS instead of axial lines which are manually drawn in space syntax. The resulting accessibilities of bus stops are calibrated by O-D survey data and the proposed process is tested on a CBD of Seoul.

• Korean Journal of Remote Sensing
• /
• v.36 no.5_2
• /
• pp.939-948
• /
• 2020

CAS500-1 and CAS500-2 are high-resolution Earth-observing satellites being developed and scheduled to launch for land monitoring of Korea. The satellite information will be used for land usage analysis, change detection, 3D topological monitoring, and so on. Satellite image data of region of interests must be acquired in the stereo mode from different positions for 3D information generation. Accurate 3D processing and 3D display of stereo satellite data requires the epipolar image resampling process considering the pushbroom sensor and the satellite trajectory. This study developed an epipolar image resampling module for CAS-500 stereo data processing and verified its accuracy performance by testing along-track, across-track, and heterogeneous stereo data.

• Journal of KIISE:Information Networking
• /
• v.31 no.3
• /
• pp.335-346
• /
• 2004

In this paper, we present a high-performance fault-tolerant switching networks using a deflection self-routing scheme, and present fault-diagnosis method for the network. We use the facts: 1) Each stage of the Banyan network is arrayed as the sequences of a Cyclic group of SEs. 2) There is the homomorphism between adjacent stages from a view of self-routing, so that all of each Cyclic group is the subgroup of the Cyclic group in the next stage, and there are factor groups due to such subgroup and homomorphism. We provide high-performance fault-tolerant switching networks of which the all links including augmented links are used as the alternate links detouring faulty links. We also present the fault diagnosis scheme for the proposed switching network that provide multiple paths for each input-output pair.