Say I have a float in the range of [0, 1] and I want to quantize and store it in an unsigned byte. Sounds like a no-brainer, but in fact it's quite complicated:
The obvious solution looks like this:
unsigned char QuantizeFloat(float a)
{
return (unsigned char)(a * 255.0f);
}
This works in so far that I get all numbers from 0 to 255, but the distribution of the integers is not even. The function only returns 255
if a is exactly 1.0f
. Not a good solution.
If I do proper rounding I just shift the problem:
unsigned char QuantizeFloat(float a)
{
return (unsigned char)(a * 255.0f + 0.5f);
}
Here the the result 0
only covers half of the float-range than any other number.
How do I do a quantization with equal distribution of the floating point range? Ideally I would like to get a equal distribution of integers if I quantize equally distributed random floats.
Any ideas?
Btw: Also my code is in C the problem is language-agnostic. For the non-C people: Just assume that float
to int
conversion truncates the float.
EDIT: Since we had some confusion here: I need a mapping that maps the smallest input float (0) to the smallest unsigned char, and the highest float of my range (1.0f) to the highest unsigned byte (255).
How about a * 256f
with a check to reduce 256 to 255? So something like:
return (unsigned char) (min(255, (int) (a * 256f)));
(For a suitable min function on your platform - I can't remember the C function for it.)
Basically you want to divide the range into 256 equal portions, which is what that should do. The edge case for 1.0 going to 256 and requiring rounding down is just because the domain is inclusive at both ends.