1984 search results - page 5 / 397 » The colourful feasibility problem |
ICIAR
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. A novel colour constancy algorithm that utilises both physical and statistical knowledge is introduced. A physics-based model of image formation is combined with a statis...
ICIP
2001
IEEE
14 years 11 months ago
2001
IEEE
Although widely studied for many years, colour quantisation remains a practical problem in image processing. Unlike previous works where the image can only be quantised after the ...
WG
2007
Springer
14 years 3 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...
CSCLP
2005
Springer
14 years 3 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...
ICIP
2008
IEEE
14 years 4 months ago
2008
IEEE
Connected operators are an important tool for the analysis of greyscale images. In extending them to colour and other vector images there are a number of issues that must be addre...