Tiling and Fractal Compression

Thread View: comp.compression.research

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by Jeff Sidell Tue, 27 Oct 1992 13:50

Author: Jeff Sidell
Date: Tue, 27 Oct 1992 13:50

17 lines
1311 bytes

Hi,

How does one arrive at the optimal (or at least at a satisfactory)
tiling of the original image (or data space) in Barnsley's fractal
compression algorithm?  In other words, how do you get the affine
compressive transformations which represent the original image?

Some background:  I'm a grad student here at U of Ill. in Urbana-
Champaign working in database research.  I'm interested in investigating
the possibility of representing very large data sets (like satellite
data) as iterated function sets and seeing if this would be a viable
tool to use for DBMS's.

Any help would be GREATLY appreciated - there's only five weeks
left in the semester!!!

Jeff Sidell

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads