Tiling and Fractal Compression

Article View: comp.compression.research

Article #1

Back to comp.compression.research Previous Next

From: 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

Technical Details

Message-ID: <1992Oct27.135030.19947@m.cs.uiuc.edu>

Path:

arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!cs.utexas.edu!uwm.edu!ux1.cso.uiuc.edu!cs.uiuc.edu!m.cs.uiuc.edu!swine.cs.uiuc.edu!sidell

Show Full Headers

Complete Article Headers

Newsgroups: comp.compression.research
Path: arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!cs.utexas.edu!uwm.edu!ux1.cso.uiuc.edu!cs.uiuc.edu!m.cs.uiuc.edu!swine.cs.uiuc.edu!sidell
From: sidell@swine.cs.uiuc.edu (Jeff Sidell)
Subject: Tiling and Fractal Compression
Message-ID: <1992Oct27.135030.19947@m.cs.uiuc.edu>
Summary: How does one arrive at a satisfactory tiling in Barnsley's fractal comp
Keywords: tiling fractal compression
Sender: news@m.cs.uiuc.edu (News Database (admin-Mike Schwager))
Organization: University of Illinois, Dept. of Comp. Sci., Urbana, IL
Date: Tue, 27 Oct 1992 13:50:30 GMT
Lines: 18