• Title/Summary/Keyword: 시공간 이동 패턴

Search Result 57, Processing Time 0.025 seconds

Spatiotemporal Data Visualization using Gravity Model (중력 모델을 이용한 시공간 데이터의 시각화)

  • Kim, Seokyeon;Yeon, Hanbyul;Jang, Yun
    • Journal of KIISE
    • /
    • v.43 no.2
    • /
    • pp.135-142
    • /
    • 2016
  • Visual analysis of spatiotemporal data has focused on a variety of techniques for analyzing and exploring the data. The goal of these techniques is to explore the spatiotemporal data using time information, discover patterns in the data, and analyze spatiotemporal data. The overall trend flow patterns help users analyze geo-referenced temporal events. However, it is difficult to extract and visualize overall trend flow patterns using data that has no trajectory information for movements. In order to visualize overall trend flow patterns, in this paper, we estimate continuous distributions of discrete events over time using KDE, and we extract vector fields from the continuous distributions using the gravity model. We then apply our technique on twitter data to validate techniques.

A GIS-based Analysis of Spatial Patterns of Individual Accessibility: A Critical Examination of Spatial Accessibility Measures (GIS를 이용한 접근성의 공간적 패턴 분석: 공간적 접근성 측정방법에 대한 비판적 검토)

  • Kim Hyun-Mi
    • Journal of the Korean Geographical Society
    • /
    • v.40 no.5 s.110
    • /
    • pp.514-532
    • /
    • 2005
  • The purpose of this study is to critically examine conventional spatial measures of individual accessibility, which are based on the notion of spatial proximity, the single reference location, and the unlinked travel model. Using space-time accessibility measures with the travel-activity diary data set of Portland Metro, US, three expectations from spatial measures on spatial patterns of individual accessibility were empirically examined: (1) does individual accessibility decrease with an increase of distance from the CBD?; (2) does the spatial pattern of accessibility resemble that of urban opportunity density pattern?; and (3) are spatial patterns of individual accessibility of different socio- demographic population groups basically similar as people in the same area share the same geographic characteristics regardless of gender, race, age, and so on? First of all, the results showed that spatial variations in individual accessibility were not directly determined by spatial proximity and opportunity density as suggested by previous accessibility measures. The spatial pattern of individual accessibility was dramatically different from that of urban opportunity density High peaks of accessibility level were found far away from the CBD and regional centers. This finding might be associated with the importance of multi-reference locations and linked travels in shaping accessibility in reality. Furthermore, this study found that spatial patterns of accessibility clearly differ between men and women. These findings suggest that access requires more than proximity, and that the interaction between person-specific space-time constraints and the consequential availability of urban opportunities in space-time renders different accessibility experiences to people even in the same region, which would be one of the key ingredients missing from conventional spatial measures of accessibility.

A 3-Layered Framework for Spatiotemporal Knowledge Discovery (시공간 지식탐사를 위한 3계층 프레임워크)

  • 이준욱;남광우;류근호
    • Journal of KIISE:Databases
    • /
    • v.31 no.3
    • /
    • pp.205-218
    • /
    • 2004
  • As the development of database technology for managing spatiotemporal data, new types of spatiotemporal application services that need the spatiotemporal knowledge discovery from the large volume of spatiotemporal data are emerging. In this paper, a new 3-layered discovery framework for the development of spatiotemporal knowledge discovery techniques is proposed. The framework supports the foundation model in order not only to define spatiotemporal knowledge discovery problem but also to represent the definition of spatiotemporal knowledge and their relationships. Also the components of spatiotemporal knowledge discovery system and its implementation model are proposed. The discovery framework proposed in this paper satisfies the requirement of the development of new types of spatiotemporal knowledge discovery techniques. The proposed framework can support the representation model of each element and relationships between objects of the spatiotemporal data set, information and knowledge. Hence in designing of the new types of knowledge discovery such as spatiotemporal moving pattern, the proposed framework can not only formalize but also simplify the discovery problems.

