Patent ID: 8294953

Claim:
A non-transitory computer-readable medium having one or more computer programs stored thereon executable by one or more processors to perform a method to compress a color look-up table (CLUT) in a lossless manner, the method comprising: receiving the CLUT in a serialized node-by-node manner, the CLUT comprising a plurality of nodes, each node converting a value of a first color space to a corresponding value of a second color space; for each of some of the nodes of the CLUT, in an order in which the nodes of the CLUT are received in the serialized node-by-node manner, determining a difference value of the node from which the corresponding value of the second color space of the node is recoverable utilizing one or more of previously serialized nodes, in accordance with a hierarchical differential encoding approach or in accordance with a cellular interpolative prediction approach; and, storing the difference value in lieu of storing the corresponding value of the second color space of the node, to compress the corresponding value of the second color space of the node in the lossless manner, wherein the nodes of the CLUT are organized within a multi-dimensional volume having at least three dimensions, wherein the CLUT is received in the serialized node-by-node manner on a level-by-level basis over a plurality of levels from a coarsest level representing a greatest distance among nodes and a finest level representing a least distance among nodes, and wherein each level other than the coarsest level represents a sub-volume within the multi-dimensional volume.