Random Data Compressed 100:1 (Guffaw)

[Steve Schear]

At 12:06 PM 1/9/2002 +0100, Eugene Leitl wrote:
>On Tue, 8 Jan 2002, Steve Schear wrote:
>
> > combinations/permutations and auto correlations to code for the runs.  I
> > say attempted, because I was never able to find acceptable algorithms to
> > satisfy my requirement.  I still believe these algorithms exist, it was
> > just my limitations in identifying the underlying math needed.
>
>http://www.google.com/search?q=IFS+image+compression&sourceid=opera&num=100&ie=utf-8&oe=utf-8

I knew the guys behind Fractal compression, but that's not what I was 
trying to do.  They looked for a higher-level order I was just looking to 
take advantage of local correlations and the ability to identify identical 
runs in the output of deterministic generators who's references could be 
expressed very efficiently (e.g., correlation coefficient/seed value, 
displacement) compared with the data being compressed.  Its a highly 
asymmetric approach so real-time applications were not considered.

IFS eventually became practical but they came from a time when proprietary 
solutions were king and missed the open standards revolution which powered 
JPG (which while generally as good at compression was open to improvement, 
well studied and not chained by patents).

steve