• Title/Summary/Keyword: mapping database

Search Result 375, Processing Time 0.032 seconds

A real-time QRS complex detection algorithm using topological mapping in ECG signals (심전도 신호의 위상학적 팹핑을 이용한 실시간 QRS 검출 알고리즘)

  • 이정환;정기삼;이병채;이명호
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.5
    • /
    • pp.48-58
    • /
    • 1998
  • In this paper, we proposed a new algorithm using characteristics of th ereconstructed phase trajectory by topological mapping developed for a real-tiem detection of the QRS complexes of ECG signals. Using fill-factor algorithm and mutual information algorithm which are in genral used to find out the chaotic characteristics of sampled signals, we inferred the proper mapping parameter, time delay, in ECG signals and investigated QRS detection rates with varying time delay in QRS complex detection. And we compared experimental time dealy with the theoretical one. As a result, it shows that the experimental time dealy which is proper in topological mapping from ECG signals is 20ms and theoretical time delays of fill-factor algorithm and mutual information algorithm are 20.+-.0.76ms and 28.+-.3.51ms, respectively. From these results, we could easily infer that the fill-factor algorithm in topological mapping from one-dimensional sampled ECG signals to two-dimensional vectors, is a useful algorithm for the detemination of the proper ECG signals to two-dimensional vectors, is a useful algorithm for the detemination of the proper time delay. Also with the proposed algorithm which is very simple and robust to low-frequency noise as like baseline wandering, we could detect QRS complex in real-time by simplifying preprocessing stages. For the evaluation, we implemented the proposed algorithm in C-language and applied the MIT/BIH arrhythmia database of 48 patients. The proposed algorithm provides a good performance, a 99.58% detection rate.

  • PDF

Geomorphological Mapping for Construction GIS Database of Geomorphic Elements (GIS Database 구축을 위한 지형 요소의 지도화)

  • 이민부;김남신;한균형
    • Journal of the Korean Geographical Society
    • /
    • v.36 no.2
    • /
    • pp.81-92
    • /
    • 2001
  • 본 연구의 목적은 지형요소의 GIS Database 구축을 위한 전산화된 지형분류도 제작방안을 제시하는 것이다. 지형요소 전산화는 지형요소의 분류, 지형요소의 코드화, 범례화, 심볼의 제작, 마지막으로 지도화의 과정을 통하여 완성된다. 지형분류는 지형요소의 공간적 분포와 형태, 지형형성과 발달에 영향을 미치는 자연환경체계와 지형형성기구의 역할을 고려하며, 동적인 지형형성과정과 이 과정을 통해 물질관계를 파악할 수 있도록 하였다. 지형분류도는 1: 25,000 축적에 표현 가능한 지형요소를 나타낼 수 있도록 고려하였다. 지형요소들의 지도화 되었을 때는 시.공간적인 관계를 통해 지형환경체계가 인식되도록 하였다. 지형요소들은 GIS에서 Layer단위로 입력되어야 하기 때문에 Data Feature의 성격을 점.선.면으로 분류하여 지형요소의 형상을 범례로 만들었다. 지형요소 범례는 지형의 형태, 물질 그리고 성인을 고려하여 지형요소를 상징화할 수 있도록 설계하였다.

  • PDF

DESIGN AND IMPLEMENTATION OF MULTIMEDIA MATADATA MANAGEMENT SYSTEM FOR HETEROGENOUS SOURCES

  • Park, Seong-Kyu;Lee, Yang-Koo;Chai, Duck-Jin;Kim, Hi-Seok;Ryu, Keun-Ho
    • Proceedings of the KSRS Conference
    • /
    • 2008.10a
    • /
    • pp.398-401
    • /
    • 2008
  • With the advance of internet and computer processing technique, users can easily access and use the multimedia contents involving the various pictures, videos and audios information. And users request more convenient and accurate multimedia services. In these environments, it is difficulties to integrate and manage metadata standards because there are various standards in multimedia applications according to types of services and data formats individually. In this paper, we design and implement the multimedia metadata management system for integrating from heterogeneous sources. In our system, we managed heterogeneous metadata by integrating to unified schema using mapping table. Through proposed system, users can search multimedia data easily without considering variety of application services.

  • PDF

