• Journal of Information Technology Applications and Management
• /
• v.12 no.1
• /
• pp.111-123
• /
• 2005

Many indexing methods were proposed so that process moving object efficiently. Among them, indexing methods like the 3D R-tree treat temporal and spatial domain as the same. Actually, however. both domain had better process separately because of difference in character and unit. Especially in this paper we deal with limited region such as indoor environment since spatial domain is limited but temporal domain is grown. In this paper we present a novel indexing structure, namely STS-tree(Separation of Time and Space tree). based on limited region. STS-tree is a hybrid tree structure which consists of R-tree and one-dimensional TB-tree. The R-tree component indexes static object and spatial information such as topography of the space. The TB-tree component indexes moving object and temporal information.

• The KIPS Transactions:PartD
• /
• v.12D no.4 s.100
• /
• pp.543-552
• /
• 2005

As random access memory chip gets cheaper, it becomes affordable to realize main memory-based database systems. The disk-based spatial indexing techniques, however, cannot direct apply to main memory databases, because the main purpose of disk-based techniques is to reduce the number of disk accesses. In main memory-based indexing techniques, the node access time is much faster than that in disk-based indexing techniques, because all index nodes reside in a main memory. Unlike disk-based index techniques, main memory-based spatial indexing techniques must reduce key comparing time as well as node access time. In this paper, we propose an efficient spatial index structure for main memory-based databases, called Tmr-tree. Tmr-tree integrates the characteristics of R-tree and T-tree. Therefore, Nodes of Tmr-tree consist of several entries for data objects, main memory pointers to left and right child, and three additional fields. First is a MBR of a self node, which tightly encloses all data MBRs (Minimum Bounding Rectangles) in a current node, and second and third are MBRs of left and right sub-tree, respectively. Because Tmr-tree needs not to visit all leaf nodes, in terms of search time, proposed Tmr-tree outperforms R-tree in our experiments. As node size is increased, search time is drastically decreased followed by a gradual increase. However, in terms of insertion time, the performance of Tmr-tree was slightly lower than R-tree.

• The KIPS Transactions:PartD
• /
• v.16D no.4
• /
• pp.487-496
• /
• 2009

This paper addresses an indexing scheme capable of efficiently processing range queries in a large-scale trajectory database. After discussing the drawbacks of previous indexing schemes, we propose a new scheme that divides the temporal dimension into multiple time intervals and then, by this interval, builds an index for the line segments. Additionally, a supplementary index is built for the line segments within each time interval. This scheme can make a dramatic improvement in the performance of insert and search operations using a main memory index, particularly for the time interval consisting of the segments taken by those objects which are currently moving or have just completed their movements, as contrast to the previous schemes that store the index totally on the disk. Each time interval index is built as follows: First, the extent of the spatial dimension is divided onto multiple spatial cells to which the line segments are assigned evenly. We use a 2D-tree to maintain information on those cells. Then, for each cell, an additional 3D $R^*$-tree is created on the spatio-temporal space (x, y, t). Such a multi-level indexing strategy can cure the shortcomings of the legacy schemes. Performance results obtained from intensive experiments show that our scheme enhances the performance of retrieve operations by 3$\sim$10 times, with much less storage space.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.05c
• /
• pp.206-209
• /
• 2002

의료 영상 처리 시스템에서는 영상들의 검색이 중요한 문제로 대두되고 있다. 그에 대한 해결 방법으로는 의료 영상 처리 시스템에 지능적인 내용 기반의 영상 검색 방법을 도입하는 것이다. 본 연구에서는 의료 영상에 적합한 분할 방법을 사용하여 뇌의 MR 영상에 대하여 내용기반 검색을 하기 위한 영상 특징 색인화 방법을 제안한다. 제안하는 색인화 방법은 뇌 MR 영상에서 뇌영역을 분할하고 특징들을 추출한 후 이 정보를 가지고 대상 영상의 그룹핑 정보를 유추하고, 각 대상 영상에서의 비정상 후보 영역 위치를 찾아내어 3차원 공간 색인을 하는 방법이다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.6
• /
• pp.1250-1256
• /
• 2004

The movement of continuously changing positions should be stored and indexed for querying current and past positions. A simple extension of the original R-tree to add time as another dimension, called 3D R-tree, does not handle current position queries and does not address the problem of low space utilization due to high overlap of index nodes. In this paper, 1 propose the dynamic splitting policy for improving the 3D R-tree in order to improve space utilization of split nodes. 1 also extend the original 3D R-tree by introducing a new tagged index structure for being able to query the current and past positions of moving objects. 1 found out that my extension of the original R-tree, called the tagged dynamic 3DR-tree, outperforms both the 3D R-tree and 75-tree when querying current and past position.

