Despite digital images are often given in RGB, RGB is not always a convenient space for image processing. Splitting RGB colors into their luminance and chrominance, and doing the opposite, are very common operations when it comes to image filtering.

The *Yxy* encoding is a very good solution due to its strong physical/perceptual background. One can go from RGB to XYZ (selecting a certain color-space transform matrix), and then go from XYZ to Yxy using the following formulas:

The inverse transform to go from Yxy to XYZ is given by the following formulas:

The color-space transform matrix that turns RGB values into XYZ values (and its inverse) is a simple 3×3 affine transform matrix. The exact values of the matrix depend on the color-space you are working in. For example, the matrix for sRGB can be found in the Wikipedia sRGB page. Actually, one can build a custom RGB-to-XYZ matrix by defining the xy coordinates of the three primary colors (R, G, and B) and the position of the white-point. There is an excellent explanation of this on this page by Ryan Juckett.

XYZ colors, and the Yxy encoding have some very interesting practical properties. Below are some of them.

**1- All human-visible colors have positive X, Y, and Z values.**

This means that matrices to go from RGB to XYZ can only have positive coefficients, and a valid (positive) RGB color can only map to a positive XYZ triplet. The opposite is generally not true.

**2- The Y value of an XYZ color represents the relative luminance of the color as percieved by the human eye.**

So if one computes the Y (luminance) field of an RGB image, one gets a grayscale version of the original image.

**3- Y (luminance) and xy (chrominance) are fully independent.**

This means that if one encodes an RGB color in Yxy, then amplifies or diminishes the luminance *Y’=k·Y*, and then go back to RGB from Y’xy, the result is *k·RGB*.

This is a *fundamental* property in tonemapping algorithms, which typically do range compression on the luminance, and then just re-plug the original chrominance field to the compressed luminance field.

This property also means that one can do any alteration on the chrominance values (xy) and then go back to RGB while preserving the original luminance (Y). This comes handy when implementing image filters such as *Tint* (xy rotation around the whitepoint) or *Saturation* (xy amplification away from the whitepoint).

**4- The range of Y is [0..INF), but the range of xy is constrained to [0..1]x[0..1].**

Since the chrominance values (xy) are *normalized* they are independent of the luminance value, and hence they have a limited range. Here’s what happens when one selects a fixed luminance (*Y=1*, for example) and draws the RGB colors corresponding to all the chrominances in *x=[0..1]* and *y=[0..1]*:

The darkened colors are invalid (not plausible) results where at least one of the RGB components is negative. So the only valid values that xy can get are actually constrained to this triangle, which is, in fact, much smaller than the unit square. As a matter of fact, the maximum distance between two chrominance values in Yxy (in sRGB as displayed above) is around *0.6*, derived from the length of the longest edge of the gamut triangle.

Different color-space transforms have larger or smaller gamut triangles, as depicted in this CIE 1931 xy gamut comparison.

Note that the gamut triangle is the same regardless of the color luminance.