• Spatial Information Research
• /
• v.9 no.1
• /
• pp.15-30
• /
• 2001

Solid waste collection service is viewed as one of the most important public services in urban area. The purpose of this study is to apply the GIS based regional partitioning and arc routing methods for solid waste collection districting and vehicle routing-scheduling in order to provide waste collection service more efficiently. In this study, solid waste deposit sites are derived from the centroid of each building and the amount of solid waste is deduced based on the number of households and establishments. The regional partitioning procedure is performed based on waste collection zones which are constructed from waste deposit sites. The result of this study shows that solid waste collection districts which are delineated by regional partitioning method are able to increase efficiencies and cut costs in performing solid waste collection services. Also the output of vehicle-scheduling from the analysis of arc routing may provide more efficiently and quickly manage the scheduling of the residential solid waste collection routes, reducing costs with minimal deadheading costs. Therefore, the application of GIS based on regional partitioning and arc routing methods would be very useful to construct a solid waste management system by supplying the important and flexible informations for solid waste collection districts and vehicle routing-scheduling for waste collection.

• Journal of the Optical Society of Korea
• /
• v.19 no.1
• /
• pp.29-37
• /
• 2015

The wavefront printer records a volume-reflection hologram as a two-dimensional array of elemental holograms from computer-generated holograms (CGHs) displayed on a spatial light modulator (SLM). The wavefront coming from the object is extracted by filtering in the spatial-frequency domain. This paper presents a method to improve color reproduction in a wavefront printer with spatial division of exposures at primary colors, by adaptive partitioning of the SLM in accordance with the color content encoded in the input CGHs, and by the controllable change of exposure times for the recording of primary colors. The method is verified with a color wavefront printer with demagnification of the object beam. The quality of reconstruction achieved by the proposed method proves its efficiency in eliminating the stripe artifacts that are superimposed on reconstructed images in conventional mosaic recording.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.766-768
• /
• 2003

Selectivity estimation for spatial query is curial in Spatial Database Management Systems(SDBMS). Many works have been performed to estimate accurate selectivity. Although they deal with some problems such as false-count, multi-count arising from properties of spatial dataset, they can not get such effects in little memory space.* Therefore, we need to compress spatial dataset into little memory. In this paper, we propose a new technique called MW Histogram which is able to compress summary data and get reasonable results. Our method is based on two techniques:(a)MinSkew partitioning algorithm which deal with skewed spatial datasets. efficiently (b) Wavelet transformation which compression effect is proven. We evaluate our method via real datasets. The experimental result shows that the MW Histogram has the ability of providing estimates with low relative error and retaining the similar estimates even if memory space is small.

• Journal of KIISE:Databases
• /
• v.27 no.2
• /
• pp.256-268
• /
• 2000

Multi-way spatial join is a nested expression of two or more spatial joins. It costs much to process multi-way spatial join, but there have not still reported the scheme of parallel processing of multi-way spatial join. In this paper, parallel processing of multi-way spatial join consists of parallel multi-way spatial filter and parallel spatial refinement. Parallel spatial refinement is executed by the following two steps. The first is the generation of a graph used for reducing duplication of both spatial objects and spatial operations from pairs candidate object table that are the results of multi-way spatial filter. The second is the parallel spatial refinement using that graph. Refinement using the graph is proved to be more efficient than the others. In task creation for parallel refinement, minimum duplication partitioning of the Spatial_Obicct_On_Node graph shows best performance.

• Spatial Information Research
• /
• v.19 no.2
• /
• pp.47-56
• /
• 2011

Typical tree-based spatial index structures are divided into a data-partitioning index structure such as R-Tree and a space-partitioning index structure such as KD-Tree. In recent years, researches on hybrid index structures combining advantages of these index structures have been performed extensively. However, because the split boundary extension of the node to which a new spatial object is inserted may extend split boundaries of other neighbor nodes in existing researches, overlaps between nodes are increased and the query processing cost is raised. In this paper, we propose a hybrid index structure, called SQR-Tree that can support efficient processing of spatial queries to solve these problems. SQR-Tree is a combination of SQ-Tree(Spatial Quad- Tree) which is an extended Quad-Tree to process non-size spatial objects and R-Tree which actually stores spatial objects associated with each leaf node of SQ-Tree. Because each SQR-Tree node has an MBR containing sub-nodes, the split boundary of a node will be extended independently and overlaps between nodes can be reduced. In addition, a spatial object is inserted into R-Tree in each split data space and SQ-Tree is used to identify each split data space. Since only R-Trees of SQR-Tree in the query area are accessed to process a spatial query, query processing cost can be reduced. Finally, we proved superiority of SQR-Tree through experiments.

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.4
• /
• pp.7-14
• /
• 2003

