• 전기학회논문지
• /
• 제58권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.

• 전기학회논문지
• /
• 제56권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.

• 제어로봇시스템학회논문지
• /
• 제16권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.

• 융합신호처리학회논문지
• /
• 제11권1호
• /
• pp.19-25
• /
• 2010

본 논문에서는 쿼드트리 알고리즘을 이용한 디지털 워터마킹의 성능평가를 수행하였다. 제안한 알고리즘은 웨이블렛 영역에서 퀴드트리 알고리즘을 이용하여 워터마크의 중요계수를 선택하였고, Cox의 알고리즘을 이용하여 워터마크를 삽입하였다. 제안한 알고리즘의 성능 평가를 위한 시뮬레이션은 웨이블렛 영역에서 쿼드트리 알고리즘의 효과, DWT 변환 레벨과 대역(HH, LH, HL)에 따른 워터마킹 효과, 그리고 최저주파수 대역(LL)의 워터마킹 효과에 대하여 수행하였다. 시뮬레이션 결과에서 퀴드트리 알고리즘을 이용한 워터마킹은 고정된 대역의 중요계수에 워터마크를 삽입한 방법과 비교하여 향상된 결과를 보였고, 6 레벨 DWT에서 HH, HL LH 대역에 동시에 워터마크를 삽입하였을 경우에 가장 좋은 결과를 보였다. 또한, 전체 워터마크 중 30~60%를 LL 대역에 삽입하였을 경우에 PSNR 성능은 1~3dB 정도 떨어지나 추출한 워터마크의 상관도 값은 향상된 결과를 보였다.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제52권10호
• /
• pp.591-597
• /
• 2003

In this paper, a best-basis selection algorithm that improves the performance of the coding gains and the computational complexity is proposed. The proposed algorithm limits the computational complexity according to the resolved threshold value and decomposes the parent subbands by using the top-down tree search and the relative energy between the parent subbands and the child subbands. For the experiments of the proposed algorithm, the bit-rates, the peak signal-to-noise ratio (PSNR), and the reconstructed images are presented by using the Quad-tree coder. The result of the proposed algorithm is compared to that of DWT algorithm using the Quad-tree coder for a set of standard test images. In addition, the result of the proposed algorithm is compared to that of JPEG-2000 algorithm and that of S+P algorithm.

• 대한전자공학회논문지
• /
• 제25권8호
• /
• pp.998-1009
• /
• 1988

A Hierarchical Circuit Extract Algotithm, which efficiently extract circuits from VLSI mask pattern information, is programmed. Quad-tree is used as a data structure which includes various CIF circuit elements and instances. This system is composed of CIF input routine, Quad-tree making routine, Transistor finding routine and Connection list making routine. This circuit extractor can extract circuit with hierarchical structure of circuit. This system is designed using YACC and LEX. By programming this algorithm with C language and adopting to various circuits, the effectiveness of this algorithm is showed.

• 융합신호처리학회논문지
• /
• 제2권1호
• /
• pp.63-70
• /
• 2001

EZW(Embedded Image Coding Using Zerotrees of Wavelet Coefficients) 알고리즘의 경우는 해상도를 높이기 위해 임계값을 낮출 때 중요계수의 위치를 나타내기 위해 필요 없는 zero 값을 많이 코딩을 해야 하는 문제가 있다. 본 논문에서는 이러한 문제점을 해결하기 위하여 쿼드 트리(quad tree)방법을 이용하여 위치정보를 나나내었다. 그리고 그 계수들의 크기는 EZW 에서 사용한 방법과 유사한 메트릭스(matrix) 방법을 사용하였다. 본 논문에서 제안한 알고리즘으로 영상을 압축하게 되면 EZW와 MRWD(Morphological Representation of Wavelet Data)의 방법을 동시에 이용하는 효과가 있어 압축 효율이 증가함을 알 수 있었다.

• 융합신호처리학회논문지
• /
• 제11권4호
• /
• pp.310-319
• /
• 2010

본 논문에서는 웨이브렛 변환과 쿼드트리 알고리즘을 이용한 디지털 워터마킹 알고리즘을 제안하였다. 제안한 알고리즘은 웨이블렛 변환과 웨이블렛 패킷 변환을 이용하여 입력영상을 변환하고, 쿼드트리와 Cox 알고리즘을 이용하여 워터마크를 삽입하였다. 제안한 알고리즘의 성능 평가를 위한 시뮬레이션은 DWT 변환 레벨과 대역(HH, LH, HL)에 따른 워터마킹 효과와 AWPT 변환 레벨에 따른 워터마킹의 효과에 대하여 수행하였고, DWT를 이용한 결과와 AWPT를 이용한 결과를 비교하였다. 또한 최저주파수대역(LL)의 워터마킹의 효과에 대하여 알아보았다. 시뮬레이션 결과에서 6 레벨 DWT의 HH, HL, LH 대역에 동시에 워터마크를 삽입하였을 경우에 다른 경우들과 비교하여 가장 좋은 결과를 보였다. 3 레벨의 AWPT의 결과는 3레벨의 DWT 결과와 비교하여 향상된 상관도 값을 보였다. 또한 전체 워터마크 중 30~60%를 LL 대역에 삽입하였을 경우에 PSNR 성능은 1~2dB 정도 떨어지나 추출한 워터마크의 상관도 값은 향상된 결과를 보였다.

• 대한전자공학회논문지
• /
• 제25권1호
• /
• pp.101-107
• /
• 1988

This paper proposes a circuit extractor which extracts a netlist from the CIF input file cntaining the layout mask artwork informations. The circuit extractor extracts transistors and their interconnections, and calculates circuit parameter such as parasitic resistance and parasitic capacitance from the mask informations. When calculating the parasitic resistance, we consider the current flow path to reduce the errors caused by the resistance approximation. Similarly, we consider the coupling capacitance which has an effect on the circuit characteristics, when the parasitic capacitances are calculated. Therefore, using these parameter values as an input to circuit simulation, the circuit characteristics such as delay time can be estimated accurately. The presented circuit extraction algorithm uses a multiple storage quad tree as a data sturucture for storing and searching the 2-dimensional geometric data of mask artwork. Also, the proposed algorithm is technologically independent to work across a wide range of MOS technologies without any change in the algorihm.

• 한국컴퓨터정보학회논문지
• /
• 제22권12호
• /
• pp.69-77
• /
• 2017

This paper represents a novel framework for multi-scale image fusion. Multi-scale Kalman Smoothing (MKS) algorithm with quad-tree structure can provide a powerful multi-resolution image fusion scheme by employing Markov property. In general, such approach provides outstanding image fusion performance in terms of accuracy and efficiency, however, quad-tree based method is often limited to be applied in certain applications due to its stair-like covariance structure, resulting in unrealistic blocky artifacts at the fusion result where finest scale data are void or missed. To mitigate this structural artifact, in this paper, a new scheme of multi-scale fusion framework is proposed. By employing Super Resolution (SR) technique on MKS algorithm, fine resolved measurement is generated and blended through the tree structure such that missed detail information at data missing region in fine scale image is properly inferred and the blocky artifact can be successfully suppressed at fusion result. Simulation results show that the proposed method provides significantly improved fusion results in the senses of both Root Mean Square Error (RMSE) performance and visual improvement over conventional MKS algorithm.