• Title/Summary/Keyword: Fractal Tree

Search Result 34, Processing Time 0.024 seconds

Real-time fractal coding implementation using the PC (PC를 이용한 실시간 프랙탈 부호화 구현)

  • 김재철;박종식
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.11
    • /
    • pp.2789-2800
    • /
    • 1996
  • Real time fractal coding for successive QCIF 144*176 luminance images has been implemented on a 50MHz IBM 486 personal computer. To satisfy the frame encoding speed and data compression ratio, following algorithms are adopted. In order to minimize encoding time, extension SAS being not searching of domain blocks is used. for reducing the bits per pixel, conventioal 4*4 range block is extended to 8*8 range block. and range block extension decrease quality of decoded image. For improvement quality of decoded image, the paper apply quad-tree partition mothod. In order to divide **8 range block, self-simiarity is compared 8*8 range block with spatial contractive transformed 8*8 domain block. According to self-simiarity, the block is partitioned and owing to block partition, increased encoding time is minimized. According to self-simiarity of 8*8 range block and spatial contractive transformed 8*8 domain block, number of fractal factor is varied. Simultaneously with minimizing the decrement of decoded image's quality, transmittion rate and encoding time is shorted. The results enable us to process the real-time fractal coding. For the claire test image, the average PSNR was 32.4dB, 0.12 bit rates and 33ms coding time per frame.

  • PDF

A Tree Morphing Animation Using Fractal Theory (프랙탈을 이용한 나무 모핑 애니메이션)

  • 송행숙
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1999.10b
    • /
    • pp.622-624
    • /
    • 1999
  • 모핑 애니메이션은 컴퓨터 그래픽스 및 많은 응용에서 이용되고 있다. 모핑 애니메이션에서는 대부분 이미지들을 동영상 편집기 등을 이용하므로 많은 저장 공간을 필요로 한다. 본 논문에서는 이를 해결하는 한 방법으로 프랙탈 기법을 사용한다. 예를 보이기 위해 두 개의 나무 모핑 애니메이션을 보인다.

  • PDF

Miniaturization of Log-Periodic Dipole Array Antenna for PS-LTE Service (재난안전 통신망 서비스를 위한 대수 주기 다이폴 배열 안테나의 소형화)

  • Jeon, Hoo-Dong;Heo, Soo-Young;Ko, Ji-Hwan
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.28 no.3
    • /
    • pp.170-176
    • /
    • 2017
  • In this paper, we proposed the miniaturized structure of the Log-Periodic Dipole Array(LPDA) antenna for PS-LTE(Pubic Safety-Long Term Evolution) service. The length of array dipole was shortened by adding a fractal tree element with iteration to the array dipole to miniaturize the LPDA antenna. As the result, the proposed LPDA antenna was reduced up to 25 %, compared a typical LPDA antenna. To validation of the proposed LPDA antenna specification, the proposed LPDA antenna is fabricated using aluminum with 1.5 mm thickness and performances are measured. Comparison between simulation result and experiment shows good agreement.

ESTIMATING CROWN PARAMETERS FROM SPACEBORNE HIGH RESOLUTION IMAGERY

  • Kim, Choen;Hong, Sung-Hoo
    • Proceedings of the KSRS Conference
    • /
    • 2007.10a
    • /
    • pp.247-249
    • /
    • 2007
  • Crown parameters are important roles in tree species identification, because the canopy is the aggregate of all the crowns. However, crown measurements with spaceborne image data have remained more difficult than on aerial photographs since trees show more structural detail at higher resolutions. This recognized problem led to the initiation of the research to determine if high resolution satellite image data could be used to identify and classify single tree species. In this paper, shape parameters derived from pixel-based crown area measurements and texture features derived from GLCM parameters in QuickBird image were tested and compared for individual tree species identification. As expected, initial studies have shown that the crown parameters and the canopy texture parameters provided a differentiating method between coniferous trees and broad-leaved trees within the compartment(less than forest stand) for single extraction from spaceborne high resolution image.

  • PDF

The Fractal Image Compression Based on the Wavelet Transform Using the SAS Techniques (SAS 기법을 이용한 웨이브릿 변환 기반 프랙탈 영상 압축)

  • 정태일;강경원;문광석;권기룡;류권열
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.2 no.1
    • /
    • pp.19-27
    • /
    • 2001
  • The conventional fractal image compression based on wavelet transform has the disadvantage that the encoding takes many time, since it finds the optimum domain for all the range blocks. In this paper, we propose the fractal image compression based on wavelet transform using the SAS(Self Affine System) techniques. It consists of the range and domain blocks in the wavelet transform, and the range blocks select the domain which is located the relatively same position. In the encoding process, the proposed methods introduce SAS techniques that the searching process of the domains blocks is not required. Therefore, it can perform a fast encoding by reducing the computational complexity. And, the image quality is improved using the different scale factors for each level and the sub-tree in the decoding. As a result, the image quality and the compression ratio are adjustable by the scale factors.

  • PDF