A number of embedded wavelet image coding methods have been proposed since the introduction of EZW(Embedded Zerotree Wavelet) algorithm. A common characteristic of these methods is that they use fundamental ideas found in the EZW algorithm. Especially, one of these methods is the SPIHT(Set Partitioning in Hierarchy Trees) algorithm, which became very popular since it was able to achieve equal or better performance than EZW without having to use an arithmetic encoder. In this paper We propose a recursive set partitioning in hierarchy trees(RSPIHT) algorithm for embedded image coding and evaluate it's effectiveness experimentally. The proposed RSPIHT algorithm takes the simple and regular form and the worst case time complexity of O(n). From the viewpoint of processing time, the RSPIHT algorithm takes about 16.4% improvement in average than the SPIHT algorithm at T-layer over 4 of experimental images. Also from the viewpoint of coding rate, the RSPIHT algorithm takes similar results at T-layer under 7 but the improved results at other T-layer of experimental images.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.12
• /
• pp.1631-1637
• /
• 2019

In this paper, we propose a low-complexity robust maximum likelihood (ML) receiver for generalized spatial modulation. The proposed receiver performs the transmit antenna partition to lower the computational loads. After we divide the transmit antenna combinations into two parts, one of which is "the likely TAC part," and the other of which is "the unlikely TAC part", based on the minimum mean square error (MMSE) filtering output. We first perform the maximum likelihood detection only in the likely TAC part. Then we evaluate the reliability of the solution found in the first search, and based its reliability we decide whether we continue the search in the unlikely TAC part. This partitioned search strategy maintains the performance of the conventional robust maximum likelihood receiver and simultaneously lowers computational loads. Through simulation, we found that our newly-proposed receiver achieves considerable gains over the conventional robust ML detector in terms of the computational loads while providing almost the same performance.

• Proceedings of the Korean Society of Soil and Groundwater Environment Conference
• /
• 2004.09a
• /
• pp.29-32
• /
• 2004

Gaseous partitioning tracer test has been used for determining the volume and spatial distribution of residual non-aqueous phase liquid (NAPL) in the unsaturated soils. In this study, an experimental method for measuring the content of gas-exposed NAPL as well as that of total NAPL in a sand during air sparging was developed. Two different gaseous phase NAPL-partitioning tracers were used; n-pentane, with very low water solubility, was used as the tracer that partitions into NAPL that is only in contact with the mobile gas, and chloroform, with fairly good water solubility, was selected for detecting total NAPL content in the sand. Helium and difluromethanewere used as the non- reactive tracer and water-partitioning tracers, respectively. Using n-decane as a model NAPL (NAPL saturation of 0.018), 25.6% of total NAPL was detected by n-pentane at the water saturation of 0.68. Oniy 9.1% of total NAPL was detected by n-pentane at the water saturation of 0.84. This result implies that the quantity of gas-exposed NAPL increased about three times when the water saturation decreased from 0.84 to 0.68. At the water saturation of 0.68, more than 90% of total NAPL was detected by chloroform while 65.8% of total NAPL was detected by chloroform at the water saturation of 0.84. Considering that the removal rate of NAPL during air sparging for NAPL-contaminated aquifer is expected to be greatly dependent upon the spatial arrangement of NAPL phase with respect to the mobile gas, this new approach may provide useful information for investigating the mass transfer process during air-driven remedial processes fer NAPL-contaminated subsurface environment.

• Journal of Korea Game Society
• /
• v.8 no.3
• /
• pp.87-95
• /
• 2008

This paper proposes an algorithm for efficient behaviors of boids which freely move and have no predefined position. By finding the kNN and computing the value of behavioral characteristic of a boid approximately, the proposed algorithm improves the conventional spatial partitioning one. To do this, this paper defines and uses the representative boid which has the average direction and position for a group of boids. The proposed algorithm was implemented and compared with the conventional one experimentally. The results of the experimental comparisons show that the proposed algorithm outperforms the conventional one about $-5{\sim}130%$ in terms of the ratio of the number of rendering frames per the second.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.459-462
• /
• 2003

Selectivity estimation of queries not only provides useful information to the query processing optimization but also may give users with a preview of processing results. In this paper, we investigate the problem of selectivity estimation in the context of a spatial dataset. Although several techniques have been proposed in the literature to estimate spatial query result sizes, most of those techniques still have some drawback in the case that a large amount of memory is required to retain accurate selectivity. To eliminate the drawback of estimation techniques in previous works, we propose a new method called MW Histogram. Our method is based on two techniques: (a) MinSkew partitioning algorithm that processes skewed spatial datasets efficiently (b) Wavelet transformation which compression effect is proven. We evaluate our method via real datasets. With the experimental result, we prove that the MW Histogram has the ability of providing estimates with low relative error and retaining the similar estimates even if memory space is small.