Designing Components for mapping from XML DTD to ORDB Schema (XML DTD의 객체-관계형 데이터베이스 스키마로의 변환을 위한 Component 설계)

  • 이정수;주경수
    • Journal of Information Technology Applications and Management
    • /
    • v.9 no.1
    • /
    • pp.71-84
    • /
    • 2002
  • As the application area of XML extends to the database from simple contents, the technology for the storage and management of XML also grows with the XML. One of the main issues is how to efficiently manage the XML by using the previous DBMS. Many studies have been performed for the efficient management based on the XML application and database interface. However, the XML data is based on the object and has the hierarchical structure. Accorkingly, a modeling plan needs to store the XML data on the variety type of database. In this paper, for easier connection between XML application and database system, we have designed components for the transformation from XML DTD to ORDB schema. The method of the design for the transformation from XML DTD to ORDB schema is chosen the method of CBD.

  • PDF

Change Detection of Buildings Using High Resolution Remotely Sensed Data

  • Zeng, Yu;Zhang, Jixian;Wang, Guangliang
    • Proceedings of the KSRS Conference
    • /
    • 2002.10a
    • /
    • pp.530-535
    • /
    • 2002
  • An approach for quickly updating GIS building data using high resolution remotely sensed data is proposed in this paper. High resolution remotely sensed data could be aerial photographs, satellite images and airborne laser scanning data. Data from different types of sensors are integrated in building extraction. Based on the extracted buildings and the outdated GIS database, the change-detection-template can be automatically created. Then, GIS building data can be fast updated by semiautomatically processing the change-detection-temp late. It is demonstrated that this approach is quick, effective and applicable.

  • PDF

DETECTING LANDSLIDE LOCATION USING KOMSAT 1AND IT'S USING LANDSLIDE-SUSCEPTIBILITY MAPPING

  • Lee, Sa-Ro;Lee, Moung-Jin
    • Proceedings of the KSRS Conference
    • /
    • v.2
    • /
    • pp.840-843
    • /
    • 2006
  • The aim of this study was to detect landslide using satellite image and apply the landslide to probabilistic landslide-susceptibility mapping at Gangneung area, Korea using a Geographic Information System (GIS). Landslide locations were identified by change detection technique of KOMSAT-1 (Korea Multipurpose Satellite) EOC (Electro Optical Camera) images and checked in field. For landslide-susceptibility mapping, maps of the topography, geology, soil, forest, lineaments, and land cover were constructed from the spatial data sets. Then, the sixteen factors that influence landslide occurrence were extracted from the database. Using the factors and detected landslide, the relationships were calculated using frequency ratio, one of the probabilistic model. Then, landslide-susceptibility map was drawn using the frequency ration and finally, the map was verified by comparing with existing landslide locations. As the verification result, the prediction accuracy showed 86.76%. The landslide-susceptibility map can be used to reduce hazards associated with landslides and to land cover planning.

  • PDF

The Conversion Scheme of GML Document into Spatial Database using the Directed Schema Graph Mapping Rules (방향성 스키마 그래프 매핑 규칙을 이용한 GML 문서의 공간 데이터베이스 변환 기법)

  • Chung, Warn-Ill;Park, Soon-Young;Bae, Hae-Young
    • Journal of Korea Spatial Information System Society
    • /
    • v.7 no.1 s.13
    • /
    • pp.39-52
    • /
    • 2005
  • GML (Geography Markup Language) has become the widely adopted standard for transport and storage of geographic information. So, various researches such as modeling, storage, query, and etc have been studied to provide the interoperability of geographic information in web environments. Especially, there are increased needs to store semi-structured data such as GML documents efficiently. Therefore, in this paper, we design and implement a GML repository to store GML documents on the basis of GML schema using spatial database system. GML Schema is converted into directed GML schema graph and the schema mapping technique from directed schema graph to spatial schema is presented. Also, we define the conversion rules on spatial schema to preserve the constraints of GML schema. GML repository using spatial database system is useful to provide the interoperability of geographic information and to store and manage enormous GML documents.

  • PDF

