• Title/Summary/Keyword: 시공간 연산

Search Result 84, Processing Time 0.022 seconds

Algorithm for Topological Relationship On an Indeterminate Spatiotemporal Object (불확실한 시공간 객체에 관한 위상 관계 알고리즘)

  • Ji, Jeong-Hui;Kim, Dae-Jung;Ryu, Keun-Ho
    • The KIPS Transactions:PartD
    • /
    • v.10D no.6
    • /
    • pp.873-884
    • /
    • 2003
  • So far, significant achievements have been studied on the development of models for spatial and spatiotemporal objects with indeterminate boundaries which are found in many applications for geographic analysis and image understanding. Therefore, in this paper we propose the spatiotemporal data model which is applicable for spatial and spatiotemporal objects with uncertainty. Based on this model, we defined topological relationships among the indeterminate spatiotemporal objects and designed the algorithm for the operations. For compatibility with existing spatial models, the proposed model has been designed by extending the spatiotemporal object model which is based on the open GIS specification. We defined indeterminate spatial objects, such as the objects whose position and the shape change discretely over time, and the objects whose shape changes continuously as well as the position. We defined topological relationships among these objects using the extended 9-IM. The proposed model can be efficiently applied to the management systems of natural resource data, westher information, geographic information. and so on.

Design and Implementation of a Data Management System for Mobile Spatio-Temporal Query (모바일 시공간 질의을 위한 데이타 관리 시스템의 설계 및 구현)

  • Lee, Ki-Young;Lim, Myung-Jae;Kim, Joung-Joon;Kim, Kyu-Ho;Kim, Jeong-Lae
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.1
    • /
    • pp.109-113
    • /
    • 2011
  • Recently, according to the development of ubiquitous computing, the u-GIS which not only used in u-Transport, u-Care, u-Fun, u-Green, u-Business, u-Government, and u-City but also used to provides various spatial information such as the location of user is being the core technology of the ubiquitous computing environment. In this paper, we implemented an mobile spatio-temporal Query Processing Systems for handling the Spatio-Temporal Data in mobile equipment.The mobile spatio-temporal Query Processing Systems provides the spatio-temporal data type and the spatio-temporal operator that is expanded by the spatial data type and the spatial operator from OepenGIS "Simple Feature Specification for SQL". It supports arithmetic coding compression techniques that is considered with a spatio-temporal data specific character. It also provides the function of data cashing for improving the importation and exportation of the spatio-temporal data between a embedded spatio-temporal DBMS and u-GIS server.

An Efficient Spatiotemporal Index Unifying Temporal and Spatial Dimensions (시간과 공간의 단일화를 통한 효율적 시공간 색인)

  • Sin, Ye-Ho;Kim, Dong-Ho;Ryu, Geun-Ho
    • Journal of KIISE:Software and Applications
    • /
    • v.26 no.9
    • /
    • pp.1039-1051
    • /
    • 1999
  • 시공간 데이타베이스는 현실세계의 객체에 대하여 효율적인 공간 관리와 이력 관리를 지원한다. 이러한 시공간 데이타베이스는 시간차원과 공간차원이라는 이질적 데이타 공간을 관리하여야 하는 대단히 복잡한 시스템이다. 따라서 데이타에 대한 효율적 접근 방법에 대한 연구가 필수적이며, 이는 효율적 색인 기법의 개발을 통하여 이룰 수 있다. 그러나 시공간 데이타에 대한 접근방법 연구는 거의 이루어지지 않고 있으며 극소수의 사례들마저도 공간 객체의 이력 개념을 지원하는 것이 아니라 멀티미디어 객체의 상대적 시간만을 지원하고 있다. 따라서 이 논문에서는 공간 데이타의 이력을 표현하는 시공간 데이타에 대하여 효율적으로 색인하기 위한 방안으로서 시간과 공간을 단일화된 색인 영역으로 통합하는 단일화된 시공간 색인 모델을 제시하고, 이를 기존의 R-트리를 기반으로 확장한 색인을 설계 및 구현하였으며, 아울러 다양한 유형의 시공간 연산에 대한 색인의 성능을 평가하였다.Abstract Spatiotemporal databases are able to support an efficient spatial management as well as historical management for an object in the real world. It is very complex to manage these two dimensions why there exists on difference of inborn property of temporal and spatial dimensions. Therefore an efficient access method should be studied, and it can be done by means of development of efficient indexing technology.However, there is a few related work in the research of access methods of spatiotemporal data. Also the previous works do not support the concept of history for spatial object, and only support the relative time among multimedia objects. Therefore, in this paper, we propose a unified Spatiotemporal index model as an efficient index for Spatiotemporal data. And we not only design Spatiotemporal index that has been extended to historical management facility on the basis of conventional R-tree, but also implement it. Finally we have evaluated performance of index for the various kinds of Spatiotemporal operations.

