Back to results
US 2013/0076778 A1Published application
Color lookup table smoothing employing node adjustment propagation
AssigneeHewlett-Packard Development Company, L.P.
InventorsPeter Morovic, Jan Morovic, Manuel Ángel Albarrán Moyo
Life of this patent
Estimating the term…
Abstract
Color lookup table smoothing employs propagation of a portion of an adjustment of a modified node to an unmodified node of a color lookup table (CLUT).
Claims20
A method of smoothing a color lookup table, the method comprising:
- identifying a modified node of the color lookup table (CLUT);
- locating a neighboring node to the modified node, the located neighboring node being unmodified;
- and
- propagating a portion of an adjustment of the modified node to the located unmodified neighboring node.
1 more element
A method of color lookup table smoothing, the method comprising:
- providing a modified color lookup table (CLUT) having a node that is modified;
- comparing the modified CLUT to a corresponding CLUT that is unmodified to identify the modified node and nodes in the CLUT that are unmodified;
- and
- propagating to an identified unmodified node a portion of an adjustment in each modified node of a plurality of the modified nodes that neighbor the identified unmodified node,
- wherein the propagated portions of the adjustments are inversely proportional to a relative distance between the identified unmodified node and respective ones of the neighboring modified nodes.
2 more elements
A color lookup table smoothing system comprising:
- a memory;
- and
- a computer program stored in the memory to be executed by a processor, the computer program comprising instructions that, when executed, implement identifying a modified node of a color lookup table (CLUT), locating a neighboring node to the modified node, the neighboring node being unmodified, and propagating a portion of an adjustment of the modified node to the unmodified neighboring node, wherein the propagated portion of the adjustment is inversely proportional to a relative distance between the modified node and the unmodified neighboring node.
Dependencies are inferred from the claim text.