• Korean Journal of Remote Sensing
• /
• v.39 no.1
• /
• pp.111-127
• /
• 2023

In visual slam and 3D data modeling, the Iterative Closest Point method is a primary fundamental algorithm, and many technical fields have used this method. However, it relies on search methods that take a high search time. This paper solves this problem by applying an effective point cloud refinement method. And this paper also accelerates the point cloud registration process with an indexing scheme using the spatial decomposition method. Through some experiments, the results of this paper show that the proposed point cloud refinement method helped to produce better performance.

• 한국공간정보시스템학회:학술대회논문집
• /
• 2003.11a
• /
• pp.159-162
• /
• 2003

In this paper, to find probable collision positions between moving object and terrain in 3D space efficiently, we use a model, similar to Ray Tracing, which finds the triangles intersected by a directed line segment from a large amount of triangles. We try to reduce dead space as much as possible to find candidate triangles intersected by a directed line segment than previous work's. A new modified octree, LBV-Octree(Least Bounding Voxel Octree), is proposed, and we have a ray tracing with it. In the experiment, ray tracing with LBV-Octree provides $5%{\sim}11%$ better performance than with classical octree.

• Journal of Korean Society for Geospatial Information Science
• /
• v.6 no.1 s.11
• /
• pp.11-17
• /
• 1998

Recently, 3D GIS based on 3D geo-processing methodology and Internet environment are emerging issues in GIS fields. To design and implement 3D GIS, the strategic linkage of Java and VRML is first regarded: 3D feature format definition in the passion of conventional GIS including aspatial attributes, 3B feature indexing, 3D analytical operators such as selection, buffering, and Near, Metric operation such as distance measurement and statistical description, and 3D visualization. In 3D feature format definition, the following aspects are implemented: spatial information for 3D primitives extended from 2D primitives, multimedia data, object texture or color of VRML specification. DXF-format GIS layers with additional attributes are converted to 3D feature format and imported into this system. While, 3D analytical operators are realized in the form of 3D buffering with respect to user-defined point, line, polygon, and 3D objects, and 3D Near functions; furthermore, 'Lantern operator' is newly introduced in this 3D GIS. Because this system is implemented by Java applet, any client with Java-enable browser including VRML browser plug-in can utilize the new style of 3D GIS function in the virtual space. Conclusively, we present prototype of WWW-based 3D GIS, and this approach will be contribute to development of core modules on the stage of concept establishment and of real application model in future.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.10
• /
• pp.40-47
• /
• 2020

Various technologies, systems, and legal systems are applied to prevent and quickly respond to fire disaster; nevertheless, the damages to life and property caused by fires are not reduced every year. For managing fire disaster, generating spatial information-based safety status map and procuring suitability of attribute information for each position information are essential. The safety status map is generated by deriving the fire safety status assessment factors, indexing, and locating the surveying results through various methods. In this paper, we deal with derivation of building fire safety assessment factors for 3D safety status map. At first, we survey the foreign and domestic fire assessment model cases and its factors, and analyze the applicability of Korean 3D fire safety status map. Next, assessment factors for fire safety assessment model are derived. Assessment factors are derived and categorized by their information collecting activity; factors that can be accessed through basic building information and factors that can be accessed through field survey. As a derivation result, 14 assessment factors were derived over five categories(Industry Risk, Structural Risk, Fire Fighting Facility, Fire Dangerousness, Fire Response Status).

• International Journal of Highway Engineering
• /
• v.13 no.3
• /
• pp.111-119
• /
• 2011

The noise prediction model, KRON-2006, in South Korea has been developed for obtaining the average noise level. The model is based on an outdoor sound propagation method based on ISO9613 and ASJ Model-1998 and supports the analysis of the linear noise source, such as highway, for obtaining Leq. Because of that, the model can't obtain Lmax, Lmin from the time series noise profile based on traffic at every moment. In order to address this problem, the real time noise prediction model based on traffic simulation using GIS model and algorithm is proposed. It can predict the vehicle point noise level based on vehicle type, speed generated from traffic simulation by using headway and obtain Lmax, Lmin as integrating the noise profile generated from it at every moment. An evalution of the noise prediciton model using field measurements finds good agreement between predicted and measured noise levels at 1m, 8m, 15m from curb of the near side lane.