| 摘要 |
A color look-up table (CLUT) is compressed in a lossless manner. The CLUT includes nodes that convert values of a first color space to corresponding values of a second color space. The CLUT is received in a serialized node-by-node manner. For each of some of the nodes, the following is performed in the order in which the nodes are received in the serialized node-by-node manner. First, a difference value is determined that represents compression of a value of the node, in accordance with a hierarchical differential encoding approach or in accordance with a cellular interpolative prediction approach. Second, the difference value is stored in lieu of the value of the node being stored, to compress the value of the node in the lossless manner. |
