Constrained Palette-Space Exploration

Nicolas Mellado, David Vanderhaeghe, Charlotte Hoarau, Sidonie Christophe, Mathieu Brédif, Loic Barthe.
ACM Trans. Graph. 36, 4, Article 0304 (July 2017), 14 pages.

Color palettes are widely used by artists to define colors of artworks and explore color designs. In general, artists select the colors of a palette by following a set of rules, e.g. contrast or relative luminance. Existing interactive
palette exploration tools explore palette spaces following limited constraints defined as geometric configurations in color space e.g. harmony rules on the color wheel. Palette search algorithms sample palettes from color relations learned from an input dataset, however they cannot provide interactive user edits and palette refinement.

We introduce in this work a new versatile formulation enabling the creation of constraint-based interactive palette exploration systems. Our technical contribution is a graph-based palette representation, from which we define palette exploration as a minimization problem that can be solved efficiently and provide real-time feedback. Based on our formulation, we introduce two interactive palette exploration strategies: constrained palette exploration, and for the first time, constrained palette interpolation. We demonstrate the performances of our approach on various application cases and evaluate how it helps users finding trade-offs between concurrent constraints.


a) In this work we represent the color relations (e.g. shades, anchors and contrasts) of an input palette as a constraint hypergraph (b), from which we derive two optimization-based exploration strategies. c) While the user manipulates a color, here the sweater color, the palette is updated to satisfy the constraints stored in the hypergraph. d) Given two input palettes, we compute continuous color interpolation paths to smoothly blend between the two inputs while preserving their interpolated constraints.


additional materials