I read this but I'm not sure how it's done. Does he run an optimization step to select the palette that minimizes the error?
In that case I'd be cool to know the probability in finding a close enough image in that optimized space
In that case I'd be cool to know the probability in finding a close enough image in that optimized space
In the candidate stream, byte 0 is 4. The error is minimised if byte 2 is also 4. The values of the bytes don't matter, just the patterns of which bytes have the same value.