Low-Temperature Crystallization of Amorphous Si Films by Cu Adsorption (구리 흡착에 의한 비정질 실리콘 박막의 저온 결정화 거동)

  • Jo, Seong-U;Son, Dong-Gyun;Lee, Jae-Sin;An, Byeong-Tae
    • Korean Journal of Materials Research
    • /
    • v.7 no.3
    • /
    • pp.188-195
    • /
    • 1997
  • Copper ions were adsorbed on amorphous Si films by spincoating of Cu solutions and were employed as surface nucleation sites for low-temperature crystallization. The crystallization temperature can bc lo~vered down to $500^{\circ}C$ and rhe crystallization time can be shortened by Cu adsorption. The Cu-adsorbed amorphous films were crystallized by fractal growth with the shape of tree branches. The fractal size ranged from $30 to 300{\mu}m$, depending on the Cu solution concentration. The fractals consisted of f e a t h e r like elliptical grains with the size of $0.3~0.4{\mu}m$. which was comparable to that of the intrinsic films crystallized at $600^{\circ}C$. Both the nucleation activation energy and grotvth activation energy decreased as the Cu concentration in the solution increased. The results suggest thcit the adsorbed Cu increases preferred nucleation sites at the surface and enhmces crystallization by reducing thc activation energies of nucleation and growth.

  • PDF

A Tree Morphing Animation Using Fractal Theory based on the Web (웹기반에서의 랜덤 프랙탈을 이용한 나무 모핑 애니메이션)

  • Bae, Woo-Jung;Song, Hang-Sook
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2000.04a
    • /
    • pp.240-243
    • /
    • 2000
  • 웹 환경에서 모핑 애니메이션들은 전송량의 증가에 따른 과부하를 줄이기 위하여 소스들을 다운 로드 하여 자신의 컴퓨터에서 실행하여 통신 트래픽을 해소하고자 한다. 이때의 애니메이션들은 기하학적 프리미티들을 이용하여 만든 동화상들로 자연스러운 실세계 등의 모습을 표현하기에는 무리가 있다. 본 논문에서는 이러한 문제들을 해결하는 한 방법이면서 보다 다양한 자연의 랜덤한 모습을 보이기 위해 랜덤프랙탈을 사용 한다.

  • PDF

Scattering Model for Hard Target Embedded inside Forest Using Physics-based Channel Model Based on Fractal Trees (프랙탈 나무 모델을 이용한 숲 속에 숨어 있는 타겟의 산란모델)

  • Koh Il-Suek
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.16 no.2 s.93
    • /
    • pp.174-181
    • /
    • 2005
  • In this paper, a hybrid model is developed, which can estimate scattering properties of a target embedded inside a forest. The model uses a physic-based channel model for a forest to accurately calculate the penetrated field through a forest canopy. The channel model is based on a fractal tree geometry and single scattering theory. To calculate scattering from the target physical optics(PO) is used to compute an induced current on the target surface since the dimension of the target is generally very large and the shape is very complicated. Then using reciprocity theorem, scattering generated by the PO current is calculated without an extra computational complexity.

VLSI Array Architecture for High Speed Fractal Image Compression (고속 프랙탈 영상압축을 위한 VLSI 어레이 구조)

  • 성길영;이수진;우종호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.4B
    • /
    • pp.708-714
    • /
    • 2000
  • In this paper, an one-dimensional VLSI array for high speed processing of fractal image compression algorithm based the quad-tree partitioning method is proposed. First of all, the single assignment code algorithm is derived from the sequential Fisher's algorithm, and then the data dependence graph(DG) is obtained. The two-dimension array is designed by projecting this DG along the optimal direction and the one-dimensional VLSI array is designed by transforming the obtained two-dimensional array. The number of Input/Output pins in the designed one-dimensional array can be reduced and the architecture of process elements(PEs) can he simplified by sharing the input pins of range and domain blocks and internal arithmetic units of PEs. Also, the utilization of PEs can be increased by reusing PEs for operations to the each block-size. For fractal image compression of 512X512gray-scale image, the proposed array can be processed fastly about 67 times more than sequential algorithm. The operations of the proposed one-dimensional VLSI array are verified by the computer simulation.

  • PDF