• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.283-286
• /
• 2004

This paper refers and implements XML Web services, which supports networked interchanges of moving object information. XML Web services are expected to be fundamental building blocks in the move to distributed computing on the Internet. As an interchange format, GML encodes semantics, syntax, and schema of geospatial and geoprocessing-related information resources. It can give great benefits to utilize raw data easily as an XML encoding format does. This paper proposes a full coverage of interoperable location trajectory services consisting of 3 independent modules: a moving object database, a data processing server, and a web services interface module. For communications, SOAP protocols and WSDL documents are used, which can guarantee an interoperability of a system regardless of different platforms and service channels. This paper also designs a GML data format that represents location information of probe cars.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.189-191
• /
• 2003

The types of service using location information are being various and extending its domain as wireless internet technology is developing and its application part is widespread, so it is prospected that LBS (Location-Based Services) will be killer application in wireless internet services. The MODB (Moving Object Database) stores and manages very large current/ past moving object data, so it is very important part in LBS platform. The performance of LBS platform is tightly depending on the performance of this MODB. The other important part is alerting engine in LBS platform, which is system to transmit various value-added information or notify emergency information to mobile phone after triggering specified events. This alert engine is supported as extended function of MODB, that is to say, the alerting function is closely related with MODB. So alert cartridge on MODB must provide not only moving point triggering about going into, going out specified geographical area but also batch alerting about nearest neighbor from specified geographical area. In this paper, we study of extended part on MODB to support the alert engine. And we design alert engine cartridge on MODB before implementing the system.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.301-304
• /
• 2007

A realization for image searching engine with moving objects identification and classification is presented in this paper. The identification algorithm is applied to extract difference image between input image and the reference image, and the classification is used the region segmentation. That is made the database for the searching engine. The experimental result of the realized system enables to search for human and animal at time intervals to use a surveillant system at inside environment.

• The Journal of Korean Association of Computer Education
• /
• v.6 no.4
• /
• pp.49-59
• /
• 2003

In order to index exactly moving objects(vehicle, mobile phone, PDA, etc.) in a mobile database, continuous updates of their locations arc inevitable as well as time-consuming. In this paper, we propose a spatial indexing method of moving objects for the efficient mobile map services. In detail, we analyze the characteristics of both the method to re-index all the objects after each time period and the method to update immediately the locations on reporting their locations. We also newly propose a bucket split method using the properties of moving objects in order to minimize the number of database updates. The experiments conducted on the environments of moving object show that the proposed indexing method is appropriate to map services for mobile devices.

• The Journal of Information Systems
• /
• v.19 no.1
• /
• pp.1-17
• /
• 2010

This paper proposes an updating policy of indoor moving object databases (IMODB) for location-based services. our method applies the Ka1man filter on the recently collected measured positions to estimate the moving object's position and velocity at the moment of the most recent measurement, and extrapolate the current position with the estimated position and velocity. If the distance between the extrapolated current position and the measured current position is within the threshold, in other words if they are close then we skip updating the IMODB. When the IMODB needs to know the moving object's position at a certain moment T, it applies the Kalman filter on the series of the measurements received before T and extrapolates the position at T with the estimations obtained by the Kalman filter. In order to verify the efficiency of our updating method, we performed the experiments of applying our method on the series of measured positions obtained by applying the fingerprinting indoor positioning method while we are actually walking through the test bed. In the analysis of the test results, we estimated the communication saving rate of our method and the error increment rate caused by the communication saving.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.4
• /
• pp.865-870
• /
• 2005

The latest Global Positioning System, wireless communications technology and Location-Based Service bring about the rapid developments of telematics application areas. In the moving object database for telematics, it is very important to deal with database queries related to the real time current positions of a moving objects and the valid tine of the query results as well. In this paper, we propose how to get not only the current result of query but also the valid time and the result after the valid time when a query point and objects are moving simultaneously. We would like to predict the valid time by formula because the current results will be incorrect due to the characteristic of the continuous movements of the moving objects and the future results can not be calculated by iterative computations.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.345-349
• /
• 2004

In order to index exactly moving objects(vehicle, mobile phone, PDA, etc.) in the mobile database, continuous updates of their locations are inevitable as well as time-consuming. The studies of pure spatial indices have focused on the efficient retrievals. However, the acquisition and management of the terminal Location of moving objects are more important than the efficiency of the query processing in the moving object databases. Therefore, it will be need to adopt parallel processing system for the moving object databases which should maintain the object's current location as precise as possible. This paper proposes a architecture of spatial indexing mobile objects using multiple processors. More precisely, we newly propose a method of splitting buckets using the properties of moving objects in order to minimize the number of database updates. We also propose a acquisition method for gathering the location information of moving objects and passing the information of the bucket extents in order to reduce the amount of passed messages between processors.

• Journal of the Korean Data and Information Science Society
• /
• v.19 no.3
• /
• pp.979-994
• /
• 2008

Moving objects are spatio-temporal data that change their location or shape continuously over time. Generally, if continuously moving objects are managed by a conventional database management system, the system cannot properly process the past and future location which is not stored in the database. Up to now, for the purpose of location tracking which is not stored, the linear interpolation to estimate the past location has been usually used. It is suitable for the moving objects on linear route, not curved route. In this paper, we propose a past location tracking algorithm for a moving object on curved routes, and also suggest a future location tracking algorithm using some past location information. We found that the proposed location tracking algorithm has higher accuracy than the linear interpolation function.

• Journal of Korea Spatial Information System Society
• /
• v.6 no.1 s.11
• /
• pp.59-71
• /
• 2004

Nearest neighbor query retrieves nearest located target objects, and is very frequently used in mobile environment. In this paper we propose a novel neatest neighbor query processing technique that is able to retrieve nearest located target object from the user who is continuously moving with a direction. The proposed method retrieves objects using the direction property of moving object as well as euclidean distance to target object. The proposed method is applicable to traffic information system, travel information system, and location-based recommendation system which require retrieving nearest located object.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2009.01a
• /
• pp.313-320
• /
• 2009

본 논문은 옥내 이동객체 데이터베이스의 갱신 전략을 제안한다. 제안하는 방법은 최근의 일련의 측정치에 칼만 필터를 적용하여 이동객체의 속도를 예측하고, 예측한 속도를 최근 측정치에 적용하여 현재 위치를 추정한다. 그리고 현재 위치로 추정된 값과 현재 실측값의 차이가 일정 거리 이하이면 실측값을 전송하지 않는다. 제안하는 방법의 효율성을 검증하기 위하여 실험 공간을 실제로 걸어가면서 측정한 일련의 측정치에 제안하는 방안을 적용하여 전송을 절약하는 비율과 이로 인한 오차의 증가율을 분석한다.