• Title/Summary/Keyword: Topological Analysis Method

Search Result 104, Processing Time 0.023 seconds

Estimation of Landslide Risk based on Infinity Flow Direction (무한방향흐름기법을 이용한 산사태 위험도 평가)

  • Oh, Sewook;Lee, Giha;Bae, Wooseok
    • Journal of the Korean GEO-environmental Society
    • /
    • v.20 no.2
    • /
    • pp.5-18
    • /
    • 2019
  • In this study, it was conducted a broad-area landslide analysis for the entire area of Kyungsangbuk-do Province based on spatially-distributed wetness index and root reinforcement infinity slope stability theory. Specifically, digital map, soil map and forest map were used to extract topological and geological parameters, and to build spatially-distributed database at $10m{\times}10m$ resolution. Infinity flow direction method was used for rain catchment area to produce spatially-distributed wetness index. The safety level that indicates risk of a broad-area landslide was classified into four groups. The result showed that areas with a high estimated risk of a landslide coincided with areas that recently went through an actual landslide, including Bonghwa and Gimcheon, and unstable areas were clustered around mountainous areas. A comparison between the estimation result and the records of actual landslide showed that the analysis model is effective for estimating a risk of a broad-area landslide based on accumulation of reasonable parameters.

Social Network Analysis for the Effective Adoption of Recommender Systems (추천시스템의 효과적 도입을 위한 소셜네트워크 분석)

  • Park, Jong-Hak;Cho, Yoon-Ho
    • Journal of Intelligence and Information Systems
    • /
    • v.17 no.4
    • /
    • pp.305-316
    • /
    • 2011
  • Recommender system is the system which, by using automated information filtering technology, recommends products or services to the customers who are likely to be interested in. Those systems are widely used in many different Web retailers such as Amazon.com, Netfix.com, and CDNow.com. Various recommender systems have been developed. Among them, Collaborative Filtering (CF) has been known as the most successful and commonly used approach. CF identifies customers whose tastes are similar to those of a given customer, and recommends items those customers have liked in the past. Numerous CF algorithms have been developed to increase the performance of recommender systems. However, the relative performances of CF algorithms are known to be domain and data dependent. It is very time-consuming and expensive to implement and launce a CF recommender system, and also the system unsuited for the given domain provides customers with poor quality recommendations that make them easily annoyed. Therefore, predicting in advance whether the performance of CF recommender system is acceptable or not is practically important and needed. In this study, we propose a decision making guideline which helps decide whether CF is adoptable for a given application with certain transaction data characteristics. Several previous studies reported that sparsity, gray sheep, cold-start, coverage, and serendipity could affect the performance of CF, but the theoretical and empirical justification of such factors is lacking. Recently there are many studies paying attention to Social Network Analysis (SNA) as a method to analyze social relationships among people. SNA is a method to measure and visualize the linkage structure and status focusing on interaction among objects within communication group. CF analyzes the similarity among previous ratings or purchases of each customer, finds the relationships among the customers who have similarities, and then uses the relationships for recommendations. Thus CF can be modeled as a social network in which customers are nodes and purchase relationships between customers are links. Under the assumption that SNA could facilitate an exploration of the topological properties of the network structure that are implicit in transaction data for CF recommendations, we focus on density, clustering coefficient, and centralization which are ones of the most commonly used measures to capture topological properties of the social network structure. While network density, expressed as a proportion of the maximum possible number of links, captures the density of the whole network, the clustering coefficient captures the degree to which the overall network contains localized pockets of dense connectivity. Centralization reflects the extent to which connections are concentrated in a small number of nodes rather than distributed equally among all nodes. We explore how these SNA measures affect the performance of CF performance and how they interact to each other. Our experiments used sales transaction data from H department store, one of the well?known department stores in Korea. Total 396 data set were sampled to construct various types of social networks. The dependant variable measuring process consists of three steps; analysis of customer similarities, construction of a social network, and analysis of social network patterns. We used UCINET 6.0 for SNA. The experiments conducted the 3-way ANOVA which employs three SNA measures as dependant variables, and the recommendation accuracy measured by F1-measure as an independent variable. The experiments report that 1) each of three SNA measures affects the recommendation accuracy, 2) the density's effect to the performance overrides those of clustering coefficient and centralization (i.e., CF adoption is not a good decision if the density is low), and 3) however though the density is low, the performance of CF is comparatively good when the clustering coefficient is low. We expect that these experiment results help firms decide whether CF recommender system is adoptable for their business domain with certain transaction data characteristics.

