• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.2
• /
• pp.28-38
• /
• 2000

This paper proposes a fractal compression method using the domain classification and local searching, which utilize DCT coefficient characteristic Generally, the fractal Image encoding method has a time consuming process to search a domain to be matched with range block In order to reduce computation complexity, the domain and range regions are respectively classified into 4 category by using the characteristics of DCT coefficients and each range region is encoded by a method suitable for the property of its category Since the bit amount of the compressed image depends on the number of range blocks, the matching of domain block and range block is induced on the large range block by using local search, so that compression ratio is increased by reducing the number of range block In the local search, the searching complexity is reduced by determining the direction and distance of searching using the characteristics of DCT coefficients The experimental results shows that the proposed algorithm have 1 dB higher PSNR and 0 806 higher compression ratio than previous algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.3
• /
• pp.99-106
• /
• 1998

This Paper proposes a novel fractal image method for image communication to shorten time to take on fractal encoding by using limited search area method and scaling method First, the original image is contracted respectively by half and by quarter with the scaling method. And then, the corresponding domain block of the quarter-sized image which is most similar with one range block of the half-sized image is searched within the limited area in order to reduce the encoding time extremely As the result of the evaluation, the proposed algorithm provided much shorter encoding time and better compression ratio with a little degradation of the decoded image quality than Jacquin's method.

• Journal of the Korean Society of Radiology
• /
• v.10 no.4
• /
• pp.263-270
• /
• 2016

This paper suggests techniques to enhance coding time which is a problem in traditional fractal compression and to improve fidelity of reconstructed images by determining fractal coefficient through adaptive selection of block approximation formula. First, to reduce coding time, we construct a linear list of domain blocks of which characteristics is given by their luminance and variance and then we control block searching time according to the first permissible threshold value. Next, when employing three-level block partition, if a range block of minimum partition level cannot find a domain block which has a satisfying approximation error, There applied to 24-bpp color image compression and image techniques. The result did not occur a loss in the image quality of the image when using the encoding method, such as almost to the color in the YIQ image compression rate and image quality, such as RGB images and showed good.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.11a
• /
• pp.199-202
• /
• 2004

프랙탈 압축 알고리즘에서는 필요에 따라 다양한 분할 방식을 사용하고 있다. 기존에는 분할방식에 따라 다른 isometry 변환계수 값만을 사용하고 있다. 본 논문에서는 이러한 문제를 해결하기 위하여 모든 분할 방식에서 공통적으로 사용할 수 있도록 변환 가능한 isometry 변환계수 방식을 제안하였으며 이를 하드웨어로 구현하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5A
• /
• pp.702-708
• /
• 2000

In this paper, we designed one-dimensional VLSI array with optimal pipeline period for high speed processing fractal image compression. The algorithm is derived which is suitable for VLSI array from axed block partition algorithm. Also the algorithm satisfies high quality of image and high compression-ratio. The designed VLSI array has optimal pipeline relied because the required processing time of PEs is distributed as same as possible. As this result, we can improve the processing speed up to about 3 times. The number of input/output pins can be reduced by sharing the input/output and arithmetic unit of the domain blocks and the range blocks.

• Journal of the Korean Society of Radiology
• /
• v.8 no.7
• /
• pp.435-441
• /
• 2014

This paper suggests techniques to enhance coding time which is a problem in traditional fractal compression and to improve fidelity of reconstructed images by determining fractal coefficient through adaptive selection of block approximation formula. First, to reduce coding time, we construct a linear list of domain blocks of which characteristics is given by their luminance and variance and then we control block searching time according to the first permissible threshold value. Next, when employing three-level block partition, if a range block of minimum partition level cannot find a domain block which has a satisfying approximation error, There applied to 24-bpp color image compression and image techniques. The result did not occur a loss in the image quality of the image when using the encoding method, such as almost to the color in the RGB image compression rate and image quality, such as gray-level images and showed good.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1998.10a
• /
• pp.463-466
• /
• 1998

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10d
• /
• pp.454-456
• /
• 2002

압축 방법에는 크게 손실(lossy)압축과 무손실(lossless)압축으로 나눌 수 있다. 그 중 프랙탈 이미지 압축은 lossy 압축의 한가지 방법으로서 개별적인 화소들에 대한 자료를 저장하기보다는, 영상 생성을 위한 명령이나 방식을 저장하는 방법이다. 특히 이미지의 내에 자기유사성(self-similarity)과 중복성(Redundancy)을 이용하여 관련성을 발견하고 수학적인 공식으로 표현하려는 방식이다. 그러나 이미지를 Domain과 Range로 블록화 한 후 유사한 이미지를 찾아내는 데 걸리는 시간이 상당히 길다. 여기에서는 Domain과 Range의 외곽선의 기울기의 부호를 이용하여 블록을 16가지로 클래스화 하여서, 전체의 Domain 블록을 탐색하는 데 걸리는 시간을 줄이고자 하였다. 전체 탐색을 하는 경우보다 10배 이상의 속도향상을 보였고, 이미지에 따라서는 PSNR 값의 손실도 없음을 보였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11b
• /
• pp.925-927
• /
• 2005

홍채 인식(Iris Recognition)은 동공과 흰자위 사이에 있는 홍채의 모양 패턴이 평생 변하지 않고, 사람마다 다른 패턴을 가진다는 특성을 이용하여 개인을 식별하는 기술로, 생체인식(Biometrics) 부분에서는 탁월한 식별력 및 신뢰성을 인정 받고 있다. 상당수의 기존 연구들은 원천 특허를 채택한 상태에서 성능 개선을 연구해 왔기 때문에 원천적인 한계를 가지고 있었다. 본 논문은 웨이블릿(Wavelet) 변환을 이용하여 특징을 추출하는 기존 방식과 다르게 프랙탈(Fractal) 방법으로 압축된 다수의 원 영상에 대해 입력된 영상의 유사도를 측정, 개인을 식별하는 새로운 홍채인식 방법을 제안한다. 이를 통해 타 연구들에서 제안했던 특별한 최적화 알고리즘을 사용하지 않고도 크게 떨어지지 않는 인식률을 얻을 수 있다.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.35T no.3
• /
• pp.15-24
• /
• 1998

In this paper, we present new method of fractal image coding based on iterated function system(IFS) suggested by Barnsley. In previous Fractal coding using full searching algorithm, the quality of reconstructed image was better than other fractal coding method's, but it took a long time in that algorithm for searching domain blocks matched. And it is performed through linear affine transform, therefore it is difficult to approximate the complex range blocks. In this paper, using quadtree partitioning, complex blocks are divided into more smaller blocks, and simple blocks are merged to more larger blocks. So, we can got more precisely approximated range blocks and reduce the number of transformations. Hence, we have improved the compression ratio. In addition, we restrict the region of searching domains in order to reduce the searching time and coding time. Compared with full searching algorithm, we reduced coding time drastically, and quality of reconstructed image was better in terms subjective criteria. And compared with Monro's, our method is slower, but we could obtain a reconstructed image with better quality.