Re: Encoding/decoding ranges of unsigned integers...
- From: d|dq <digital_don_quijote@xxxxxxxxx>
- Date: Thu, 18 Aug 2005 11:36:01 -0700
Hi Willem,
Thanks for contributing your thoughts and time. I answer your questions below...
Willem wrote:
In other words: It's okay to, say, sort the ranges ? Is there a minimum and maximum value to the integers ? Can the ranges overlap ?
There could be millions of ranges. Sorting them would take too long. (too long = longer than acceptable in a soft real-time system)
The minimum value would be 0.
The maximum value would be the greatest value you can store in an unsigned 64-bit integer. (as stated by C99)
) Is there a smart way to encode these ranges into a representation that ) would be both compact and efficient to encode/decode.
Sort the ranges in increasing order, calculate the differences/deltas, encode those with an arith coder or whatever.
I don't think sorting is an option. See above.
It rather depends on the distribution of those ranges and other factors.
I agree. I am sorry I have not been clear enough.
The distribution of the ranges is undetermined. I could only say this:
At time t1,
if you were to sort the ranges from left to right ([2,9] < [10,11] < etc.),
you would find the density of ranges is higher on the left side of the sorted sequence.
SaSW, Willem
.
- Follow-Ups:
- Re: Encoding/decoding ranges of unsigned integers...
- From: John Reiser
- Re: Encoding/decoding ranges of unsigned integers...
- References:
- Encoding/decoding ranges of unsigned integers...
- From: d|dq
- Re: Encoding/decoding ranges of unsigned integers...
- From: Willem
- Encoding/decoding ranges of unsigned integers...
- Prev by Date: Re: Compression of very large images
- Next by Date: Re: Encoding/decoding ranges of unsigned integers...
- Previous by thread: Re: Encoding/decoding ranges of unsigned integers...
- Next by thread: Re: Encoding/decoding ranges of unsigned integers...
- Index(es):
Relevant Pages
|