Novel fractal image compression method with non-iterative decoder

Chang-Su Kim, Rin Chul Kim, Sang Uk Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

In this paper, we propose a novel fractal image compression technique, which does not require iteration at the decoder. The main problem relating to the conventional non-iterative algorithm is that the smooth region cannot be coded efficiently, since the size of the range block is limited to be less than 8 × 8. We alleviate this problem by generating two codebooks from planarly approximated image. In other words, the first codebook is generated by the smoothing operator for large and smooth range blocks and the second codebook is generated by the spatial contraction operator for small and active range blocks, respectively. The computer simulation results on the real images demonstrate that the proposed algorithm provides much better performance than most other fractal-based coders, in terms of the subjective quality as well as the objective quality (PSNR). Moreover, the proposed algorithm is very fast in decoding, since it does not require iteration at the decoder.

Original languageEnglish
Title of host publicationIEEE International Conference on Image Processing
Editors Anon
Place of PublicationLos Alamitos, CA, United States
PublisherIEEE
Pages268-271
Number of pages4
Volume3
Publication statusPublished - 1995 Dec 1
Externally publishedYes
EventProceedings of the 1995 IEEE International Conference on Image Processing. Part 3 (of 3) - Washington, DC, USA
Duration: 1995 Oct 231995 Oct 26

Other

OtherProceedings of the 1995 IEEE International Conference on Image Processing. Part 3 (of 3)
CityWashington, DC, USA
Period95/10/2395/10/26

Fingerprint

Image compression
Fractals
Decoding
Computer simulation

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition
  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Kim, C-S., Kim, R. C., & Lee, S. U. (1995). Novel fractal image compression method with non-iterative decoder. In Anon (Ed.), IEEE International Conference on Image Processing (Vol. 3, pp. 268-271). Los Alamitos, CA, United States: IEEE.

Novel fractal image compression method with non-iterative decoder. / Kim, Chang-Su; Kim, Rin Chul; Lee, Sang Uk.

IEEE International Conference on Image Processing. ed. / Anon. Vol. 3 Los Alamitos, CA, United States : IEEE, 1995. p. 268-271.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kim, C-S, Kim, RC & Lee, SU 1995, Novel fractal image compression method with non-iterative decoder. in Anon (ed.), IEEE International Conference on Image Processing. vol. 3, IEEE, Los Alamitos, CA, United States, pp. 268-271, Proceedings of the 1995 IEEE International Conference on Image Processing. Part 3 (of 3), Washington, DC, USA, 95/10/23.
Kim C-S, Kim RC, Lee SU. Novel fractal image compression method with non-iterative decoder. In Anon, editor, IEEE International Conference on Image Processing. Vol. 3. Los Alamitos, CA, United States: IEEE. 1995. p. 268-271
Kim, Chang-Su ; Kim, Rin Chul ; Lee, Sang Uk. / Novel fractal image compression method with non-iterative decoder. IEEE International Conference on Image Processing. editor / Anon. Vol. 3 Los Alamitos, CA, United States : IEEE, 1995. pp. 268-271
@inproceedings{38b6a1bdeeab452c8af21330136692d3,
title = "Novel fractal image compression method with non-iterative decoder",
abstract = "In this paper, we propose a novel fractal image compression technique, which does not require iteration at the decoder. The main problem relating to the conventional non-iterative algorithm is that the smooth region cannot be coded efficiently, since the size of the range block is limited to be less than 8 × 8. We alleviate this problem by generating two codebooks from planarly approximated image. In other words, the first codebook is generated by the smoothing operator for large and smooth range blocks and the second codebook is generated by the spatial contraction operator for small and active range blocks, respectively. The computer simulation results on the real images demonstrate that the proposed algorithm provides much better performance than most other fractal-based coders, in terms of the subjective quality as well as the objective quality (PSNR). Moreover, the proposed algorithm is very fast in decoding, since it does not require iteration at the decoder.",
author = "Chang-Su Kim and Kim, {Rin Chul} and Lee, {Sang Uk}",
year = "1995",
month = "12",
day = "1",
language = "English",
volume = "3",
pages = "268--271",
editor = "Anon",
booktitle = "IEEE International Conference on Image Processing",
publisher = "IEEE",

}

TY - GEN

T1 - Novel fractal image compression method with non-iterative decoder

AU - Kim, Chang-Su

AU - Kim, Rin Chul

AU - Lee, Sang Uk

PY - 1995/12/1

Y1 - 1995/12/1

N2 - In this paper, we propose a novel fractal image compression technique, which does not require iteration at the decoder. The main problem relating to the conventional non-iterative algorithm is that the smooth region cannot be coded efficiently, since the size of the range block is limited to be less than 8 × 8. We alleviate this problem by generating two codebooks from planarly approximated image. In other words, the first codebook is generated by the smoothing operator for large and smooth range blocks and the second codebook is generated by the spatial contraction operator for small and active range blocks, respectively. The computer simulation results on the real images demonstrate that the proposed algorithm provides much better performance than most other fractal-based coders, in terms of the subjective quality as well as the objective quality (PSNR). Moreover, the proposed algorithm is very fast in decoding, since it does not require iteration at the decoder.

AB - In this paper, we propose a novel fractal image compression technique, which does not require iteration at the decoder. The main problem relating to the conventional non-iterative algorithm is that the smooth region cannot be coded efficiently, since the size of the range block is limited to be less than 8 × 8. We alleviate this problem by generating two codebooks from planarly approximated image. In other words, the first codebook is generated by the smoothing operator for large and smooth range blocks and the second codebook is generated by the spatial contraction operator for small and active range blocks, respectively. The computer simulation results on the real images demonstrate that the proposed algorithm provides much better performance than most other fractal-based coders, in terms of the subjective quality as well as the objective quality (PSNR). Moreover, the proposed algorithm is very fast in decoding, since it does not require iteration at the decoder.

UR - http://www.scopus.com/inward/record.url?scp=0029510917&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029510917&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0029510917

VL - 3

SP - 268

EP - 271

BT - IEEE International Conference on Image Processing

A2 - Anon, null

PB - IEEE

CY - Los Alamitos, CA, United States

ER -