Representation and History Management of Spatio-Temporal Objects using a Gothic GIS Tool (고딕 GIS 도구를 이용한 시공간 객체의 표현과 이력관리)

  • Paik, Ju-Yeon;Lee, Seong-Jong;Ryu, Keun-Ho
    • Journal of KIISE:Databases
    • /
    • v.27 no.1
    • /
    • pp.101-112
    • /
    • 2000
  • In Geographic Information System, spatial object can be changed in the attribute information, spatial location and the topological relation between them with the change of time. However traditional GIS deletes the old value of aspatial information and replaces them with new value. Therefore. it is difficult to manage thc history of changed spatial object and can not support the spatio-temporal queries including temporal queries. In this paper, we propose a spatio-temporal objected model to solve this problem. We implement the proposed model with spatio-temporal class using Gothic GIS tool. The historical information of an object is stored into the object itself for the effective history management. And, in order to provide the queries for the history of an object and spatio-temporal relationship, we add temporal operators, spatio-temporal operators, and spatio-temporal query operations into Gothic, and improve the facility of the Gothic.

  • PDF

Spatiotemporal Moving Pattern Discovery using Location Generalization of Moving Objects (이동객체 위치 일반화를 이용한 시공간 이동 패턴 탐사)

  • Lee, Jun-Wook;Nam, Kwang-Woo
    • The KIPS Transactions:PartD
    • /
    • v.10D no.7
    • /
    • pp.1103-1114
    • /
    • 2003
  • Currently, one of the most critical issues in developing the service support system for various spatio-temporal applications is the discoverying of meaningful knowledge from the large volume of moving object data. This sort of knowledge refers to the spatiotemporal moving pattern. To discovery such knowledge, various relationships between moving objects such as temporal, spatial and spatiotemporal topological relationships needs to be considered in knowledge discovery. In this paper, we proposed an efficient method, MPMine, for discoverying spatiotemporal moving patterns. The method not only has considered both temporal constraint and spatial constrain but also performs the spatial generalization using a spatial topological operation, contain(). Different from the previous temporal pattern methods, the proposed method is able to save the search space by using the location summarization and generalization of the moving object data. Therefore, Efficient discoverying of the useful moving patterns is possible.

Design and Implementation of Spatiotemporal Operators for History Management System of Cadastre and Cadastral Map (토지대장/지적도 이력관리 시스템을 위한 시공간 연산자의 설계 및 구현)

  • Kim, Sung-Ryoung;Kim, Sang-Ho;Lee, Hwa-Jong;Ryu, Keun-Ho
    • Journal of Korea Spatial Information System Society
    • /
    • v.2 no.2 s.4
    • /
    • pp.127-142
    • /
    • 2000
  • GIS Tools is able to not only store the integrated information between attribute data and spatial data, but also analyze them. Most of GIS Tools support current information of land. However, lawsuit of right of possession as well as statistic of past data for land policy may need historical information. Therefore, in the paper, we designed the spatiotemporal operators what can handle the historical information. and implemented them. The spatiotemporal operators are used in the history management system of Cadastre and Cadastral map based on GIS. The historical information is generated in spatial operation of spatiotemporal operators and then the implemented operators provide a function to store the historical information, and handle them.

  • PDF

