• Spatial Information Research
• /
• v.19 no.4
• /
• pp.45-54
• /
• 2011

In this paper, we propose a hybrid index structure, called the SQMR-tree(Spatial Quad MR-tree) that can process spatial data efficiently by combining advantages of the MR-tree and the SQR-tree. The MR-tree is an extended R-tree using a mapping tree to access directly to leaf nodes of the R-tree and the SQR-tree is a combination of the SQ-tree(Spatial Quad-tree) which is an extended Quad-tree to process spatial objects with non-zero area and the R-tree which actually stores spatial objects and are associated with each leaf node of the SQ-tree. The SQMR-tree consists of the SQR-tree as the base structure and the mapping trees associated with each R-tree of the SQR-tree. Therefore, because spatial objects are distributedly inserted into several R-trees and only R-trees intersected with the query area are accessed to process spatial queries like the SQR-tree, the query processing cost of the SQMR-tree can be reduced. Moreover, the search performance of the SQMR-tree is improved by using the mapping trees to access directly to leaf nodes of the R-tree without tree traversal like the MR-tree. Finally, we proved superiority of the SQMR-tree through experiments.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.6
• /
• pp.698-704
• /
• 2011

This study aims to facilitate and increase the performance of the Traffic Analysis System which receives the location information of vessels sailing along the coast all over the country in real time and analyzes the vessels' sailing situation. Especially, the research has a signification that the system is designed with the application of Quad-Tree and R-Tree data structure in order for system users to search necessary information quickly and effectively, and it verifies the improvement of the performance by showing experiment results comparing the existing Traffic Analysis System to newly upgraded Traffic Analysis System.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1996.10a
• /
• pp.61-65
• /
• 1996

본 논문은, 공간영역에서 화상을 압축할 수 있는 Quad-tree 부호화법을 분석하고, 보다 화질 및 압축율을 개선하기 위하여 적응 불록분할 및 병합 알고리듭을 제안하엿다. 화상은 에지부분을 제외하고는 인접한 화소들간에 데이터의 용장도가 높으므로 이 영역을 하나의 대표값으로 설정하여 그 값과 그 블록의 위치좌표를 부호화할 수 있다. Quad-tree 분할은 초기의 병합을 제외하고 순차적으로 분할과정만 반복처리하지만 본 알고리듬에서는 단위블록(3$\times$3 호소) 의 평균잘류에너지(MRE)를 이용하여 블록의 분할과 병합을 반복처리한다. 시뮬레이션결과, 본 알고리듭은 압축율 1bit/pixel에서 기존의 Quad-tree 방법보다 PSNR에서 1.0dB의 개선이 있었으며, 화상의 블록화 현상도 전혀 나타나지 않았다.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.11
• /
• pp.2292-2298
• /
• 2009

In this paper, the lossy image compression algorithm using the quad tree and the bandlets is proposed. The proposed algorithm transforms input images by the discrete wavelet transform (DWT) and represents the geometrical structures of high frequency bands using the bandlets with a 8 block- size. In addition, the proposed algorithm searches the position information of the significant coefficients by using the quad tree algorithm and computes the magnitude and the sign information of the significant coefficients by using the Embedded Image Coding using Zerotrees of Wavelet Coefficients (EZW) algorithm. The compression result by using the quad tree algorithm improves the PSNR performance of high frequency images up to 1 dB, compared to that of JPEG-2000 algorithm and that of S+P algorithm. The PSNR performance by using DWT and bandlets improves up to 7.5dB, compared to that by using only DWT.

• Journal of the Semiconductor & Display Technology
• /
• v.8 no.1
• /
• pp.43-48
• /
• 2009

We have examined the problem of the number of quad-tree blocks that an n-dimensional rectangle will be decomposed into on the average. the contribution of this paper are both practical and theoretical. In this paper, we develops the overlapping multi-scale models and the region quad-tree models which is useful in computer graphics animation, image processing, pattern recognition and also for modeling three dimensional objects. These models, which represent something of a conceptual departure from other models developed for multi-scale framework were developed with the specific interest of producing smooth estimates.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.1
• /
• pp.48-52
• /
• 2010

