Re: indicators of a good compression ratio
- From: Thomas Richter <thor@xxxxxxxxxxxxxxxxx>
- Date: Wed, 23 Apr 2008 09:16:17 +0200
novice schrieb:
Hello I have a algorithm in the works but before I fully implement it
and find out its not good (atleast nothing top of the line) what are
good metrics in telling me that I have a good algorithm.
Compression ratio on data you consider typical for your application?
i.e. My idea is a dictionary approuch (lossless) and if I can tell
each address used is compressing 3-5 bits a "use" is that good?
Hard to say without really having data on *what* you want to compress,
i.e. what is its probability distrotion? What is an "address"?
What is the entropy (under your model) of the source? How close do you
get to it?
For a
simple huffman does it compress 1-3 bits per address use? LZW? others?
I ask because 3-5 bits seem small, but thats per address use, which
means that could be 3-5 million addresses used in even small files -
which means 9 - 25 million bits compressed.
Perhaps its not a set number like 3-5 but perhaps a percentage?
Perhaps it's unclear because you haven't said what you're doing? (-;
So long,
Thomas
.
- References:
- indicators of a good compression ratio
- From: novice
- indicators of a good compression ratio
- Prev by Date: Re: separation of blocks in gzip
- Next by Date: Re: Understanding wavelet implementation
- Previous by thread: Re: indicators of a good compression ratio
- Next by thread: separation of blocks in gzip
- Index(es):
Relevant Pages
|
|