Adaptive Hierarchical Hexagon Search Using Spatio-temporal Motion Activity (시공간 움직임 활동도를 이용한 적응형 계층 육각 탐색)

  • Kwak, No-Yoon
    • Journal of Digital Contents Society
    • /
    • v.8 no.4
    • /
    • pp.441-449
    • /
    • 2007
  • In video coding, motion estimation is a process to estimate the pixel of the current frame from the reference frame, which affects directly the predictive quality and the encoding time. This paper is related to AHHS(Adaptive Hierarchical Hexagon Search) using spatio-temporal motion activity for fast motion estimation. The proposed method defines the spatio-temporal motion activity of the current macroblock using the motion vectors of its spatio-temporally adjacent macroblocks, and then conventional AHS(Adaptive Hexagon Search) is performed if the spatio-temporal motion activity is lower, otherwise, hierarchical hexagon search is performed on a multi-layered hierarchical space constructed by multiple sub-images with low frequency in wavelet transform. In the paper, based on computer simulation results for multiple video sequences with different motion characteristics, the performance of the proposed method was analysed and assessed in terms of the predictive quality and the computational time. Experimental results indicate that the proposed method is both suitable for (quasi-) stationary and large motion searches. The proposed method could keep the merit of the adaptive hexagon search capable of fast estimating motion vectors and also adaptively reduce the local minima occurred in the video sequences with higher spatio-temporal motion activity.

  • PDF

Range Query Processing of Distributed Moving Object Databases using Scheduling Technique (스케쥴링 기법을 이용한 분산 이동 객체 데이타베이스의 범위 질의 처리)

  • Jeon, Se-Gil;Hwang, Jae-Il;Nah, Youn-Mook
    • Journal of Korea Spatial Information System Society
    • /
    • v.6 no.2 s.12
    • /
    • pp.51-62
    • /
    • 2004
  • Recently, the location-based service for moving customers is becoming one of the most important service in mobile communication area. For moving object applications, there are lots of update operations and such update loads are concentrated on some particular area unevenly. The primary processing of LBS application is spatio-temporal range queries. To improve the throughput of spatio-temporal range queries, the time of disk I/O in query processing should be reduced. In this paper, we adopt non-uniform two-level grid index structures of GALIS architecture,which are designed to minimize update operations. We propose query scheduling technique using spatial relationship and time relationship and a combined spatio-temporal query processing method using time zone concepts to improve the throughput of query processing. Some experimental results are shown for range queries with different query range to show the performance tradeoffs of the proposed methods.

  • PDF

An Efficient Range Query Processing of Distributed Moving Object (분산 이동 객체 데이터베이스의 효율적인 범위 질의 처리)

  • Jeon, Se-Gil;Woo, Chan-Il
    • Journal of the Institute of Electronics Engineers of Korea TE
    • /
    • v.42 no.1
    • /
    • pp.35-40
    • /
    • 2005
  • Recently, the location based service for moving customers is becoming one of the most important service in mobile communication area and for moving object applications, there are lots of update operations and such update loads are concentrated on some particular area unevenly. The primary processing of LBS application is spatio-temporal range queries and to improve the throughput of spatio-temporal range queries, the time of disk I/O in query processing should be reduced. In this paper, we adopt non-uniform two-level grid index structure, which are designed to minimize update operations. We propose query scheduling technique using spatial relationship and time relationship and a combined spatio-temporal query processing method using time zone concepts to improve the throughput of query processing. Some experimental results are shown for range queries with different query range to show the performance tradeoffs of the proposed methods.

A Data Model for Past and Future Location Process of Moving Objects (이동 객체의 과거 및 미래 위치 연산을 위한 데이터 모델)

  • Jang, Seung-Youn;Ahn, Yoon-Ae;Ryu, Keun-Ho
    • The KIPS Transactions:PartD
    • /
    • v.10D no.1
    • /
    • pp.45-56
    • /
    • 2003
  • In the wireless environment, according to the development of technology, which is able to obtain location information of spatiotemporal moving object, the various application systems are developed such as vehicle tracking system, forest fire management system and digital battle field system. These application systems need the data model, which is able to represent and process the continuous change of moving object. However, if moving objects are expressed by a relational model, there is a problem which is not able to store all location information that changed per every time. Also, existing data models of moving object have a week point, which constrain the query time to the time that is managed in the database such as past or current and near future. Therefore, in this paper, we propose a data model, which is able to not only express the continuous movement of moving point and moving region but also process the operation at all query time by using shape-change process and location determination functions for past and future. In addition, we apply the proposed model to forest fire management system and evaluate the validity through the implementation result.