Fractal coding of color images

G. R. Rajugopal; S. Panchanathan

doi:10.1109/ccece.1994.405801

Fractal coding of color images

G. R. Rajugopal, S. Panchanathan

Research output: Contribution to journal › Conference article › peer-review

1 Scopus citations

Abstract

Recently, fractal based compression techniques which provide a large compression ratio for monochrome images have been reported in the literature. Fractal coding is based on the fractal theory of iterated transformations. This paper discusses fractal geometry as applied to color image coding. In the case of color images there exists correlations among the color components and hence greater compression can be achieved by exploiting these redundancies. The proposed technique not only exploits the self-similarity in the image but also exploits the cross-correlations among the color components. Simulations have been performed using standard 512×512, 24 bits/pixel color images. Results show that the image quality is good to acceptable at less than 1 bit/pixel and excellent at about 2.6 bits/pixel.

Original language	English (US)
Pages (from-to)	513-516
Number of pages	4
Journal	Canadian Conference on Electrical and Computer Engineering
Volume	2
DOIs	https://doi.org/10.1109/ccece.1994.405801
State	Published - Jan 1 1994
Externally published	Yes
Event	Proceedings of the 1994 Canadian Conference on Electrical and Computer Engineering. Part 2 (of 2) - Halifax, Can Duration: Sep 25 1994 → Sep 28 1994

ASJC Scopus subject areas

Hardware and Architecture
Electrical and Electronic Engineering

Access to Document

10.1109/ccece.1994.405801

Cite this

@article{45ae9d78bafb4ab48daa3f700f2c399b,

title = "Fractal coding of color images",

abstract = "Recently, fractal based compression techniques which provide a large compression ratio for monochrome images have been reported in the literature. Fractal coding is based on the fractal theory of iterated transformations. This paper discusses fractal geometry as applied to color image coding. In the case of color images there exists correlations among the color components and hence greater compression can be achieved by exploiting these redundancies. The proposed technique not only exploits the self-similarity in the image but also exploits the cross-correlations among the color components. Simulations have been performed using standard 512×512, 24 bits/pixel color images. Results show that the image quality is good to acceptable at less than 1 bit/pixel and excellent at about 2.6 bits/pixel.",

author = "Rajugopal, {G. R.} and S. Panchanathan",

year = "1994",

month = jan,

day = "1",

doi = "10.1109/ccece.1994.405801",

language = "English (US)",

volume = "2",

pages = "513--516",

journal = "Canadian Conference on Electrical and Computer Engineering",

issn = "0840-7789",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "Proceedings of the 1994 Canadian Conference on Electrical and Computer Engineering. Part 2 (of 2) ; Conference date: 25-09-1994 Through 28-09-1994",

}

TY - JOUR

T1 - Fractal coding of color images

AU - Rajugopal, G. R.

AU - Panchanathan, S.

PY - 1994/1/1

Y1 - 1994/1/1

N2 - Recently, fractal based compression techniques which provide a large compression ratio for monochrome images have been reported in the literature. Fractal coding is based on the fractal theory of iterated transformations. This paper discusses fractal geometry as applied to color image coding. In the case of color images there exists correlations among the color components and hence greater compression can be achieved by exploiting these redundancies. The proposed technique not only exploits the self-similarity in the image but also exploits the cross-correlations among the color components. Simulations have been performed using standard 512×512, 24 bits/pixel color images. Results show that the image quality is good to acceptable at less than 1 bit/pixel and excellent at about 2.6 bits/pixel.

AB - Recently, fractal based compression techniques which provide a large compression ratio for monochrome images have been reported in the literature. Fractal coding is based on the fractal theory of iterated transformations. This paper discusses fractal geometry as applied to color image coding. In the case of color images there exists correlations among the color components and hence greater compression can be achieved by exploiting these redundancies. The proposed technique not only exploits the self-similarity in the image but also exploits the cross-correlations among the color components. Simulations have been performed using standard 512×512, 24 bits/pixel color images. Results show that the image quality is good to acceptable at less than 1 bit/pixel and excellent at about 2.6 bits/pixel.

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

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

U2 - 10.1109/ccece.1994.405801

DO - 10.1109/ccece.1994.405801

M3 - Conference article

AN - SCOPUS:0028706804

SN - 0840-7789

VL - 2

SP - 513

EP - 516

JO - Canadian Conference on Electrical and Computer Engineering

JF - Canadian Conference on Electrical and Computer Engineering

T2 - Proceedings of the 1994 Canadian Conference on Electrical and Computer Engineering. Part 2 (of 2)

Y2 - 25 September 1994 through 28 September 1994

ER -

Fractal coding of color images

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this