Timeline for A continuous function for defining unique values to a 1024x1024 image with a 24 bit 3 color channel image
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 25, 2014 at 1:44 | comment | added | David | Also, just to clarify, its not a change of one bit per channel that is the restraint. Its that the value may not change more than 1 in value. So a pixel with a red value of 10 may have direct neighbors of either 9, 10 or 11. | |
| Sep 25, 2014 at 1:39 | comment | added | David | I was unfamiliar with Gray Codes. Looking at them, it became apparent that this would unfortunately not work. The reason being that this is an engineering problem and we have no control over some parts of the generating software and the graphics hardware. Because of this, we cannot interpret this as Gray codes and going from a number like 0010 to 0110 would be a jump of 4. The sub-pixel value between these two pixels could then be interpreted as any value in between which would not map to the correct position. Let me know if this does not make sense or you feel I am incorrect. Thanks! | |
| Sep 25, 2014 at 1:19 | comment | added | David | I think i may have jumped too quickly and not understood what you were saying. I am going to try and implement this. I will either accept the answer or edit my question including a picture of why this doesn't work after I test. | |
| Sep 24, 2014 at 20:44 | comment | added | ARupinski | It is worth noting that if you want to allow more than one channel at a time to change in each direction, but still maintain that at most 1 bit changes within each channel, you can start with a pair of (8,4)-Gray Codes, one for each direction. Then, for example, let the $R$-channel bits be determined by the high bits of each of the 8 symbols (thought of as elements of $\{0,1\}^3$) coming from the two codes, and similarly the $G$-channel bits be determined by the middle bits, and the $B$-channel bits determined by the low bits. | |
| Sep 24, 2014 at 20:28 | history | answered | ARupinski | CC BY-SA 3.0 |