• The KIPS Transactions:PartD
• /
• v.9D no.1
• /
• pp.31-42
• /
• 2002

In this paper, we propose a new spatio-temporal representation scheme which can model moving objets trajectories effectively in video data and a new signature-based access method for moving objects trajectories which can support efficient retrieval on user query based on moving objects trajectories. The proposed spatio-temporal representation scheme supports content-based retrieval based on moving objects trajectories and concept-based retrieval based on concepts(semantics) which are acquired through the location information of moving objects trajectories. Also, compared with the sequential search, our signature-based access method can improve retrieval performance by reducing a large number of disk accesses because it access disk using only retrieved candidate signatures after it first scans all signatures and performs filtering before accessing the data file. Finally, we show the experimental results that proposed scheme is superior to the Li and Shan's scheme in terns of both retrieval effectiveness and efficiency.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06c
• /
• pp.36-40
• /
• 2008

SIMS manages data for various spatial and non-spatial as integral management system to support space information administration environment and support several application works. Without being limited to spatial data that existent spatial Data Mining question language advances handling in this paper, did so that can find useful information from various data connected with automatically data collection, artificial satellite side upside service, remote sensing, GPS. Mobile Computing and data about Spatio-Temporal. Also, we designed spatial Data Mining query language that support a spatial Data Mining exclusive use system based on SIMS.

• Journal of KIISE:Software and Applications
• /
• v.29 no.9
• /
• pp.631-644
• /
• 2002

In this paper efficient algorithms for content-based video retrieval using motion information are proposed, including temporal scale-invariant retrieval and temporal scale-absolute retrieval. In temporal scale-invariant video retrieval, the distance transformation is performed on each trail image in database. Then, from a given que교 trail the pixel values along the query trail are added in each distance image to compute the average distance between the trails of query image and database image, since the intensity of each pixel in distance image represents the distance from that pixel to the nearest edge pixel. For temporal scale-absolute retrieval, a new coding scheme referred to as Motion Retrieval Code is proposed. This code is designed to represent object motions in the human visual sense so that the retrieval performance can be improved. The proposed coding scheme can also achieve a fast matching, since the similarity between two motion vectors can be computed by simple bit operations. The efficiencies of the proposed methods are shown by experimental results.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.664-674
• /
• 2004

The trajectory preservation property that stores only one trajectory in a leaf node is the most important feature of an index structure, such as the TB-tree for retrieving object's moving paths in the spatio-temporal space. It performs well in trajectory-related queries such as navigational queries and combined queries. But, the MBR of non-leaf nodes in the TB-tree have large amounts of dead space because trajectory preservation is achieved at the sacrifice of the spatial locality of trajectories. As dead space increases, the overlap between nodes also increases, and, thus, the classical range query cost increases. We present a new split policy and entry relocation policies, which have no deterioration of the performance for trajectory-related queries, for improving the performance of range queries. To maximally reduce the dead space of a non-leaf node's MBR, the Maximal Area Reduction (MAR) policy is used as a split policy for non-leaf nodes. The entry relocation policy induces entries in non-leaf nodes to exchange each other for the purpose of reducing dead spaces in these nodes. We propose two algorithms for the entry relocation policy, and evaluate the performance studies of new algorithms comparing to the TB-tree under a varying set of spatio-temporal queries.

• Journal of KIISE:Databases
• /
• v.35 no.2
• /
• pp.169-181
• /
• 2008

Because moving objects usually move on spatial networks, efficient trajectory index structures are required to achieve good retrieval performance on their trajectories. However, there has been little research on trajectory index structures for spatial networks such as FNR-tree and MON-tree. But, because FNR-tree and MON-tree are stored by the unit of the moving object's segment, they can't support the whole moving objects' trajectory. In this paper, we propose an efficient trajectory index structure, named Trajectory of Moving objects on Network Tree(TMN Tree), for moving objects. For this, we divide moving object data into spatial and temporal attribute, and preserve moving objects' trajectory. Then, we design index structure which supports not only range query but trajectory query. In addition, we divide user queries into spatio-temporal area based trajectory query, similar-trajectory query, and k-nearest neighbor query. We propose query processing algorithms to support them. Finally, we show that our trajectory index structure outperforms existing tree structures like FNR-Tree and MON-Tree.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2000.11a
• /
• pp.85-90
• /
• 2000

90년대 초반부터 공간정보와 함께 시간정보를 포함하는 시공간 데이터베이스 시스템에 대한 연구가 활발히 진행되고 있지만, 대부분의 연구가 시공간 데이터모델에 치중하고 있으며 시공간 질의어에 대한 연구는 최근에 시작되고 있다. 본 논문에서는 시간 정보의 포함 여부에 따라 다양한 형태로 구분되는 시공간 테이블을 효율적으로 관리할 수 있으며, 비 공간정보에 대한 조건과 공간정보에 대한 조건 및 시간정보에 대한 조건으로 구성되는 시공간 질의를 간결하고 효과적으로 표현할 수 있는 시공간 질의어를 설계한다.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.11
• /
• pp.64-73
• /
• 2012

In this paper, we propose a method to search for identical videos. The proposed method is spatio-temporal group feature fingerprinting. Frame of video is extracted from fixed rate method and is partitioned into vertical group and horizontal group. Descriptor is made of each group feature that is extracted from binary fingerprinting. Next, use descriptor of original video to build a two type of fingerprinting database and matching with query video. To efficient and effective video copy detection, method have high robustness, independence, matching speed. In proposed method, group feature have high robustness and independence in variable modification of video. Building a original fingerprinting database is able to fast matching with query video. The proposed method shows performance improvement in variable modifications in comparison to the existing methods. Especially, very singular performance in speed improvement is great advantage of this paper.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.2
• /
• pp.364-370
• /
• 2014

The management and analysis of spatio-temporal and multimedia data is a hot issue in database research because such data types are handled in manny applications. Querying databases of such a content is very important for these applications. This paper addresses algorithms that make index structure by using Douglas-Peucker Algorithm and process range query efficiently on moving objects trajectories. We compare and analyze our algorithms and MBR by experiments. Our algorithms make smaller size of index structure and process more efficiently.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.418-421
• /
• 2014

Because of the rapid growth of mobile communication and wireless communication, Location-based services are handled in many applications. So, the management and analysis of spatio-temporal data are a hot issue in database research. Index structure and query processing of such contents are very important for these applications. This paper addressees algorithms that make index structure by using Douglas-Peucker Algorithm and process nearest neighbor search query efficiently on moving objects trajectories. We compare and analyze our algorithms by experiments. Our algorithms make small size of index structure and process the query more efficiently.

• The KIPS Transactions:PartD
• /
• v.11D no.4
• /
• pp.835-844
• /
• 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. Range queries, whose range can be window or circular, are the most essential query types in LBS. We need to distinguish completely contained cells from partially contained cells in those range queries. Also, it is necessary to consider temporal dimension to filter out qualifying objects correctly. In this paper, we adopt two-level index structures with fixed grid file structures in the second level, which are designed to minimize update operations. We propose a spatial ceil filtering method using VP filtering and a combined spatio-temporal filtering method using time gone concepts. Some experimental results are shown for various window queries and circular queries with different filtering combinations to show the performance tradeoffs of the proposed methods.