72 search results - page 1 / 15 » Colour Naming considering the Colour Variability Problem |
56
Voted
CYS
2000
15 years 1 months ago
2000
ECCV
1998
Springer
16 years 3 months ago
1998
Springer
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...
IJON
2006
15 years 1 months ago
2006
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...
CSCLP
2005
Springer
15 years 7 months ago
2005
Springer
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...
WG
2007
Springer
15 years 8 months ago
2007
Springer
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...