When we apply statistical compression algorithms such HUFFMAN on indexed images we know that pixels in such images contain index numbers that point to the RGB value in the color lookup table what are we compressed pixels or lookup table or both?
Asked
Active
Viewed 61 times
0
-
I'm not clear on what the question is. Can you split the question into multiple sentences? – usr Dec 16 '12 at 21:04
1 Answers
0
You can only compress a pixel p(x,y) when it is find in the same image multiple times and you can find a shorter value for that pixel. Hence when you doesn't break the pigeonhole principle in mathematics you can compress both the pixel and the lookup table.
Micromega
- 12,486
- 7
- 35
- 72