Search results for "COLOR"

Study of plastic deformation modes in zirconium by color image analysis

2004

Abstract Twinning, as a deformation mode, is a complement to slip. This paper deals with the study from a qualitative point of view, as well as from a quantitative one. Besides techniques widely used in materials science studies such as electron backscattered diffraction (EBSD) or X-ray diffraction (XRD), colour image analysis technique are presented here. Its results manage to confirm or complete the ones obtained, thanks to others methods.

Ensemble Planning for Digital Audio Broadcasting

2003

MLP Neural Network Implementation on a SIMD Architecture

2002

An Automatic Road Sign Recognition System {A(RS)2} is aimed at detection and recognition of one or more road signs from realworld color images. The authors have proposed an A(RS)2 able to detect and extract sign regions from real world scenes on the basis of their color and shape features. Classification is then performed on extracted candidate regions using Multi-Layer Perceptron neural networks. Although system performances are good in terms of both sign detection and classification rates, the entire process requires a large computational time, so real-time applications are not allowed. In this paper we present the implementation of the neural layer on the Georgia Institute of Technology …

Depth Map Generation by Image Classification

2004

This paper presents a novel and fully automatic technique to estimate depth information from a single input image. The proposed method is based on a new image classification technique able to classify digital images (also in Bayer pattern format) as indoor, outdoor with geometric elements or outdoor without geometric elements. Using the information collected in the classification step a suitable depth map is estimated. The proposed technique is fully unsupervised and is able to generate depth map from a single view of the scene, requiring low computational resources.

An exact method for graph coloring

2006

International audience; 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 the linearwidth of the entry graph, but linear according to its number of vertices. We present some experiments performed on literature instances, among which COLOR02 library instances. Our method is useful to solve more quickly than other exact algorithms instances with small linearwidth, such as mug graphs. Moreover, our algorithms are the first to our knowledge to solve the COLOR02 instance 4-Inser_3 with an exact method.

Distance graphs and the T-coloring problem

1999

Abstract The T-coloring problem is, given a graph G = (V, E), a set T of nonnegative integers containing 0, and a ‘span’ bound s ⩾ 0, to compute an integer coloring f of the vertices of G such that |f(ν) − f(w)| ∉ T ∀νw ∈ E and max f − min f ⩽ s. This problem arises in the planning of channel assignments for broadcast networks. When restricted to complete graphs, the T-coloring problem boils down to a number problem which can be solved efficiently for many types of sets T. The paper presents results indicating that this is not the case if the set T is arbitrary. To these ends, the class of distance graphs is introduced, which consists of all graphs G : G ≅ G(A) for some (finite) set of posi…

Grundy coloring for power graphs

2003

International audience

Chromatic Sums for Colorings Avoiding Monochromatic Subgraphs

2013

Abstract Given graphs G and H, a vertex coloring c : V ( G ) → N is an H-free coloring of G if no color class contains a subgraph isomorphic to H. The H-free chromatic number of G, χ ( H , G ) , is the minimum number of colors in an H-free coloring of G. The H-free chromatic sum of G , Σ ( H , G ) , is the minimum value achieved by summing the vertex colors of each H-free coloring of G. We provide a general bound for Σ ( H , G ) , discuss the computational complexity of finding this parameter for different choices of H, and prove an exact formulas for some graphs G. For every integer k and for every graph H, we construct families of graphs, G k with the property that k more colors than χ ( …

Dichotomies properties on computational complexity of S-packing coloring problems

2015

This work establishes the complexity class of several instances of the S -packing coloring problem: for a graph G , a positive integer k and a nondecreasing list of integers S = ( s 1 , ? , s k ) , G is S -colorable if its vertices can be partitioned into sets S i , i = 1 , ? , k , where each S i is an s i -packing (a set of vertices at pairwise distance greater than s i ). In particular we prove a dichotomy between NP-complete problems and polynomial-time solvable problems for lists of at most four integers.

Logical definability of NP-optimisation problems with monadic auxiliary predicates

1993

Given a first-order formula ϕ with predicate symbols e1...el, so,...,sr, an NP-optimisation problem on -structures can be defined as follows: for every -structure G, a sequence of relations on G is a feasible solution iff satisfies ϕ, and the value of such a solution is defined to be ¦S0¦. In a strong sense, every polynomially bounded NP-optimisation problem has such a representation, however, it is shown here that this is no longer true if the predicates s1, ...,sr are restricted to be monadic. The result is proved by an Ehrenfeucht-Fraisse game and remains true in several more general situations.