User:Lenehey/Color Cell Compression

This is not a Wikipedia article: It is an individual user's work-in-progress page, and may be incomplete and/or unreliable. For guidance on developing this draft, see Wikipedia:So you made a userspace draft.

Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL
Easy tools: Citation bot (help) | Advanced: Fix bare URLs
This page was last edited by Timrollpickering (talk | contribs) 5 years ago. (Update timer)

Finished writing a draft article? Are you ready to request an experienced editor review it for possible inclusion in Wikipedia? Submit your draft for review!

Color Cell Compression is an algorithm for highly compressing image data. The algorithm as introduced ^[1] includes three steps for encoding:

The image is decomposed into Red, Green, Blue, and Luminance (R, G, B, Y) planes, and each plane is divided into cells of 4 pixels by 4 pixels. The values for the Y plane can be obtained from the R, G, and B, values as follows:

Y(i) = .3R(i) + .59G(i) + .11B(i)

References

^ Graham Campbell, et al., "Two bit/pixel full color encoding," International Conference on Computer Graphics and Interactive Techniques archive, Proceedings of the 13th annual conference on Computer graphics and interactive techniques, 1986, pp. 215 - 223, 1986, ISBN:0-89791-196-2

External links

example.com

[1] Graham Campbell, et al., "Two bit/pixel full color encoding," International Conference on Computer Graphics and Interactive Techniques archive, Proceedings of the 13th annual conference on Computer graphics and interactive techniques, 1986, pp. 215 - 223, 1986, ISBN:0-89791-196-2

[1]