In this paper, we introduce a new path planning algorithm which combines the merits of a visibility graph algorithm and an adaptive cell decomposition. We quantize a given map with empty cells, blocked cells, and mixed cells, then find the optimal path on the quantized map using a visibility graph algorithm. For reducing the number of the quantized cells we use the quad-tree technique which is used in an adaptive cell decomposition, and for improving the performance of the visibility checking in making a visibility graph we propose a new visibility checking method which uses the property of the quad-tree instead of the well-known rotational sweep-line algorithm. For the more efficient visibility checking, we propose two additional improvements for our suggested method. Both of them are used for reducing the visited cells in the quad-tree. The experiments for a performance comparison of our algorithm with other well-known algorithms show that our proposed method is superior to others.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1996.06a
• /
• pp.139-142
• /
• 1996

움직임 보상형 프레임간 내삽기법은 다른 동영상 압축기법과 함께 사용함으로써, 그 압축효과를 더욱 향상시킬 수 있는 장점을 가지고 있다. 그러나 블록에 기반한 기존의 움직임 보상형 프레임간 내삽기법을 움직이는 물체의 경계에서 심한 블록효과를 보인다. 본 논문에서는 Quad-tree 기법을 이용해 화소단위의 움직임을 추정하고, 이를 이용해 드러난 영역과 가리워지는 영역을 정확 히 예측해 보상함으로써 움직이는 물체의 경계에서 나타나는 블럭효과를 제거했다. 그리고 제안된 방법에서는 순방향이나 역방향 움직임추정 시 송신측으로 부터 보내지는 움직임 벡터를 이용함으로써 움직임 추정을 위해 소요되는 계산량을 최소화하였다.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.11
• /
• pp.2027-2032
• /
• 2007

In this paper, digital watermarking method using quad-tree algorithm and the lowest frequency band is proposed. The proposed algorithm searches the coefficient of the watermark by using quad-tree algorithm and inserts the watermark by the Cox's algorithm. The simulation of the proposed algorithm is implemented about the effect of various weight factors in Cox's algorithm, that of embedding watermark in each subband coefficient (HH, LH, HL), and that of embedding in the lowest frequency band (LL). As a simulation result, the bigger weight factors in Cox's algorithm show strong to noise. The watermarking performance of simultaneously embedding in HH, LH, and HL band is better than that of different cases. In addition, insertion the watermark to the LL band about $30{\sim}60%$ of all watermarks improves the watermarking performance in comparison with the case of not using the LL band.

• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.1
• /
• pp.63-70
• /
• 2001

EZW(Embedded coding using Zero-trees of Wavelet coefficients) decreases symbol-position information using zero-trees, but threshold value fall lot raising resolution, then coding cost of significant coefficients is expensive. To avoide this fact, this paper uses quad-tree representing coefficient-position information. a magnitude of significant coefficient is represented on matrix used at EZW. the proposed algorithm is hoped for raising a coding cost.

• Journal of the Institute of Convergence Signal Processing
• /
• v.11 no.1
• /
• pp.19-25
• /
• 2010

In this paper, digital watermarking method using quad-tree algorithm is proposed. The proposed algorithm searches the significant coefficient of the watermark by using quad-tree algorithm and inserts the watermark by the Cox's algorithm. The simulation for performance analysis of the proposed algorithm is implemented about the effect of quad-tree algorithm in wavelet domain and that of embedding watermark in each subband coefficient (HH, LH, HL) and each DWT level, and that of embedding in the lowest frequency band (LL). As a simulation result, digital watermarking using quad-tree algorithm improves the watermarking performance in comparison with inserting watermark in the significant coefficients of fixed frequency band. The watermarking performance of simultaneously embedding in HH, LH, and HL band of DWT(6 level) is better than that of different cases. In addition, insertion the watermark to the LL band about 30~60% of all watermarks improves the correlation value while PSNR performance decreases 1~3dB.