DocumentCode :
3145116
Title :
Using fractal geometry for image compression
Author :
Culik, Karel, II ; Dube, Simant
Author_Institution :
Dept. of Comput. Sci., South Carolina Univ., Columbia, SC, USA
fYear :
1991
fDate :
8-11 Apr 1991
Firstpage :
459
Abstract :
Summary form only given. The authors present methods of fractal geometry powerful and general enough to encode a wide variety of images. They consider probabilistic finite generators, the basic idea being the interpretation of strings over some alphabet as rational coordinates and languages and relations as sets of points (images). Encoding is conceptually simple, and allows for an efficient implementation using quadtrees. Probabilistic mutually recursive function systems are defined over n variables (images) related in a mutually recursive fashion as unions under affine transformations
Keywords :
computational geometry; data compression; encoding; fractals; picture processing; recursive functions; affine transformations; fractal geometry; image compression; interpretation of strings; probabilistic finite generators; probabilistic mutually recursive function systems; Color; Computational geometry; Computer science; Costs; Decoding; Fractals; Hardware; Image coding; Software standards;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Compression Conference, 1991. DCC '91.
Conference_Location :
Snowbird, UT
Print_ISBN :
0-8186-9202-2
Type :
conf
DOI :
10.1109/DCC.1991.213302
Filename :
213302
Link To Document :
بازگشت