An Automatic Mobile Cell Counting System for the Analysis of Biological Image (생물학적 영상 분석을 위한 자동 모바일 셀 계수 시스템)

  • Seo, Jaejoon;Chun, Junchul;Lee, Jin-Sung
    • Journal of Internet Computing and Services
    • /
    • v.16 no.1
    • /
    • pp.39-46
    • /
    • 2015
  • This paper presents an automatic method to detect and count the cells from microorganism images based on mobile environments. Cell counting is an important process in the field of biological and pathological image analysis. In the past, cell counting is done manually, which is known as tedious and time consuming process. Moreover, the manual cell counting can lead inconsistent and imprecise results. Therefore, it is necessary to make an automatic method to detect and count cells from biological images to obtain accurate and consistent results. The proposed multi-step cell counting method automatically segments the cells from the image of cultivated microorganism and labels the cells by utilizing topological analysis of the segmented cells. To improve the accuracy of the cell counting, we adopt watershed algorithm in separating agglomerated cells from each other and morphological operation in enhancing the individual cell object from the image. The system is developed by considering the availability in mobile environments. Therefore, the cell images can be obtained by a mobile phone and the processed statistical data of microorganism can be delivered by mobile devices in ubiquitous smart space. From the experiments, by comparing the results between manual and the proposed automatic cell counting we can prove the efficiency of the developed system.

An Approximate Shortest Path Re-Computation Method for Digital Road Map Databases in Mobile Computing Environments (모바일 컴퓨팅 환경에서의 디지털 로드맵 데이타베이스를 위한 근접 최단 경로 재계산 방법)

  • 김재훈;정성원;박성용
    • Journal of KIISE:Databases
    • /
    • v.30 no.3
    • /
    • pp.296-309
    • /
    • 2003
  • One of commercial applications of mobile computing is ATIS(Advanced Traveler Information Systems) in ITS(Intelligent Transport Systems). In ATIS, a primary mobile computing task is to compute the shortest path from the current location to the destination. In this paper, we have studied the shortest path re-computation problem that arises in the DRGS(Dynamic Route Guidance System) in ATIS where the cost of topological digital road map is frequently updated as traffic condition changes dynamically. Previously suggested methods either re-compute the shortest path from scratch or re-compute the shortest path just between the two end nodes of the edge where the cost change occurs. However, these methods we trivial in that they do not intelligently utilize the previously computed shortest path information. In this paper, we propose an efficient approximate shortest path re-computation method based on the dynamic window scheme. The proposed method re-computes an approximate shortest path very quickly by utilizing the previously computed shortest path information. We first show the theoretical analysis of our methods and then present an in-depth experimental performance analysis by implementing it on grid graphs as well as a real digital road map.

A Robust Object Detection and Tracking Method using RGB-D Model (RGB-D 모델을 이용한 강건한 객체 탐지 및 추적 방법)

  • Park, Seohee;Chun, Junchul
    • Journal of Internet Computing and Services
    • /
    • v.18 no.4
    • /
    • pp.61-67
    • /
    • 2017
  • Recently, CCTV has been combined with areas such as big data, artificial intelligence, and image analysis to detect various abnormal behaviors and to detect and analyze the overall situation of objects such as people. Image analysis research for this intelligent video surveillance function is progressing actively. However, CCTV images using 2D information generally have limitations such as object misrecognition due to lack of topological information. This problem can be solved by adding the depth information of the object created by using two cameras to the image. In this paper, we perform background modeling using Mixture of Gaussian technique and detect whether there are moving objects by segmenting the foreground from the modeled background. In order to perform the depth information-based segmentation using the RGB information-based segmentation results, stereo-based depth maps are generated using two cameras. Next, the RGB-based segmented region is set as a domain for extracting depth information, and depth-based segmentation is performed within the domain. In order to detect the center point of a robustly segmented object and to track the direction, the movement of the object is tracked by applying the CAMShift technique, which is the most basic object tracking method. From the experiments, we prove the efficiency of the proposed object detection and tracking method using the RGB-D model.

Utilization of Database in 3D Visualization of Remotely Sensed Data (원격탐사 영상의 3D 시각화와 데이터베이스의 활용)

  • Jung, Myung-Hee;Yun, Eui-Jung
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.3
    • /
    • pp.40-46
    • /
    • 2008
  • 3D visualization of geological environments using remotely sensed data and the various sources of data provides new methodology to interpret geological observation data and analyze geo-information in earth science applications. It enables to understand spatio-temporal relationships and causal processes in the three-dimension, which would be difficult to identify without 3D representation. To build more realistic geological environments, which are useful to recognize spatial characteristics and relationships of geological objects, 3D modeling, topological analysis, and database should be coupled and taken into consideration for an integrated configuration of the system. In this study, a method for 3D visualization, extraction of geological data, storage and data management using remotely sensed data is proposed with the goal of providing a methodology to utilize dynamic spatio-temporal modeling and simulation in the three-dimension for geoscience and earth science applications.