A Method for Optimal Moving Pattern Mining using Frequency of Moving Sequence (이동 시퀀스의 빈발도를 이용한 최적 이동 패턴 탐사 기법)

  • Lee, Yon-Sik;Ko, Hyun
    • The KIPS Transactions:PartD
    • /
    • v.16D no.1
    • /
    • pp.113-122
    • /
    • 2009
  • Since the traditional pattern mining methods only probe unspecified moving patterns that seem to satisfy users' requests among diverse patterns within the limited scopes of time and space, they are not applicable to problems involving the mining of optimal moving patterns, which contain complex time and space constraints, such as 1) searching the optimal path between two specific points, and 2) scheduling a path within the specified time. Therefore, in this paper, we illustrate some problems on mining the optimal moving patterns with complex time and space constraints from a vast set of historical data of numerous moving objects, and suggest a new moving pattern mining method that can be used to search patterns of an optimal moving path as a location-based service. The proposed method, which determines the optimal path(most frequently used path) using pattern frequency retrieved from historical data of moving objects between two specific points, can efficiently carry out pattern mining tasks using by space generalization at the minimum level on the moving object's location attribute in consideration of topological relationship between the object's location and spatial scope. Testing the efficiency of this algorithm was done by comparing the operation processing time with Dijkstra algorithm and $A^*$ algorithm which are generally used for searching the optimal path. As a result, although there were some differences according to heuristic weight on $A^*$ algorithm, it showed that the proposed method is more efficient than the other methods mentioned.

Similar Trajectory Store Scheme for Efficient Store of Vehicle Historical Data (효율적인 차량 이력 데이터 저장을 위한 유사 궤적 저장 기법)

  • Kwak Ho-Young;Han Kyoung-Bok
    • The Journal of the Korea Contents Association
    • /
    • v.6 no.1
    • /
    • pp.114-125
    • /
    • 2006
  • Since wireless Internet services and small mobile communication devices come into wide use as well as the use of GPS is rapidly growing, researches on moving object, whose location information shifts sequently in accordance with time interval, are being carried out actively. Especially, the researches on vehicle moving object are applied to Advanced traveler information system, vehicle tracking system, and distribution transport system. These systems are very useful in searching previous positions, predicted future positions, the optimum course, and the shortest course of a vehicle by managing historical data of the vehicle movement. In addition, vehicle historical data are used for distribution transport plan and vehicle allocation. Vehicle historical data are stored at regular intervals, which can have a pattern. For example, a vehicle going repeatedly around a specific section follows a route very similar to another. If historical data of the vehicle with a repeated route course are stored at regular intervals, many redundant data occur, which result in much waste of storage. Therefore this thesis suggest a vehicle historical data store scheme for vehicles with a repeated route course using similar trajectory which efficiently store vehicle historical data.

  • PDF

The Specific Character of Spatial Distribution of Red Tide and Sea Surface Temperature (적조의 공간적 분포 특성과 해수온 변화)

  • Jeong, J.C.;Yoon, H.J.;Suh, Y.S.
    • 한국공간정보시스템학회:학술대회논문집
    • /
    • 2005.05a
    • /
    • pp.237-241
    • /
    • 2005
  • 본 연구에서는 한국 남해해역의 해양환경 중 해수표면온도의 변화와 Cochlodinium polykrikoides 적조의 시공간 분포가 밀접한 관련성을 가지고 있음을 파악하였다. GIS와 원격탐사기술은 한국 중남부해역에 적용되었고, 이 지역은 매년 하계에 적조가 최초로 발생하는 지역이다. 해수표면온도를 포함한 적조의 이동 경향을 비교하기 위해 현장조사에 의한 적조 분포가 조사선에 의해 수집되어졌다. 또한, 적조의 위성영상과 해수표면수온 분포를 Landsat 위성자료를 통해 획득하였다. 위성자료에 의해 추정된 적조의 분포와 해수표면온도분포는 유사한 패턴을 나타내고 있음을 알 수 있었다. 여름철에 한반도 남동부 연안해역에서 나타나는 적조의 분포와 이동경향은 이 지역의 해수온도 분포의 시공간적인 분포에 밀접한 관계가 있다.

  • PDF

Geovisualization Environment for Spatio-temporal Trajectory of Personal Activity (시공간 개인통행자료의 지리적 시각화)

  • Ahn Jae-Seong;Lee Yang-Won;Park Key-Ho
    • Journal of the Korean Geographical Society
    • /
    • v.40 no.3 s.108
    • /
    • pp.310-320
    • /
    • 2005
  • This study attempts at prototyping and evaluating a geovisualization tool that summarizes and explores human activity patterns using spatio-temporal trajectory data collected from GPS receiver. A set of core conceptualization developed in 'time geography' is successfully represented by our prototype based on the notion of 'space-time cube.' The notions of 'temporal dispersion cylinder' and 'parallel plane plot' are also implemented to allow funker analyses of human activity pattern on the space-time trajectory. The capabilities of the geovisualization environment we proposed include the interactive and dynamic functions that support a variety of explorations on the three components of spatio-temporal data : space(where), time(when), and object(what).

