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

본 논문은 고속의 프랙탈 영상압축 기법으로 알려져 있는 Bath 프랙탈 영상 압축 기법의 성능을 여러 가지 측면에서 분석한다. Bath 프랙탈 영상 압축 기법은 영상의 빠른 복호화가 가능하므로 미래의 다양한 형태로 요구되는 정보서비스, VOD(Video On Demand), CD-ROM 등과 같이 저장되어 있는 영상 정보의 빠른 복원이 요구되는 곳에 적합한 부호화 기술이므로 그 성능에 대한 분석이 중요하다. 본 논문에서는 Bath 프랙탈 압축 기법의 양자화 방법에 따른 성능 분석, 프랙탈 계수 값의 분포에 따른 성능 평가, 사용된 어핀 맵핑식에 따른 성능 비교, 영상내의 에지 빈도수에 따른 성능 변화, 쿼드트리 구조의 작은 블록들에 대한 BFT의 성능 평가 등을 고찰한다.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.1
• /
• pp.41-47
• /
• 2002

Fractal image compression can reduce the size of image data by the contractive mapping that is affine transformation to find the block(called as range block) which is the most similar to the original image. Even though fractal image compression is regarded as an efficient way to reduce the data size, it has high distortion rate and requires long encoding time. In this paper, we presented a hybrid fractal image compression system with the modified SOFM Vector Quantizer which uses improved competitive learning method. The simulation results showed that the VQ hybrid fractal using improved competitive loaming SOFM has better distortion rate than the VQ hybrid fractal using normal SOFM.

• Journal of the Korea Computer Graphics Society
• /
• v.10 no.1
• /
• pp.1-6
• /
• 2004

본 논문에서는 프랙탈 영상압축에서 화질/압축률을 향상 시키면서 압축시간을 획기적으로 향상시키는 방법을 제안한다. 본 방법은 레인지블록의 크기가 아주 작으면 유사변환 계수들의 값을 극히 제한하더라도 유사한 도메인블록을 아주 가까운 주변에서 쉽게 찾을 수 있음을 활용하여 압축시간을 단축시키고 화질/압축률을 향상 시킨다. 또한, 본 방법은 인접한 레인지블록 들의 압축에 사용되는 계수들이 좋은 상호관계를 가지도록 유도하여 화질/압축률을 더욱 향상 시킨다. 본 방법은 대부분의 프랙탈 영상압축 방법에 쉽게 적용되어 그 성능을 향상시킬 수 있다. 특히 압축시간이 전역탐색 방법에 비해서 $512{\times}512$ 영상에서 약 60000 배 $256{\times}256$ 영상에서 약 15000 배 빠르며 실시간 동영상의 I-frame에도 사용가능 하다.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.4
• /
• pp.1121-1131
• /
• 1997

In video coding at high compression rate, factal compression schemes in spatial domain have outstanding blocking artifacts and compression schemes in wavelet transform domain have rinfing artifacts at edges. In order to compensate these disadvantages, we propose a fractal video coding in wavelet transrorm domain which leads to clear edges without blocking atrifacts even at high bompression rate. The proposed method performs variable block sized motion estimation by using correlation among different subbands. Then the wavelet coefficients which are not enoded dffectively by the motion estimation are compressed by inter-frame fractal coding which predicts fine scale subbands hierarchically from the next coarser scale subbands. Computer sumulations with sev-eral test images wequences show that the proposed method shows better performance than the conventional video coding methods using fractal and wavelet.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.4 no.2
• /
• pp.96-101
• /
• 2003

Recently, Fractal Image Coding has been studied as a way of efficient data compressing scheme. In the beginning, Fractal Image Coding has been studied for the data compressing in black ＆ white images and linear images. A. E. Jacquin suggested LIFS which expends to Fractal Image Coding for a gray scale image. Currently, YTKT's LIFS scheme which is using Gram-Schmidt is so efficient that enough to compete with the JPEG which is the national standards. This paper investigates the way of greatly reduced calculation for the orthogonalization algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.365-372
• /
• 2000

