Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1, 2, . . . , k} such that any two vertices within distance d of each other are assigned di...
In this paper we present a stable automatic system for image composition, which can well control the color difference between two images, and produce a seamless composite image wit...
In this paper, we proposed a method for solving the rectangle piece jigsaw puzzle assembly problem. A shape of a piece is a rectangle, and a puzzle image is RGB full color. The as...
Color matching in Content-Based Image Retrieval is done using a color space and measuring distances between colors. Such an approach yields nonintuitive results for the user. We i...
Egon L. van den Broek, Theo E. Schouten, P. M. F. ...
Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring proble...