• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.1911-1914
• /
• 2003

This paper proposes efficient system for multiview images using backward quadtree disparity estimation. Previous quadtree method usually divides current image. In this work, backward quadtree divides reference image. So, it does not need to code quadtree data. For backward quadtree, quadtree information map is generated. By using this map, adaptive dividing is possible. And, conventional bi-directional matching method is used with backward quadtree. These methods increase subject and object quality of decoded test images. For multiview images, panorama synthesizing method was used. Panorama image and right-most image are used for reference image for intermediate view images coding.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.37 no.7
• /
• pp.498-509
• /
• 1988

A BF(breadth-first) linear quadtree as a new data structure for image data is suggested, which enables us to compress the image data efficiently and to make operations of the compressed data easily. It is a list of path names for black nodes as the linear quadtree is. The path name for each black node of a BF linear quadtree is represented as a sequence of path codes from the root node to itself, whereas that of linear quadtree as a sequence of path codes from the root node to itself and fill characters for cut-offed path from it to any n-level node which corresponds to a pixel of an image. The BF linear quadtree provides a more efficent compression ratio than the linear quadtree does, because the former does not require redundant characters, fill characters, for the cut-offed paths. Several operations for image processing can be also implemented on this hierarchical structure efficiently, because it is composed of only the black nodes ad the linear quadtree is . In this paper, algorithms for several operations on the BF linear quadtree are defined and analyzed. Experimental results for forur image data are also given and discussed.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10b
• /
• pp.362-364
• /
• 1999

본 논문에서는 Quadtree 구조를 기반으로 한 효율적인 색상 정보 추출과 영상 검색을 수행하는 시스템을 구현한다. 제시한 시스템은 원 영상으로부터 DC영상을 추출하고, DC 영상의 화소들을 RGB에서 HSV의 색상 좌표계로 변환한다. 변환된 영상에서 색상의 분포에 따라 Quadtree 형태로 영역을 분할하고 대표 색상을 추출한다. 마지막으로 추출한 색상과 그 색상의 분포에 따라 Quadtree 형태로 영역을 분할하고 대표 색상을 추출한다. 마지막으로 추출한 색상과 그 색상의 분포값을 영역의 위치에 따라 Quadtree의 단말 노드에 저장한다. 그리고, 사용자가 질의 영상을 주었을 때 Quadtree에 저장된 정보를 이용하여 본 논문에서 제안한 유사도 측정을 통하여 결과 영상을 보여준다. 본 논문에서 제안한 방법으로 실험한 결과 64개의 영역으로 나눈 방법에 비해 비교하는 평균 영역의 개수는 28.9개였고, 검색시간은 2~6초 정도 감소하였다. 또한, 전체 영상의 색상 정보 저장량도 25% 정도 줄어들었지만 질의에 대한 두 방법의 검색 결과는 유사하게 나타났다.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.873-876
• /
• 2003

Z-map model is the most widely used model for NC simulation and verification. But it has several limitations to get a high precision, to apply 5 axis machining simulation. In this paper, we tried to use quadtree for searching cutting region. Quadtree representation of two dimensional objects is performed with a tree that describes the recursive subdivision. By using these quadtree model. storage requirements were reduced. And also, recursive subdivision was processed in the boundries, so, useless computation could be reduced, too. To get more high Accuracy, we applied the supersampling method in the boundaries. The Supersampling method is the most common form of the antialiasing and usually used with polygon mesh rendering in computer graphics To verify quadtree model we compared simulated results with z-map model and enhanced z-map model

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.129-132
• /
• 2001

영역 기반의 영상 압축 방법으로 quadtree 분할 압축 방법이 있다[1][2]. 이 방법은 낮은 bpp환경의 손실 압축에서 우수한 압축성능을 나타내지만 무손실이나 혹은 손실이 거의 없는 그레이 영상 압축에는 적당하지 않다. 본 논문에서는 quadtree 분할 압축을 예측자 및 F함수와 함께 사용하여 무손실이면서 우수한 압축성능을 가지는 무손실 압축 방법을 제안한다.

• Journal of Korea Water Resources Association
• /
• v.36 no.4
• /
• pp.705-713
• /
• 2003

To investigate the run-up heights of nearshore tsunamis in the vicinity of a circular island, a numerical model has been developed based on quadtree grids. The governing equations of the model are the nonlinear shallow-water equations. The governing equations are discretized explicitly by using a finite difference leap-frog scheme on adaptive hierarchical quadtree grids. The quadtree grids are generated around a circular island where refined with rectangular or circular domain. Obtained numerical results have been verified by comparing to available laboratory measurements. A good agreement has been achieved.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.8
• /
• pp.1031-1036
• /
• 1999

A Hierarchical vector Quantization scheme is implemented and an optimal thresholding technique of quadtree segmentation for performing high quality low bit rate image compression is proposes. A mathematical model is constructed under the assumption that the standard deviations of sub-blocks are larger than or equal to the standard deviation of the upper level block which is generated by merging of sub-blocks. This thresholding technique based on the mathematical modeling allows producing about 1 dB improved performance in terms of PSNR at most ranges of bit rates over the quadtree coder, which is based on MSE for quadtree segmentation.

• Journal of Korean Society for Geospatial Information Science
• /
• v.19 no.3
• /
• pp.41-47
• /
• 2011

Processing of the raw LiDAR data requires the high-end processor, because data form is a vector. In contrast, if LiDAR data is converted into a regular grid pattern by filltering, that has advantage of being in a low-cost equipment, because of the simple structure and faster processing speed. Especially, by using grid data classification, such as Quadtree, some of trees and cars are removed, so it has advantage of modeling. Therefore, this study presents the algorithm for automatic extraction of ground points using Quadtree and refion growing method from LiDAR data. In addition, Error analysis was performed based on the 1:5000 digital map of sample area to analyze the classification of ground points. In a result, the ground classification accuracy is over 98%. So it has the advantage of extracting the ground points. In addition, non-ground points, such as cars and tree, are effectively removed as using Quadtree and region growing method.

• ETRI Journal
• /
• v.11 no.1
• /
• pp.109-122
• /
• 1989

We developed new quadtree and octree representation schemes which reduce the storage requirements from exponential to polynomial. The new schemes not only lessen the large storage requirements of the existing quadtree and octree representation schemes but guarantee an exact representation of the original object. These are made possible by adopting a new set of termination conditions that ensure finiteness of the quadtree and octree during the decomposition. These new data structures are analyzed theoretically and tested empirically. For space complexity, we analyzed its best case, worst case, and average case. Given an $n_e$-gon, we show that the expected number of nodes in our quadtree isO($$$n_e^1.292$) For a polyhedron with $n_f$ faces, the expected number of nodes in the new octree is O($$$n_f^1.667$). For time complexity, we again analyzed the best, worst, and average cases for constructing such quadtree and octree and find the average to be the same as those of the space complexity. Finally, random $n_e$- gons are generated as test data. Regression equations are fitted and are shown to support the claims on the average case performance.

• Proceedings of the KIEE Conference
• /
• 1991.11a
• /
• pp.201-204
• /
• 1991

In this paper the method of representing the document image by the quadtree data structure, and extracting each character seperately from the constructed quadtree are described. The document image is represented by a binary encoded quadtree and the segmentation is performed according to the information of each leaf node of the quadtree. Then, each character is extracted by the relation of positions of segments. This method enables to extract characters without examining every pixel in the image and the required storage of document image is decreased.