Sciweavers

4378 search results - page 7 / 876
» On the Complexity of Ordered Colourings
Sort
View
DM
2010
108views more  DM 2010»
13 years 7 months ago
Grundy number and products of graphs
The Grundy number of a graph G, denoted by (G), is the largest k such that G has a greedy k-colouring, that is a colouring with k colours obtained by applying the greedy algorithm...
Marie Asté, Frédéric Havet, C...
BMVC
2001
13 years 10 months ago
Mathematical Morphology in the HLS Colour Space
The HLS colour space is widely used in image analysis as it is physically intuitive. As the hue component of this space is defined on the unit circle, standard greyscale image an...
Allan Hanbury, Jean Serra
ICPR
2004
IEEE
14 years 8 months ago
Gaussian Noise Elimination in Colour Images by Vector-Connected Filters
This paper deals with the use of vector-connected filters for eliminating Gaussian noise in colour images. This class of morphological filters suppresses noise but preserves the c...
Fernando Torres Medina, Francisco Ortiz, Pablo Gil
CVPR
2004
IEEE
13 years 11 months ago
Midstream Content Access of Visual Pattern Coded Imagery
Multimedia retrieval is going to play an increasingly important role in the future. Since the availability of digital media seems ever rising, not only the retrieval performance i...
Gerald Schaefer
VCIP
2003
170views Communications» more  VCIP 2003»
13 years 9 months ago
How good are the visual MPEG-7 features?
The study presented in this paper analyses descriptions extracted with MPEG-7-descriptors from visual content from the statistical point of view. Good descriptors should generate ...
Horst Eidenberger