he paper introduces evolutionary computing to Fractal Image Compression(FIC). In Fractal Image Compression(FIC) a partitioning of the image into ranges is required. As a solution to this problem there is a propose that evolution computation should be applied in image partitionings. Here ranges are connected sets of small square image blocks. Populations consist of $N_p$ configurations, each of which is a partitioning with a fractal code. In the evolution each configuration produces $\sigma$ children who inherit their parent partitionings except for two random neighboring ranges which are merged. From the offspring the best ones are selected for the next generation population based on a fitness criterion Collage Theorem. As the optimum image includes duplication in image data, it gets smaller in saving space more efficient in speed and more capable in image quality than any other technique in which other coding is used. Fractal Image Compression(FIC) using evolution computation in multimedia image processing applies to such fields as recovery of image and animation which needs a high-quality image and a high image-compression ratio.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10b
• /
• pp.421-423
• /
• 2001

디지털 워터마킹(Digital Watermarking)은 디지털 영상에 저작권을 증명할 수 있는 정보를 삽입하는 방법으로써 영상의 화질 저하를 최소화하면서 저작권 신호 추출의 정확도를 최대화하여야 한다. 본 논문에서는 프랙탈(Fractal) 영상 압축에서 변환 함수의 계수를 디지털 워터마킹 키(Key)에 따라 제한하여 디지털 워터마킹(Digital Watermarking) 신호를 삽입하는 방법을 제한한다. 본 방법은 탐색 범위 제한에 의한 기존의 프랙탈(Fractal) 기반 디지털 위터마킹(Digital Watermarking) 방법보다 영상 변형에 강인하고 화질의 저하를 완화하는 장점을 가진다.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.39 no.3
• /
• pp.35-41
• /
• 2002

There are many image segmentation methods having been published as the results of research so far, but it is difficult to be partitioned to each similar range that should be extracted into the accurate parameters of image information on the images with noises. Also if it is used to fractal coding, according to amount of noise in image, the image segmentation leads to decreasing of the compression ratio. In this paper, we propose the new quad-tree image segmentation using the box-counting dimension which can estimate the effective image information parameters against the noise properties and apply this method to fractal image coding. As the result of simulation, we confirm that the image segmentation is improved to 31.10% for parameter detection of image information and compression ratio is enhanced to 38.93% for fractal image coding when tested on 10% Gaussian white noise image by the proposed quad-tree method compared with method using existing quad-tree. 

• Journal of Biomedical Engineering Research
• /
• v.21 no.3 s.61
• /
• pp.247-254
• /
• 2000

We propose an efficient MR image compression technique using fractal coding in wavelet transform domain. In the Proposed method , we construct significant coefficient trees with the absolute values of discrete wavelet transform coefficients and then perform the fractal coding with the information of significant coefficients having high energy. For MR images, most Pixels including background have very low gray level values, the number of significant coefficients is small. so we can expect high compression rate. In addition. since this method uses the fractal coding in wavelet transform domain, blocking artifact is reduced prominently and edges sensitive to human visual system are well preserved. As a result of computer simulation, we obtained the reconstructed images with better quality than those by JPEG at the low bit rates below 0.33[bpp].

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2000.08a
• /
• pp.277-280
• /
• 2000

기존의 웨이브릿 기반 프랙탈 압축 방법은 전 영역에 대하여 최적의 정의역을 탐색하므로, 부호화 과정에서 많은 탐색시간이 소요되는 단점이 있다. 그래서 본 논문에서는 웨이브릿 변환영 역에서 SAS(Self Affine System) 기법을 이용한 웨이브릿 변환 기반 프랙탈 영상 압축 방법을 제안한다. 웨이브릿 변환영역에서 정의역과 치역을 구성하고, 각각의 정의역과 치역에 대해 모든 블록을 탐색하는 것이 아니라, 각 대역별로 공간적으로 같은 위치에 있는 블록을 정의역으로 선택한다. 이와 같이 웨이브릿 변환 영역에서 정의역 탐색과정이 필요 없는 SAS 프랙탈 영상 압축방법을 도입하여 부호화 과정에서 곱셈 계산량을 감소시켜 고속 부호화를 가능하게 하였고, 복호화 과정에서 각 레벨별로 서로 다른 스케일을 사용하여 화질을 개선하였다.