• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.1099-1101
• /
• 2003

Change detection technology, which discovers the change information on the surface of the earth by comparing and analyzing multi-temporal satellite images, can be usefully applied to the various fields, such as environmental inspection, urban planning, forest policy, updating of geographical information and the military usage. In this paper, we introduce a change detection system that can extract and analyze change elements from high-resolution satellite imagery as well as low- or middle-resolution satellite imagery. The developed system provides not only 7 pixelbased methods that can be used to detect change from low- or middle-resolution satellite images but also a float window concept that can be used in manual change detection from highresolution satellite images. This system enables fast access to the very large image, because it is constituted by OGC grid coverage components. Also new change detection algorithms can be easily added into this system if once they are made into grid coverage components.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.4
• /
• pp.752-758
• /
• 2012

SNS(Social Networking Services) is oneline service that enable users to construct human network through their relation on web, such as following relation, friend relation, and etc. Recently, owing to the advent of digital devices (smart phone, tablet PC) which embedded GPS some applications which provide services with spatial relevance and social relevance have been released. Such an online service is called LBSNS. It is required to use spatial filtering so as to build the LBSNS system that enable users to subscribe information of interesting area. For spatial filtering, user and tweet attaches location information which divide into static property presenting fixed area and dynamic property presenting user's area changed along the moving user. In the case of using a location information including dynamic property, Continuous query occurred from the moving user causes the problem in server. In this paper, we propose spatial filtering algorithm using Virtual Grid for reducing frequency of query, and conclude that frequency of query on using Virtual Grid is 93% decreased than frequency of query on not using Virtual Grid.

• ETRI Journal
• /
• v.30 no.6
• /
• pp.853-855
• /
• 2008

This paper presents an energy-efficient spatial join algorithm for multiple sensor networks employing a spatial semijoin strategy. For optimization of the algorithm, we propose a GR-tree index and a grid-ID-based spatial approximation method, which are unique to sensor networks. The GR-tree is a distributed spatial index over the sensor nodes, which efficiently prunes away the nodes that will not participate in a spatial join result. The grid-ID-based approximation provides great reduction in communication cost by approximating many spatial objects in simpler forms. Our experiments demonstrate that the algorithm outperforms existing methods in reducing energy consumption at the nodes.

• Spatial Information Research
• /
• v.8 no.1
• /
• pp.155-170
• /
• 2000

When we use R-Tree,a spatial index, to find objects matches some predicate, it often leads to an incorrect result of perform filtering step only with MBR. And , each candidates need to be inspected to conform if it really satisfies with given query, so called, 'refinement step'. In refinement step. we should perform disk I/O and expansive spatial operations which is the cause of increasing retrieval costs. Therefore, to minimize the number of candidate after filtering step, two-phase filtering methods were studied, but there was many problems such as inefficiency of filtering,maintenance of additional informations and reconstruction of data resulted from the loss of original information. So , in this paper, I propose an Extended R-Tree which provides ability to retrieve spatial objects only with some simple logical operations using Grid Table, truth table strong the information about the existence of spatial objects, in second filtering step. Consequently , this Extended R-Tree using Grid Filter has low cost of operation for filtering because of efficient second filtering step, and better filtering efficiency caused by high quality of approximation.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.26 no.3
• /
• pp.12-36
• /
• 2023

Graph databases, which store different types of data and their relationships modeled as a graph, can be effective in managing and analyzing real estate spatial data linked by complex relationships. However, they are not widely used due to the limited spatial functionalities of graph databases. In this study, we propose a uniform grid-based real estate spatial data management approach using a graph database to respond to various real estate-related spatial questions. By analyzing the real estate community to identify relevant data and utilizing national point numbers as unit grids, we construct a graph schema that linking diverse real estate data, and create a test database. After building a test database, we tested basic topological relationships and spatial functions using the Jackpine benchmark, and further conducted query tests based on various scenarios to verify the appropriateness of the proposed method. The results show that the proposed method successfully executed 25 out of 29 spatial topological relationships and spatial functions, and achieved about 97% accuracy for the 25 functions and 15 scenarios. The significance of this study lies in proposing an efficient data integration method that can respond to real estate-related spatial questions, considering the limited spatial operation capabilities of graph databases. However, there are limitations such as the creation of incorrect spatial topological relationships due to the use of grid-based indexes and inefficiency of queries due to list comparisons, which need to be improved in follow-up studies.

• Current Optics and Photonics
• /
• v.5 no.4
• /
• pp.409-420
• /
• 2021

