Abstract
We propose a method to assign vivid colors to regions of an oversegmented image. We restrict the output colors to those found in an input palette, and seek to preserve the recognizability of structure in the image. Our strategy is to match the color distances between the colors of adjacent regions with the color differences between the assigned palette colors; thus, assigned colors may be very far from the original colors, but both large local differences (edges) and small ones (uniform areas) are maintained. We use the widest path algorithm on a graph-based structure to obtain a spanning tree over the set of regions, then traverse the tree to assign colors in a greedy fashion. Our method produces vivid recolorings of region-based abstraction using arbitrary palettes. We demonstrate a set of stylizations that can be generated by our algorithm.
