Sciweavers

72 search results - page 1 / 15
» Colour Naming considering the Colour Variability Problem
Sort
View
CYS
2000
72views more  CYS 2000»
13 years 6 months ago
Colour Naming considering the Colour Variability Problem
Robert Benavente, Ramon Baldrich, María C. ...
ECCV
1998
Springer
14 years 9 months ago
Is Machine Colour Constancy Good Enough?
This paper presents a negative result: current machine colour constancy algorithms are not good enough for colour-based object recognition. This result has surprised us since we ha...
Brian V. Funt, Kobus Barnard, Lindsay Martin
IJON
2006
82views more  IJON 2006»
13 years 7 months ago
Ratio rule and homomorphic filter for enhancement of digital colour image
Digital colour image enhancement using a homomorphic filter provides good dynamic range compression, but it fails in colour rendition. In this letter, we propose to perform natura...
Ming-Jung Seow, Vijayan K. Asari
CSCLP
2005
Springer
14 years 17 days ago
Partitioning Based Algorithms for Some Colouring Problems
We discuss four variants of the graph colouring problem, and present algorithms for solving them. The problems are k-Colourability, Max Ind k-COL, Max Val k-COL, and, finally, Max...
Ola Angelsmark, Johan Thapper
WG
2007
Springer
14 years 1 months ago
Mixing 3-Colourings in Bipartite Graphs
For a 3-colourable graph G, the 3-colour graph of G, denoted C3(G), is the graph with node set the proper vertex 3-colourings of G, and two nodes adjacent whenever the correspondi...
Luis Cereceda, Jan van den Heuvel, Matthew Johnson