DocumentCode
350905
Title
Optimal fractal image coding
Author
Cai, DongSheng ; Hirobe, Mitsuyasu
Author_Institution
Inst. of Inf. Sci. & Electron., Tsukuba Univ., Ibaraki, Japan
Volume
1
fYear
1999
fDate
1999
Firstpage
650
Abstract
Image compression techniques based on fractals or the iterated function systems (IFS) theory have been developed in the last few years, and may promise better compression performance. Fractal image compression techniques are being developed due to the recognition that fractals can describe natural scenes better than shapes of traditional geometry. These facts are reasoned that because images of the real world tend to consist of many complex patterns that recur at various sizes, i.e. fractals. There should be a way to translate pictures into fractal equations. Images so coded would require less data and thus less disk space to store and less time to transmit. In addition, the images are resolution-independent. In the present report, we discuss an optimal fractal image coding minimizing the Lagrangian cost function J(partition)=Distortion(partition)+λRate(partition)
Keywords
data compression; fractals; image coding; rate distortion theory; Lagrangian cost function minimization; fractal equations; image compression techniques; optimal fractal image coding; rate-distortion functions; resolution-independent images; Cost function; Equations; Fractals; Geometry; Image coding; Image recognition; Image resolution; Lagrangian functions; Layout; Shape;
fLanguage
English
Publisher
ieee
Conference_Titel
TENCON 99. Proceedings of the IEEE Region 10 Conference
Conference_Location
Cheju Island
Print_ISBN
0-7803-5739-6
Type
conf
DOI
10.1109/TENCON.1999.818498
Filename
818498
Link To Document