A Study on Feature-Based Multi-Resolution Modelling - Part II: System Implementation and Criteria for Level of Detail (특징형상기반 다중해상도 모델링에 관한 연구 - Part II: 시스템 구현 및 상세수준 판단기준)

  • Lee K.Y.;Lee S.H.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.10 no.6
    • /
    • pp.444-454
    • /
    • 2005
  • Recently, the requirements of multi-resolution models of a solid model, which represent an object at multiple levels of feature detail, are increasing for engineering tasks such as analysis, network-based collaborative design, and virtual prototyping and manufacturing. The research on this area has focused on several topics: topological frameworks for representing multi-resolution solid models, criteria for the level of detail (LOD), and generation of valid models after rearrangement of features. As a solution to the feature rearrangement problem, the new concept of the effective zone of a feature is introduced in the former part of the paper. In this paper, we propose a feature-based non-manifold modeling system to provide multi-resolution models of a feature-based solid or non-manifold model on the basis of the effective feature zones. To facilitate the implementation, we introduce the class of the multi-resolution feature whose attributes contain all necessary information to build a multi-resolution solid model and extract LOD models from it. In addition, two methods are introduced to accelerate the extraction of LOD models from the multi-resolution modeling database: the one is using an NMT model, known as a merged set, to represent multi-resolution models, and the other is storing differences between adjacent LOD models to accelerate the transition to the other LOD. We also suggest the volume of the feature, regardless of feature type, as a criterion for the LOD. This criterion can be used in a wide range of applications, since there is no distinction between additive and subtractive features unlike the previous method.

A Watermarking Algorithm of 3D Mesh Model Using Spherical Parameterization (구면 파라미터기법을 이용한 3차원 메쉬 모델의 워더마킹 알고리즘)

  • Cui, Ji-Zhe;Kim, Jong-Weon;Choi, Jong-Uk
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.18 no.1
    • /
    • pp.149-159
    • /
    • 2008
  • In this paper, we propose a blind watermarking algorithm of 3d mesh model using spherical parameterization. Spherical parameterization is a useful method which is applicable to 3D data processing. Especially, orthogonal coordinate can not analyse the feature of the vertex coordination of the 3D mesh model, but this is possible to analyse and process. In this paper, the centroid center of the 3D model was set to the origin of the spherical coordinate, the orthogonal coordinate system was transformed to the spherical coordinate system, and then the spherical parameterization was applied. The watermark was embedded via addition/modification of the vertex after the feature analysis of the geometrical information and topological information. This algorithm is robust against to the typical geometrical attacks such as translation, scaling and rotation. It is also robust to the mesh reordering, file format change, mesh simplification, and smoothing. In this case, the this algorithm can extract the watermark information about $90{\sim}98%$ from the attacked model. This means it can be applicable to the game, virtual reality and rapid prototyping fields.

3D GIS Network Modeling of Indoor Building Space Using CAD Plans (CAD 도면을 이용한 건축물 내부 공간의 3차원 GIS 네트워크 모델링)

  • Kang Jung A;Yom Jee-Hong;Lee Dong-Cheon
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.23 no.4
    • /
    • pp.375-384
    • /
    • 2005
  • Three dimensional urban models are being increasingly applied for various purposes such as city planning, telecommunication cell planning, traffic analysis, environmental monitoring and disaster management. In recent years, technologies from CAD and GIS are being merged to find optimal solutions in three dimensional modeling of urban buildings. These solutions include modeling of the interior building space as well as its exterior shape visualization. Research and development effort in this area has been performed by scientists and engineers from Computer Graphics, CAD and GIS. Computer Graphics and CAD focussed on precise and efficient visualization, where as GIS emphasized on topology and spatial analysis. Complementary research effort is required for an effective model to serve both visualization and spatial analysis purposes. This study presents an efficient way of using the CAD plans included in the building register documents to reconstruct the internal space of buildings. Topological information was built in the geospatial database and merged with the geometric information of CAD plans. as well as other attributal data from the building register. The GIS network modeling method introduced in this study is expected to enable an effective 3 dimensional spatial analysis of building interior which is developing with increasing complexity and size.

Anatomical Brain Connectivity Map of Korean Children (한국 아동 집단의 구조 뇌연결지도)

  • Um, Min-Hee;Park, Bum-Hee;Park, Hae-Jeong
    • Investigative Magnetic Resonance Imaging
    • /
    • v.15 no.2
    • /
    • pp.110-122
    • /
    • 2011
  • Purpose : The purpose of this study is to establish the method generating human brain anatomical connectivity from Korean children and evaluating the network topological properties using small-world network analysis. Materials and Methods : Using diffusion tensor images (DTI) and parcellation maps of structural MRIs acquired from twelve healthy Korean children, we generated a brain structural connectivity matrix for individual. We applied one sample t-test to the connectivity maps to derive a representative anatomical connectivity for the group. By spatially normalizing the white matter bundles of participants into a template standard space, we obtained the anatomical brain network model. Network properties including clustering coefficient, characteristic path length, and global/local efficiency were also calculated. Results : We found that the structural connectivity of Korean children group preserves the small-world properties. The anatomical connectivity map obtained in this study showed that children group had higher intra-hemispheric connectivity than inter-hemispheric connectivity. We also observed that the neural connectivity of the group is high between brain stem and motorsensory areas. Conclusion : We suggested a method to examine the anatomical brain network of Korean children group. The proposed method can be used to evaluate the efficiency of anatomical brain networks in people with disease.