Changes between Version 21 and Version 22 of img2twit
- Timestamp:
- 05/27/2009 09:53:27 PM (16 years ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
img2twit
v21 v22 109 109 I use 16 values for the X and Y position of a point within a cell, and 6 values for each R, G and B component. This uses roughly 15.755 bits. There is a way to reduce this value down to 15.252 bits by accounting for the fact that two points within a cell are interchangeable, but I have not yet found an elegant way to remove the duplicate information without butchering a lot of code. 110 110 111 However, what the algorithm does is try to use any extra bits at the end by increasing the G component. If this succeeds, it tries to increase the B component, and so on. Using this technique, one can be sure that no more than 13 bits are wasted. 112 111 113 == Algorithm seed == 112 114