Extracting optimal moving patterns of edge devices for efficient resource placement in an FEC environment (FEC 환경에서 효율적 자원 배치를 위한 엣지 디바이스의 최적 이동패턴 추출)

  • Lee, YonSik;Nam, KwangWoo;Jang, MinSeok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.1
    • /
    • pp.162-169
    • /
    • 2022
  • In a dynamically changing time-varying network environment, the optimal moving pattern of edge devices can be applied to distributing computing resources to edge cloud servers or deploying new edge servers in the FEC(Fog/Edge Computing) environment. In addition, this can be used to build an environment capable of efficient computation offloading to alleviate latency problems, which are disadvantages of cloud computing. This paper proposes an algorithm to extract the optimal moving pattern by analyzing the moving path of multiple edge devices requiring application services in an arbitrary spatio-temporal environment based on frequency. A comparative experiment with A* and Dijkstra algorithms shows that the proposed algorithm uses a relatively fast execution time and less memory, and extracts a more accurate optimal path. Furthermore, it was deduced from the comparison result with the A* algorithm that applying weights (preference, congestion, etc.) simultaneously with frequency can increase path extraction accuracy.

Extraction of Optimal Moving Patterns of Edge Devices Using Frequencies and Weights (빈발도와 가중치를 적용한 엣지 디바이스의 최적 이동패턴 추출)

  • Lee, YonSik;Jang, MinSeok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.5
    • /
    • pp.786-792
    • /
    • 2022
  • In the cloud computing environment, there has been a lot of research into the Fog/Edge Computing (FEC) paradigm for securing user proximity of application services and computation offloading to alleviate service delay difficulties. The method of predicting dynamic location change patterns of edge devices (moving objects) requesting application services is critical in this FEC environment for efficient computing resource distribution and deployment. This paper proposes an optimal moving pattern extraction algorithm in which variable weights (distance, time, congestion) are applied to selected paths in addition to a support factor threshold for frequency patterns (moving objects) of edge devices. The proposed algorithm is compared to the OPE_freq [8] algorithm, which just applies frequency, as well as the A* and Dijkstra algorithms, and it can be shown that the execution time and number of nodes accessed are reduced, and a more accurate path is extracted through experiments.

Base Location Prediction Algorithm of Serial Crimes based on the Spatio-Temporal Analysis (시공간 분석 기반 연쇄 범죄 거점 위치 예측 알고리즘)

  • Hong, Dong-Suk;Kim, Joung-Joon;Kang, Hong-Koo;Lee, Ki-Young;Seo, Jong-Soo;Han, Ki-Joon
    • Journal of Korea Spatial Information System Society
    • /
    • v.10 no.2
    • /
    • pp.63-79
    • /
    • 2008
  • With the recent development of advanced GIS and complex spatial analysis technologies, the more sophisticated technologies are being required to support the advanced knowledge for solving geographical or spatial problems in various decision support systems. In addition, necessity for research on scientific crime investigation and forensic science is increasing particularly at law enforcement agencies and investigation institutions for efficient investigation and the prevention of crimes. There are active researches on geographic profiling to predict the base location such as criminals' residence by analyzing the spatial patterns of serial crimes. However, as previous researches on geographic profiling use simply statistical methods for spatial pattern analysis and do not apply a variety of spatial and temporal analysis technologies on serial crimes, they have the low prediction accuracy. Therefore, this paper identifies the typology the spatio-temporal patterns of serial crimes according to spatial distribution of crime sites and temporal distribution on occurrence of crimes and proposes STA-BLP(Spatio-Temporal Analysis based Base Location Prediction) algorithm which predicts the base location of serial crimes more accurately based on the patterns. STA-BLP improves the prediction accuracy by considering of the anisotropic pattern of serial crimes committed by criminals who prefer specific directions on a crime trip and the learning effect of criminals through repeated movement along the same route. In addition, it can predict base location more accurately in the serial crimes from multiple bases with the local prediction for some crime sites included in a cluster and the global prediction for all crime sites. Through a variety of experiments, we proved the superiority of the STA-BLP by comparing it with previous algorithms in terms of prediction accuracy.

  • PDF