We propose a method to synthesize a color non-hogel-based computer-generated-hologram (CGH) from light field data of a three-dimensional scene with a hologram pixel pitch shared for all color channels. The non-hogel-based CGH technique generates a continuous wavefront with arbitrary carrier wave from given light field data by interpreting the ray angle in the light field to the spatial frequency of the plane wavefront. The relation between ray angle and spatial frequency is, however, dependent on the wavelength, which leads to different spatial frequency sampling grid in the light field data, resulting in color aberrations in the hologram reconstruction. The proposed method sets a hologram pixel pitch common to all color channels such that the smallest blue diffraction angle covers the field of view of the light field. Then a spatial frequency sampling grid common to all color channels is established by interpolating the light field with the spatial frequency range of the blue wavelength and the sampling interval of the red wavelength. The common hologram pixel pitch and light field spatial frequency sampling grid ensure the synthesis of a color hologram without any color aberrations in the hologram reconstructions, or any loss of information contained in the light field. The proposed method is successfully verified using color light field data of various test or natural 3D scenes.

• Journal of KIISE
• /
• v.43 no.5
• /
• pp.590-595
• /
• 2016

In this study, we propose an efficient method for monitoring continuous top-k queries. In contrast to the conventional top-k queries, the presented top-k query considers both spatial and non-spatial attributes. We proposed a novel main-memory based grid access method, called Bit-Vector Grid Index (BVGI). The proposed method quickly identifies whether the moving objects are included in some of the grid cell by encoding a non-spatial attribute value of the moving object to bit-vector. Experimental simulations demonstrate that the proposed method is several times faster than the previous method and uses considerably less memory.

• Steel and Composite Structures
• /
• v.24 no.5
• /
• pp.549-559
• /
• 2017

As few multi-tower single-box multi-cell cable-stayed bridges with corrugated steel webs have been built, analysis is mostly achieved by combining single-girder model, beam grillage model and solid model in support of the design. However, such analysis methods usually suffer from major limitations in terms of the engineering applications: single-girder model fails to account for spatial effect such as shear lag effect of the box girder and the relevant effective girder width and eccentric load coefficient; owing to the approximation in the principle equivalence, the plane grillage model cannot accurately capture shear stress distribution and local stress state in both top and bottom flange of composite box girder; and solid model is difficult to be practically combined with the overall calculation. The usual effective width method fails to provide a uniform and accurate "effective length" (and the codes fail to provide a unified design approach at those circumstance) considering different shear lag effects resulting from dead load, prestress and cable tension in the construction. Therefore, a novel spatial grid model has been developed to account for shear lag effect. The theoretical principle of the proposed spatial grid model has been elaborated along with the relevant illustrations of modeling parameters of composite box girder with corrugated steel webs. Then typical transverse and longitudinal shear lag coefficient distribution pattern at the side-span and mid-span key cross sections have been analyzed and summarized to provide reference for similar bridges. The effectiveness and accuracy of spatial grid analysis methods has been finally validated through a practical cable-stayed bridge.

• The KIPS Transactions:PartD
• /
• v.10D no.4
• /
• pp.567-576
• /
• 2003

Spatial data mining, i.e., discovery of interesting characteristics and patterns that may implicitly exists in spatial databases, is a challenging task due to the huge amounts of spatial data. Clustering algorithms are attractive for the task of class identification in spatial databases. Several methods for spatial clustering have been presented in recent years, but have the following several drawbacks increase costs due to computing distance among objects and process only memory-resident data. In this paper, we propose an efficient grid cell based spatial clustering method for spatial data mining. It focuses on resolving disadvantages of existing clustering algorithms. In details, it aims to reduce cost further for good efficiency on large databases. To do this, we devise a spatial clustering algorithm based on grid ceil structures including cell relationships.

• Journal of Korea Multimedia Society
• /
• v.25 no.11
• /
• pp.1557-1563
• /
• 2022

Currently Spatial Data is collected and processed in various methods, and its usability is very high. However, the existing Spatial Data analysis Software usually requires professional knowledge in the collection, refinement, and application of spatial Date, making it difficult to access and apply it. Therefore, this study established a new WebGIS platform with improved accessibility and usability to solve these problems. This platform supports various services such as master map sharing, spatial data generation, automatic coordinate system conversion, WMS issuance, grid generation, and grid analysis. These services increase operational convenience, such as simplifying repetitive tasks and automatically expressing text files. While it is believed that non-experts can easily and conveniently because of them to simplify and express the results. In addition, it is judged to have high accuracy and reliability compared to the analysis results using the existing Open Source-based GIS software.