Sciweavers

3091 search results - page 2 / 619
» The Color Between Two Others
Sort
View
ESA
2007
Springer
113views Algorithms» more  ESA 2007»
14 years 5 days ago
Distance Coloring
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...
Alexa Sharp
HCI
2007
13 years 7 months ago
A Color Adjustment Method for Automatic Seamless Image Blending
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...
Xianji Li, Dongho Kim
ICPR
2008
IEEE
14 years 13 days ago
Assembly of puzzles by connecting between blocks
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...
Takenori Murakami, Fubito Toyama, Kenji Shoji, Jui...
PRL
2008
124views more  PRL 2008»
13 years 5 months ago
Modeling human color categorization
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. ...
ENDM
2006
96views more  ENDM 2006»
13 years 6 months ago
Exploring the complexity boundary between coloring and list-coloring
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...
Flavia Bonomo, Guillermo Durán, Javier Mare...