• 한국공간정보시스템학회:학술대회논문집
• /
• 2004.12a
• /
• pp.69-74
• /
• 2004

Selectivity estimation for spatial query is very important process in finding the most efficient execution plan. Many works have been performed to estimate accurately selectivity. Although they deal with some problems such as false-count, multi-count, they require a large amount of memory to retain accurate selectivity, so they can not get good results in little memory environments such as mobile-based small database. In order to solve this problem, we propose a new technique called MW histogram which is able to compress summary data and get reasonable results. It also has a flexible structure to react dynamic update. The experimental results showed that the MW histogram has lower relative error than MinSkew histogram and gets a good selectivity in little memory.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.55-56
• /
• 2006

Directional antennas are used to improve spatial reuse, but have the problem of deafness. The DUDMAC protocol uses the ORTS, OCTS, DDATA, and DACK mechanisms and a blocking algorithm for directional transmissions. In this paper, we propose a tone dual-channel directional MAC (Tone DUDMAC) protocol to improve spatial reuse. The Tone DUDMAC protocol uses the ORTS, DCTS, DDATA, and DACK mechanisms including the DDATA_tone and OCTS_tone. We use ORTS as that in DUDMAC because of location unawareness of neighbor's nodes. The DDATA_tone and OCTS_tone reduce a blocking area and improve spatial reuse. We confirm the throughput performance of the proposed MAC protocol by computer simulations using Qualnet ver.3.8 simulator.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.57-58
• /
• 2006

Ad hoc MAC protocols using directional antennas can be used to improve the network capacity by improving spatial reuse. But, the directional MAC protocols have the problem of deafness and have a poor throughput performance. The dual-channel DMAC protocol has been proposed to mitigate deafness and improve spatial reuse. In this paper, we propose a dual-channel DMAC protocol using the omnidirectional antenna for an out-of-band tone and directional antennas for control/data channels. In the proposed MAC protocol, an omnidirectional out-of-band tone mitigates deafness and directional antennas used in control/data channels improve spatial reuse and reduce interference packets. The throughput performance of the proposed MAC protocol is confirmed by computer simulations using Qualnet ver. 3.8 simulator.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.3
• /
• pp.63-73
• /
• 1997

For the practical applications of the EIT technology, it is essential to reconstruct sttic images iwth a higher spatial resolution in a reasonalble amount of processing time. Using the conventional EIT static image reconstruction algorithms, however, the processing time increases exponential with poor convergence characteristics as we try to get a higher spatial resolution. In order to overcome this problem, we developed a recursive mesh grouping method based on the Fuzzy-GA like algorithm. Computational simulation using the well-known improve dewton-raphson method with the proposed recursive mesh grouping algorithm shows a promising result that we can significantly reduce the processing time in the reconstruction of EIT static images of a higher spatial resolution.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.374-377
• /
• 2004

Existing Clustering Methods for spatial data mining process only point objects, not objects with polygonometry such as lines and areas. It is because that distance computation between objects with polygonomery for clustering is more complex than point objects. To solve this problem, we design a clustering method based on regular grid cell structures. In details, it refutes cost and time for distance computation using cell relationships in grid cell structures.

• Journal of Electrical Engineering and Technology
• /
• v.11 no.4
• /
• pp.1020-1026
• /
• 2016

Motion estimation (ME) algorithms supporting quarter-pixel accuracy have been recently introduced to retain detailed motion information for high quality of video in the state-of-the-art video compression standard of H.264/AVC. Conventional sub-pixel ME algorithms in the spatial domain are faced with a common problem of computational complexity because of embedded interpolation schemes. This paper proposes a low-complexity sub-pixel motion estimation algorithm in the transform domain utilizing shifting matrix. Simulations are performed to compare the performances of spatial-domain ME algorithms and transform-domain ME algorithms in terms of peak signal-to-noise ratio (PSNR) and the number of bits per frame. Simulation results confirm that the transform-domain approach not only improves the video quality and the compression efficiency, but also remarkably alleviates the computational complexity, compared to the spatial-domain approach.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.5063-5073
• /
• 2016

In this paper, an efficient texture compression method is proposed for fast rendering, which exploits the spatial correlation among blocks through intra-picture block matching. Texture mapping is widely used to enhance the visual quality of results in real-time rendering applications. For fast texture mapping, it is necessary to identify an effective trade-off between compression efficiency and computational complexity. The conventional compression methods utilized for image processing (e.g., JPEG) provide high compression efficiency while resulting in high complexity. Thus, low complexity methods, such as ETC1, are often used in real-time rendering applications. Although these methods can achieve low complexity, the compression efficiency is still lower than that of JPEG. To solve this problem, we propose a texture compression method by reducing the spatial redundancy between blocks in order to achieve the better compression performance than ETC1 while maintaining complexity that is lower than that of JPEG. Experimental results show that the proposed method achieves better compression efficiency than ETC1, and the decoding time is significantly reduced compared to JPEG while similar to ETC1.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.10-12
• /
• 2004

Nowadays, with the rapid emergence of XML as a standard for data exchange over the Internet had led to considerable interest In the problem of data management requirements such as the need to store and query XML documents in which the location path languages Xpath is of particular important for XML application since it is a core component of many XML processing standards such as XSLT or XQuery, This parer gives a brief overview about method and design by applying a new spatial-based indexing method namely Xp-free that used for supporting Xpath. Spatial indexing technique has been proved its capacity on searching in large databases. Based on accelerating a node using planar as combined with the numbering schema, we devise efficiently derivative algorithms, which are simple, but useful. Besides that, it also allows to trace all Its relative nodes of context node In a manner supporting queries natural to the types especially Xpath queries with predicates.

• Communications for Statistical Applications and Methods
• /
• v.28 no.4
• /
• pp.315-327
• /
• 2021

The Spatial Autoregressive (SAR) models have drawn considerable attention in recent econometrics literature because of their capability to model the spatial spill overs in a feasible way. While considering the Bayesian analysis of these models, one may face the problem of lack of robustness with respect to underlying prior assumptions. The generalized Bayes estimators provide a viable alternative to incorporate prior belief and are more robust with respect to underlying prior assumptions. The present paper considers the SAR model with a set of linear restrictions binding the regression coefficients and derives restricted generalized Bayes estimator for the coefficients vector. The minimaxity of the restricted generalized Bayes estimator has been established. Using a simulation study, it has been demonstrated that the estimator dominates the restricted least squares as well as restricted Stein rule estimators.

• Spatial Information Research
• /
• v.19 no.5
• /
• pp.63-74
• /
• 2011

Recently, there has been much interest in the spatial query which energy-efficiently acquires sensor readings from sensor nodes inside specified geographical area of interests. The centralized approach which performs the spatial query at a server after acquiring all sensor readings, though simple, it incurs high wireless transmission cost in accessing all sensor nodes. In order to remove the high wireless transmission cost, various in-network spatial indexing schemes have been proposed. They have focused on reducing the transmission cost by performing distributed spatial filtering on sensor nodes. However, these in-network spatial indexing schemes have a problem which cannot optimize both the spatial filtering and the wireless routing among sensor nodes, because these schemes have been developed by simply applying the existing spatial indexing schemes into the in-network environment. Therefore, we propose a new distributed spatial indexing scheme of the GR-tree. The GR-tree which form s a MBR-based tree structure, can reduce the wireless transmission cost by optimizing both the efficient spatial filtering and the wireless routing. Finally, we compare the existing spatial indexing scheme through extensive experiments and clarify our approach's distinguished features.