✦ LIBER ✦

A chromatic adaptation transform and a colour inconstancy index

✍ Scribed by M. R. Luo; R. W. G. Hunt

Publisher: John Wiley and Sons
Year: 1998
Tongue: English
Weight: 53 KB
Volume: 23
Category: Article
ISSN: 0361-2317
DOI: 10.1002/(sici)1520-6378(199806)23:3<154::aid-col7>3.0.co;2-p

No coin nor oath required. For personal study only.

✦ Synopsis

A description is given of the Chromatic Adapta-Illuminant colour shifts can be calculated by using contion Transform, CMCCAT97, used in the recently adopted ventional colorimetric computations. To represent adapcolour appearance model, CIECAM97s, and the transtive colour shifts requires the availability of a chromatic form is used to derive a Colour Inconstancy Index, adaptation transform to provide corresponding colours 2 CMCCON97, for changes caused by the use of illuminants in an illuminant having a reference chromaticity. A pair of different chromaticities. A worked example is included.

of corresponding colours consists of a colour observed

📜 SIMILAR VOLUMES

Predicting corresponding colours using a

Predicting corresponding colours using a new chromatic-adaptation model

✍ Wen-Guey Kuo 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 102 KB

A new chromatic-adaptation model is proposed based on a law of coefficients was proposed by him 1 in the early twentieth century. His hypothesis assumes that to determine corresponding fundamental tristimulus values that elicit the same colour appearance over changes the visual mechanism has three f

Spatial contrast detection for colour pa

Spatial contrast detection for colour patterns under selective chromatic adaptation

✍ C. Bourdy; F. Vienot; A. Monot; A. Chiron 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 702 KB

A note on the line-distinguishing chroma

A note on the line-distinguishing chromatic number and the chromatic index of a graph

✍ N. Zagaglia Salvi 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB 👁 1 views

## Abstract Let λ(__G__) be the line‐distinguishing chromatic number and __x__′(__G__) the chromatic index of a graph __G__. We prove the relation λ(__G__) ≥ __x__′(__G__), conjectured by Harary and Plantholt. © 1993 John Wiley & Sons, Inc.

A construction of chromatic index critic

A construction of chromatic index critical graphs

✍ Hian Poh Yap 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB

## Abstract We prove that if __K__ is an undirected, simple, connected graph of even order which is of class one, regular of degree __p__ ≥ 2 and such that the subgraph induced by any three vertices is either connected or null, then any graph __G__ obtained from __K__ by splitting any vertex is __p

A note concerning the chromatic index of

A note concerning the chromatic index of multigraphs

✍ A. J. W. Hilton; Bill Jackson 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 214 KB

We improve an upper bound for the chromatic index of a multigraph due to Andersen and Gol'dberg. As a corollary w e deduce that if no t w o edges of multiplicity at least t w o in G are adjacent, then ,y'(G) s A ( G ) + 1. In addition w e generalize results concerning the structure of critical graph

The chromatic index of graphs with a spa

The chromatic index of graphs with a spanning star

✍ Mike Plantholt 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 468 KB 👁 1 views

## Abstract Vizing's Theorem states that any graph __G__ has chromatic index either the maximum degree Δ(__G__) or Δ(__G__) + 1. If __G__ has 2~s~ + 1 points and Δ(__G__) = 2s, a well‐known necessary condition for the chromatic index to equal 2~s~ is that __G__ have at most 2s^2^ lines. Hilton conj