• Journal of the Korea Computer Industry Society
• /
• v.8 no.2
• /
• pp.103-106
• /
• 2007

In order to construct a Video Database, shot change detection should be made first. But, because these processes are not automated perfectly, we need a lot of time and efforts now. And, there are many shot change detection algorithms, which can't always insure the perfect result because of the editing effects such as cut, wipe, and dissolves used in film production. Therefore, in order to receive the exact shot change, It needs the verification and correction by manual processing at any cost. Spatiotemporal slice is a simple image condensing method for the content changes of video. The editing effects are expressed on the Spatiotemporal slice in the visually noticed form of vertical line, diagonal line, curved line and gradual color changes, etc. Accordingly the parts doubted as a shot change can be easily detected by the change of the Spatiotemporal slice without replaying the video. The system proposed in this study makes it possible to delete the false detected key frames, and create the undetected key frames on the Spatiotemporal slice.

• ETRI Journal
• /
• v.30 no.3
• /
• pp.421-431
• /
• 2008

In this paper, we offer a new technique to discover frequent spatiotemporal patterns from a moving object database. Though the search space for spatiotemporal knowledge is extremely challenging, imposing spatial and timing constraints on moving sequences makes the computation feasible. The proposed technique includes two algorithms, AllMOP and MaxMOP, to find all frequent patterns and maximal patterns, respectively. In addition, to support the service provider in sending information to a user in a push-driven manner, we propose a rule-based location prediction technique to predict the future location of the user. The idea is to employ the algorithm AllMOP to discover the frequent movement patterns in the user's historical movements, from which frequent movement rules are generated. These rules are then used to estimate the future location of the user. The performance is assessed with respect to precision and recall. The proposed techniques could be quite efficiently applied in a location-based service (LBS) system in which diverse types of data are integrated to support a variety of LBSs.

• Journal of Korea Spatial Information System Society
• /
• v.5 no.1 s.9
• /
• pp.65-74
• /
• 2003

Location-based service is an important spatiotemporal database application area that provides the location-aware information of wireless terminals via positioning devices such as GPS. With the rapid advances of wireless communication systems, the requirement of mobile application areas including traffic, mobile commerce and supply chaining management became the center of attention for various research issues in spatiotemporal databases. In this paper we present the A-Quadtree, an efficient indexing method for answering location-based queries where the movement vector information (e.g., speed and velocity) is not presented. We implement the A-Quadtree with an index structure for object identifiers as a.Net component to apply the component to multiplatforms. We present our approach and describe the performance evaluation through various experiments. In our experiments, we compare the performance with previous approaches and show the enhanced efficiency of our method.

• 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.

• Journal of KIISE:Databases
• /
• v.30 no.1
• /
• pp.52-63
• /
• 2003

Spatiotemporal moving objects are changing their Positions and/or shape over time in real world. As most of the indices of moving object are based on the R-tree. they have defects of the R-tree which are dead space and overlap. Some of the indices amplify the defects of the R-tree. In the paper, to solve the problems, we propose the MPR-tree(Moving Point R-tree) using Projection operation which has more effective search than existing moving point indices on time slice query and spatiotemporal range query. The MPR-tree connects positions of the same moving objects over time by using linked list, so it processes the combined query about trajectory effectively. The usefulness of the Projection operation is confirmed during processing moving object queries and in practical use of space from experimentation to compare MPR-tree with existing indices of moving objects. The proposed MPR-tree would be useful in the LBS, the car management using GPS, and the navigation system.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.287-290
• /
• 2004

In the moving object database system, spatiotemporal join is very import operation when we process join moving objects. Processing time of spatio-temporal join operation increases by geometric progression with numbers of moving objects. Therefore efficient methods of spatio-temporal join is essential to moving object database system. In this paper, we propose spatio-temporal join algorithm with TB-Tree that preserves trajectories of moving objects, and show result of test. We first present basic algorithm, and propose cpu-time tunning algorithm and IO-time tunning algorithm. We show result of test with data set created by moving object generator tool.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.04a
• /
• pp.67-70
• /
• 2002