2D-MELPP: A two dimensional matrix exponential based extension of locality preserving projections for dimensional reduction

  • Xiong, Zixun;Wan, Minghua;Xue, Rui;Yang, Guowei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.9
    • /
    • pp.2991-3007
    • /
    • 2022
  • Two dimensional locality preserving projections (2D-LPP) is an improved algorithm of 2D image to solve the small sample size (SSS) problems which locality preserving projections (LPP) meets. It's able to find the low dimension manifold mapping that not only preserves local information but also detects manifold embedded in original data spaces. However, 2D-LPP is simple and elegant. So, inspired by the comparison experiments between two dimensional linear discriminant analysis (2D-LDA) and linear discriminant analysis (LDA) which indicated that matrix based methods don't always perform better even when training samples are limited, we surmise 2D-LPP may meet the same limitation as 2D-LDA and propose a novel matrix exponential method to enhance the performance of 2D-LPP. 2D-MELPP is equivalent to employing distance diffusion mapping to transform original images into a new space, and margins between labels are broadened, which is beneficial for solving classification problems. Nonetheless, the computational time complexity of 2D-MELPP is extremely high. In this paper, we replace some of matrix multiplications with multiple multiplications to save the memory cost and provide an efficient way for solving 2D-MELPP. We test it on public databases: random 3D data set, ORL, AR face database and Polyu Palmprint database and compare it with other 2D methods like 2D-LDA, 2D-LPP and 1D methods like LPP and exponential locality preserving projections (ELPP), finding it outperforms than others in recognition accuracy. We also compare different dimensions of projection vector and record the cost time on the ORL, AR face database and Polyu Palmprint database. The experiment results above proves that our advanced algorithm has a better performance on 3 independent public databases.

Modeling Components for mapping from XML DTD to RDB schema (XML DTD의 관계형 데이터베이스 스키마로의 자동변환을 위한 컴포넌트 모델링)

  • 이정수;방승윤;주경수
    • Journal of Internet Computing and Services
    • /
    • v.2 no.5
    • /
    • pp.81-91
    • /
    • 2001
  • XML is a standard markup language for exchange and storage of formed or well-formed information in World Wide Web, Because the source data of XML message for exchange of information in World Woo Web Is stored in legacy database systems. it is necessary the easier connection between XML application and database systems, In Oracle8i. 9i. informix and SQL2000. DBMS vendors extend their DBMSs for XML. This approach for the connection between XML application and database system is Platform-dependent and DBMS-dependent. Therefore it is necessary the platform- and DBMS-independent approach for the connection between XML application and database system, In this paper. we modeled a set of middleware components for relational database design based on XML DTD is modeled, Those components are modeled on object-based algorithm for connection between XML application and database system.

  • PDF

PDM/ODB: Mapping XML to ODMG-Compliant Object-Oriented Database (PDM/ODB: XML 데이타의 ODMG 표준 객체지향 데이타베이스로의 사상)

  • Ko, Bong-Su;Park, Sang-Won;Min, Kyung-Sub;Kim, Hyoung-Joo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.7 no.5
    • /
    • pp.383-391
    • /
    • 2001
  • The value of XML as electronic documents is increasing nowadays. The XML document has properties of semistructured data. It can be modeled as object-oriented model which can be easily adapted by object-oriented database. For storing XML documents to conventional database system, extracting schema information from the DTD of a XML document has been studied for several years. In this paper we store XML documents into object-oriented database, which preserve the semantics of the documents. We can store and query by OQL and make applications by C++ and make applications by C++ binding which is the access method of object-oriented database. Therefore, existing database applications can be used without modification.

  • PDF