• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.927-930
• /
• 2010

Recently, continuous k-nearest neighbor query(CkNN) which is defined as a query to find the nearest points of interest to all the points on a given path is widely used in the LBS(Location Based Service) and ITS(Intelligent Transportation System) applications. It is necessary to acquire results quickly in the above applications and be applicable to spatial network databases. This paper proposes a new method to search nearest POIs(Point Of Interest) for moving query objects on the spatial networks. The method produces a set of split points and their corresponding k-POIs as results. There is no order between the POIs. The analysis show that the proposed method outperforms the existing methods.

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

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.163-166
• /
• 2005

The latest wireless communications technology bring about the rapid developments of Global Position System and Location-Based Service. It is very important for the moving object database to deal with database queries related to the trajectories of a moving objects and the valid time 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 time when a query point and objects are moving at the same time. 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.

• The Journal of the Korea Contents Association
• /
• v.7 no.6
• /
• pp.9-21
• /
• 2007

In this paper, the hybrid methods are suggested, which use the direction angle information to present running trajectory and track the past locations through a small amount of vehicle's location information. In order to prove the effectiveness of the new technique suggested here, vehicle's location information are collected by running the vehicles moving objects under various conditions. Using the location informations and direction angle information collected with time intervals, the vehicl e's location information is abstracted, compared and analyzed. and I have proved that the suggested techniques are more effective by comparing them with others in various methods such as GPS TrackMaker, difference image techniques, consistency comparison, quantity comparison, vehicle's running distances and so on.

• The KIPS Transactions:PartD
• /
• v.8D no.4
• /
• pp.367-376
• /
• 2001

For the electronic map service by wireless, the existing map database cannot be used directly. This is because, the data volume of a map is too big to transfer by wireless and although the map is transferred successfully, the devices to display the map usually don’t have enough resources as the ones for desktop computers. It is also not acceptable to construct map database for the exclusive use of wireless service because of the vast cost. We propose new technique to generate a map for wireless service dynamically, from the existing map database. This technique includes the generalization method to reduce the map data volume and filtering method to guarantee that the data volume don’t exceed the limit of bandwidth. The generalization is performed in 3 steps :ㅁ step of merging the layers, a step of reducing the size of spatial objects, and a step of processing user interface. The filtering is performed by 2 module, counter and selector module. The counter module checks whether the data blume of generated map by generalization, exceeds the bandwidth limit. The selector module eliminates the excess objects and selects the rest, on the basis of distance.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.5
• /
• pp.411-419
• /
• 2013

Research on developing algorithms for building modeling such as extracting outlines of the buildings and segmenting patches of the roofs using aerial images or LiDAR data are active. However, utilizing information from the building model is not well implemented yet. This study aims to propose a scheme for search identical or similar shape of buildings by utilizing graph topology pattern matching under the assumptions: (1) Buildings were modeled beforehand using imagery or LiDAR data, or (2) 3D building data from digital maps are available. Side walls, segmented roofs and footprints were represented as nodes, and relationships among the nodes were defined using graph topology. Topology graph database was generated and pattern matching was performed with buildings of various shapes. The results show that efficiency of the proposed method in terms of reliability of matching and database structure. In addition, flexibility in the search was achieved by altering conditions for the pattern matching. Furthermore, topology graph representation could be used as scale and rotation invariant shape descriptor.

• The KIPS Transactions:PartD
• /
• v.9D no.6
• /
• pp.1071-1082
• /
• 2002

Recent development in wireless computing and GPS technology cause the active development in the application system of location information in real-time environment such as transportation vehicle management, air traffic control and location based system. Especially, study about vehicle location tracking system, which monitors the vehicle's position in a control center, is appeared to be a representative application system. However, the current vehicle location tracking system can not provide vehicle position information that is not stored in a database at a specific time to users. We designed a vehicle location tracking system that could track vehicle location using mobile interface such as PDA. The proposed system consist of a vehicle location retrieving server and a mobile interface. It is provide not only the moving vehicle's current location but also the position at a past and future time which is not stored in database for users.

• The KIPS Transactions:PartD
• /
• v.14D no.7
• /
• pp.707-718
• /
• 2007

Recently, much studies for providing mobile users with suitable and useful content services, LBS(Location Based Service) corresponding to the change of users' location, are actively going on. First and foremost, this is basically owing to the progress of location management technologies such as GPS, mobile communication technology and the spread of personal devices like PDA and the cellular phones. Besides, the research scope of LBS has been changed from vehicle tracking and navigation services to intelligent and personalized services considering the changing information of conditions or environment where the users' are located. For example, it inputs the information such as heavy traffic, pollution, and accidents. The query languages which effectively search the stored vehicle and environment information have been studied depending on the increase of the information utilization. However, most of existing moving object query languages are not enough to provide a recommendation service for a user, because they can not be tested and evaluated in real world and did not consider changed environment information. In order to retrieve not only a vehicle location and environment condition but also use them, we suggest a moving object query language for recommendation service and implement a moving object query process system for supporting a query language. It can process a nearest neighbor query for recommendation service which considers various attributes such as a vehicle's location and direction, environment information. It can be applied to location based service application which utilizes the recommended factors based on environmental conditions.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.3
• /
• pp.89-103
• /
• 2006

Location-Based Services(LBS) has been varied and expanded rapidly in local and overseas markets due to technology developments and expanded applications of wireless internet. Location Based Alert Service(LBA) capable of automatically furnishing data when entering or outing a specific location is expected to become one of the most important services in LBS. For LBA operation, it is essential to periodically get location information about moving object. However, this can cause a serious system load because system should continuously and largely receive location information of many moving objects. Existing and current methods for location polling of moving object are not suitable for an efficient location acquisition and a search structure required for LBA. In this study, to acquire large-scaled location information for LBA, a MDR moving object location polling algorithm will be suggested to reduce unnecessary location information and decrease system load by using mobility patterns of moving object.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.12
• /
• pp.5015-5022
• /
• 2010

Most of the existing pattern mining techniques are capable of searching patterns according to the continuous change of the spatial information of an object but there is no constraint on the spatial information that must be included in the extracted pattern. Thus, the existing techniques are not applicable to the optimal path search between specific nodes or path prediction considering the nodes that a moving object is required to round during a unit time. In this paper, the precision of the path search according to the spatial hierarchy is analyzed using the Spatial-Temporal Optimal Moving Pattern(with Frequency & Weight) (STOPM(FW)) algorithm which searches for the optimal moving path by considering the most frequent pattern and other weighted factors such as time and cost. The result of analysis shows that the database retrieval time is minimized through the reduction of retrieval range applying with the spatial constraints. Also, the optimal moving pattern is efficiently obtained by considering whether the moving pattern is included in each hierarchical spatial scope of the spatial hierarchy or not.