- Restoration of color-quantized images in which error diffusion is involved is rarely addressed in the literature. Conventional restoration algorithms were generally proposed for ...
The problem of computing the chromatic number of a P5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show tha...
1 We address the problem of vector-valued image regularization with variational methods and PDE's. From the study of existing formalisms, we propose a unifying framework base...
Global color characterization is a very powerful tool to model in a simple yet discriminant way the visual appearance of complex objects. A fixed reference model of this type can ...
We are interested in the graph coloring problem. We propose an exact method based on a linear-decomposition of the graph. The complexity of this method is exponential according to...