Introduction to Color - Brown University

More documents

Recommendations

Info

$A LATEX Package to Prepare Author and Affiliation Blocks$

CS123 | INTRODUCTION TO COMPUTER GRAPHICS Color Matching (2/3) But any three primaries R, G and B can’t match all visible colors (for reasons we’ll be exploring soon) Sometimes need to add/subtract some R to sample you are trying to match. 0 250 20 50 220 200 40 0 0 Try for yourself! Try matching target color with λ = 500. Impossible to do so by only adding R, G, and B: http://graphics.stanford.edu/courses/cs178/applets/colormatching.html Andries van Dam Color 52/57
CS123 | INTRODUCTION TO COMPUTER GRAPHICS Color Matching (3/3) Color-matching functions, showing amounts of three primaries needed by average observer to match a color of constant luminance, for all values of dominant wavelength in visible spectrum. Note: these are NOT response functions! (and they have non-zero tails) Negative value of red f => cannot match, must “subtract,” i.e., add that amount to l unknown Mixing positive amounts of arbitrary R, G, B primaries provides large color gamut, e.g., display devices, but no device based on a finite number of primaries can show all colors! (as we’ll see, n primaries define a convex hull which can’t cover the visible gamut) Andries van Dam Color 53/57
Page 1 and 2: CS123 INTRODUCTION TO COMPUTER GRAP
Page 3 and 4: CS123 | INTRODUCTION TO COMPUTER GR
Page 51: CS123 | INTRODUCTION TO COMPUTER GR
Page 57: CS123 | INTRODUCTION TO COMPUTER GR

Introduction to Color - Brown University

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?