• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1994.06a
• /
• pp.298-302
• /
• 1994

• Journal of KIISE
• /
• v.42 no.3
• /
• pp.390-398
• /
• 2015

Spatial web objects refer to web documents that contain geographic information. Recently, services that create spatial web objects have increased greatly because of the advancements in devices such as smartphones. For services such as Twitter or Facebook, simple texts posted by users is stored along with information about the post's location. To search for such spatial web objects, a method that uses spatial information and text information simultaneously is required. Conventional spatial web object search methods mostly use R-tree and inverted file methods. However, these methods have a disadvantage of requiring a large volume of space when building indices. Furthermore, such methods are efficient for searching with many keywords but are inefficient for searching with a few keywords.. In this paper, we propose a spatial web object search method that uses a quad-tree and a patricia-trie. We show that the proposed technique is more effective than existing ones in searching with a small number of keywords. Furthermore, we show through an experiment that the space required by the proposed technique is much smaller than that required by existing ones.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.13 no.5
• /
• pp.390-399
• /
• 1988

A conventional BTC has the merit of real time processing and simple computation, but has the problem that its compression rate is low. In this paper, a modified BTC using the Quad Tree which is frequently used in binary image is proposed. The method results in the low compression rate by decreasing the total number of subblocks by mean of making the size of a subblock large in the small variation area of graty level and the size af a subblock small in the large variation area of gary level. For the effective transmission of bit plane, the Huffman run-lengh code for the large size of a subblock and the lookup table for tha small size of a subblock are used. The proposed BTC method show the result of coding 256 level image at the average data rate of about 0.8 bit/pixel.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.1
• /
• pp.15-28
• /
• 2008

In ubiquitous sensor networks(USN) environment, it is essential to process region query for user-demand services. Using R-tree is a preferred technique to process region query for in-network query environment. In USN environment, USN middleware must select sensors that transfers region query with accuracy because the lifetime of sensors is that of whole sensor networks. When R-tree is used, however, it blindly passes the region query including non-existent sensors where MBR(Minimum Boundary Rectangle) of R-tree is Intersected by region of query. To solve in this problem, we propose a reconstruction of region query method which is a trie-structured Quad tree in the base station that includes sensors in region of query select with accuracy. We observed that the proposed method delays response time than R-tree, but is useful for reducing communication cost and energy consumption.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.199-202
• /
• 2001

In this paper, we proposed and analyzed a new class of irregular fault-tolerant multistage interconnection network named as Extended-QT(Quad Tree) network. E-QT network is extended QT network. A unique path MIN usually is low hardware complexity and control algorithm. So we proposes a class of multipath MIN which are obtained by adding self-loop auxiliary links at the a1l stages in QT(Quad Tree) networks so that they can provide more paths between each source-destination pair. The routing of proposed structure is adaptived and is based by a routing tag. Starting with the routing tag for the minimum path between a given source-destination pair, routing algorithm uses a set of rules to select switches and modify routing tag. Trying the self-loop auxiliary link when both of the output links are unavailable. If the trying is failure, the packet discard. In simulation, an index of performance called reliability and cost are introduced to compare different kinds of MINs. As a result, the prouosed MINs have better capacity than 07 networks.

• Journal of Electrical Engineering and Technology
• /
• v.4 no.4
• /
• pp.552-558
• /
• 2009

We proposed a semi-blind digital image watermarking technique for copyright protection. The proposed algorithm embedded a binary sequence watermark into significant wavelet coefficients by using a quantization method. The main idea of the quantization method was to quantize a middle coefficient of the triplet of a significant wavelet coefficient according to the watermark's value. Unlike an existing algorithm, which used a random location table to find a coefficient in which the watermark bit will be embedded: the proposed algorithm used quad-tree decomposition to find a significant wavelet coefficient for embedding. For watermark detection, an original host image was not required. Thanks to the usage of significant wavelet coefficients, the proposed algorithm improved the correlation value, up to 0.43, in comparison with the existing algorithm.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.5
• /
• pp.1023-1029
• /
• 2011

In the industrial vision systems, image correction has great influence on the overall performance of measurement or inspection. The overall area of distorted image is usually splitted into small control areas, and each area is corrected by its control points. The performance of correction methods using control points can be improved by reduction of control areas because the computational time and memory highly depend on the number of control areas. We develop a merging algorithm that reduces control areas and preserves the correction accuracy. The algorithm merges the splitted control areas by use of quad tree method. Experimental results are presented to verify the usefulness of the proposed method.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11a
• /
• pp.351-354
• /
• 2003

이미지 압축에서 레인지 블록들을 분할하는 것은 매우 중요한 문제이다. 본 논문에서는 프랙탈 이미지 압축기법에서 사용하는 분할-합병 기법을 동영상의 압축에 적용하였다. Quad-tree 방식은 top-down 방식으로 유사한 도메인 블록을 찾지 못하였을 경우 그 레인지를 4 등분하여 각각의 도메인 블록을 찾는 방식이다. 분할-합병 기법은 bottom-up 방식으로 Quad-tree 방식과 달리 주어진 크기의 원자 블록(atomic block)들을 도메인과의 유사성에 따라 연결함으로써 레인지를 불규칙적인 형태로 합병할 수 있다. 이 방식을 이용하여 동영상에서의 화질과 압축률의 개선을 기대할 수 있다.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.8
• /
• pp.772-777
• /
• 2009

The geometric distortion of image is one of the most important parameters that take effect on the accuracy of optical inspection systems. We propose a new correction method of the image distortion to increase the accuracy of PCB inspection systems. The model-free method is applied to correct the randomly distorted image that cannot be represented by mathematical model. To reduce the correction time of inspection system, we newly propose a grid reduction algorithm that minimize the number of grids by the quad-tree approach. We apply the proposed method to a PCB inspection system, and verify its usefulness through experiments using actual inspection images.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.11
• /
• pp.2768-2775
• /
• 1996

VariableBlock Matching algorithm is effective for the estimation of motion vector at complexor edge region by means of using variable block size with respect to the image block. But since VBM algorithm requires considerable number of operations, to solve this problem, we present an algorithm which uses difference images and quad tree structure, and estimates motion using various fast block matching algorithms.