시공간 접근 방법들을 위한 효율적인 성능평가 환경은 최소한 다음과 같은 모듈들을 포함해야 한다. 종합적인 데이터집합의 생성, 데이터집합의 저장, 접근 구조들의 수집과 실행, 실험적인 결과의 시각화 등이다. 데이터집합 저장 모듈에 초점을 맞추어서 다양한 실제 세계 시나리오를 실험하기 위한 종합적인 데이터의 생성이 요구된다. 과거의 여러 알고리즘들은 작업공간에서 미리 분배된 정적인 공간데이터를 생성하기 위하여 구현되어져왔다. 하지만 시간에 따라 변화하는 공간객체인 시공간 데이터를 생성하기에는 어렵다. 이 논문에서 시공간 데이터 타입의 데이터 생성기에서 고려하여야 할 매개변수들에 대하여 논의한다. "Generate_Spatio_Temporal_Data"라는 알고리즘은 움직이는 점 또는 사각형데이터를 생성하고 거래시간과 유효시간을 구별하지 않았으며 시간 점만을 표현하였다. 이 논문에서는 정확한 시간적 개념을 표현하기 위하여 거래시간과 유효시간간격 모두를 지원하는 데이터 생성기에 관하여 논의하기 위한 알고리즘을 제시하고 실제적인 데이터집합 생성을 위한 매개변수들을 나타낸다.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.564-566
• /
• 2003

There are no immutable phenomena in reality. A lot of applications are dealing with data characterized by spatial and temporal and/or uncertain features. Currently, there has no any data model accommodating enough those three elements of spatial objects to directly use in application systems. For such reasons, we introduce a fuzzy spatio -temporal data model (FSTDM) and a method of integrating temporal and fuzzy spatial operators in a unified manner to create fuzzy spatio -temporal (FST) operators. With these operators, complex query expression will become concise. Our research is feasible to apply to the management systems and query processor of natural resource data, weather information, graphic information, and so on.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.36 no.2
• /
• pp.95-104
• /
• 2018

This study has the purpose of suggesting the method to analyze the spatiotemporal change of satisfaction concerning the officially assessed land price using geostatistical analysis. Analyzing the spatial distribution characteristic of officially assessed land price using present GIS (Geographic Information System) or is staying at qualitatively suggesting the improvement method of the officially assessed land price system. Grouping the appeal strength based on the official price and opinion price of officially assessed land price, GIS DB (Database) was constructed and the time seriate satisfaction were analyzed and compared through spatial density analysis and spatial autocorrelation analysis. As a result, it was found that the difference between the official price and the applicant's price differed depending on individual land, but most of the respondents requested the increase or the reduction of the average land price, which resulted in a large number of request. Analyzing the satisfaction of the officially assessed land price by using GIS, it was known that satisfaction of officially assessed land price could be analyzed by using the difference of the opinion price and not only the officially assessed land price. Spatiotemporal change of officially assessed land price satisfaction was known to be possible through spatiotemporal pattern analysis method such as spatiotemporal auto-corelation analysis and hotspot analysis etc using GIS. In short, regionally positive or negative significant relationship was investigated through spatiotemporal analysis using annual data.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.356-359
• /
• 2009

최근 센서와 모바일 기술의 발달에 따라 대용량 데이터 처리가 가능해지고, 유비쿼터스와 텔레매틱스 등의 도입으로 공간 데이터가 다양한 환경에 응용되거나 활용 분야가 점차 증가하고 있다. 특히 사용자에게 다양한 공간 데이터를 제공하는 수치지도의 활용성이 점차 증가하고 있다. 기존의 수치지도 관리 시스템은 이력에 대한 체계적인 관리방법과 공간 객체의 변화를 분석 또는 이력에 대한 질의 처리에 대한 구체적인 방안이 없는 실정이다. 따라서 이 논문에서는 효율적인 이력 관리를 위해 시공간 데이터 모델을 설계하고 그 모델을 기반으로 공간 객체의 이력 관리 기법을 제안한다. 제안된 모델을 통해 효율적인 이력 관리 및 시간에 대한 질의 처리가 가능하며, 사용자에게 정확한 이력 정보를 제공할 수 있다.