[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Information, Compression, and storage.
- To: "telecine internet group" <telecine at alegria.com>
- Subject: Re: Information, Compression, and storage.
- From: "Martin Euredjian" <martin at hollydig.com>
- Date: Wed, 7 Jul 1999 23:47:17 -0600
- Resent-Date: Thu, 8 Jul 1999 01:50:23 -0500
- Resent-From: telecine at alegria.com
- Resent-Message-ID: <"TjAETD.A.ZzB.qoEh3" at sun>
- Resent-Sender: telecine-request at alegria.com
- Resent-To: multiple recipients of <telecine at alegria.com>
Some random thoughts...
After having looked at imagery produced with lossy compression it is hard to
argue the fact that, for human-viewable consumption, the images produced can
be superb. The only problems with lossy compression should be in a very
narrow field of application where compositing/effects/coloring need as much
info as possible. Archival is another area of concern.
On the question of lossless compression:
True lossless compression does not exist (refer to the USENET Compression
FAQ below, among other sources). That is, given a perfectly
random data set, no algorithm can be had that will represent that unique
data set in a more compact form without incurring some loss. The smallest
representation of the data set is the data set itself. The fire test of
lossless compression algorithms is recursion.
All lossless algorithms take advantage of repeating values, value patterns
or bit patterns in one way or another. All compression algorithms also take
advantage of having lots and lots of data to look for these patterns. Video
is great on all of the above.
I don't know of any lossless compression algorithm that can guarantee a
fixed compression ratio and fixed processing time per unit of data. That's
why it would be difficult to use in a real-time imaging type application
with current technology.
As a valuable experiment, try to think of a way to reliably compress five or
ten bytes of random data by just 20% (in other words, turn five bytes into
four bytes, etc.).
Some neat compression sites I've learned from:
Wheeler's block algorithm
A nice list of compression links
Signal processing at Stanford University
USENET Compression FAQ
Thanks to Rich Torpey for support in 1999
No advertising/marketing allowed on the main TIG. Contact rob at alegria.com
anonymous messaging now at http://www.alegria.com/HyperNews/get/ubique.html
1046 subscribers in 41 countries on Thu Jul 8 01:50:18 CDT 1999
subscribe/unsubscribe with that Subject: to telecine-request at alegria.com
complete information on the TIG website http://www.alegria.com/tig3/