Alpha compositing

In computer graphics, alpha compositing or alpha blending is the process of combining one image with a background to create the appearance of partial or full transparency.[1] It is often useful to render picture elements (pixels) in separate passes or layers and then combine the resulting 2D images into a single, final image called the composite. Compositing is used extensively in film when combining computer-rendered image elements with live footage. Alpha blending is also used in 2D computer graphics to put rasterized foreground elements over a background.

This color spectrum image's alpha channel falls off to zero at its base, where it is blended with the background color.

In order to combine the picture elements of the images correctly, it is necessary to keep an associated matte for each element in addition to its color. This matte layer contains the coverage information—the shape of the geometry being drawn—making it possible to distinguish between parts of the image where something was drawn and parts that are empty.

Although the most basic operation of combining two images is to put one over the other, there are many operations, or blend modes, that are used.


To store matte information, the concept of an alpha channel was introduced by Alvy Ray Smith in the late 1970s and fully developed in a 1984 paper by Thomas Porter and Tom Duff.[2] In a 2D image a color combination is stored for each picture element (pixel). Additional data for each pixel is stored in the alpha channel with a value ranging from 0 to 1. A value of 0 means that the pixel is fully transparent and does not provide any coverage information; i.e. there is no occlusion at the image pixel window because the geometry did not overlap this pixel. A value of 1 means that the pixel is fully opaque because the geometry completely overlaps the pixel window.

With the existence of an alpha channel, it is possible to express compositing image operations using a compositing algebra. For example, given two images A and B, the most common compositing operation is to combine the images so that A appears in the foreground and B appears in the background. This can be expressed as A over B. In addition to over, Porter and Duff defined the compositing operators in, held out by (the phrase refers to holdout matting and is usually abbreviated out), atop, and xor (and the reverse operators rover, rin, rout, and ratop) from a consideration of choices in blending the colors of two pixels when their coverage is, conceptually, overlaid orthogonally:


As an example, the over operator can be accomplished by applying the following formula to each pixel:


Here  ,   and   stand for the color components of the pixels in the result, image A and image B respectively, applied to each color channel (red/green/blue) individually, whereas  ,   and   are the alpha values of the respective pixels.

The over operator is, in effect, the normal painting operation (see Painter's algorithm). Bruce A. Wallace derived the over operator based on a physical reflectance/transmittance model, as opposed to Duff's geometrical approach.[3] The in and out operators are the alpha compositing equivalent of clipping. The two use only the alpha channel of the second image and ignore the color components.

Straight versus premultipliedEdit

If an alpha channel is used in an image, there are two common representations that are available: straight (unassociated) alpha and premultiplied (associated) alpha.

With straight alpha, the RGB components represent the color of the object or pixel, disregarding its opacity.

With premultiplied alpha, the RGB components represent the emission of the object or pixel, and the alpha represents the occlusion. The over operator then becomes:


A more obvious advantage of this is that, in certain situations, it can save a subsequent multiplication (e.g. if the image is used many times during later compositing). However, the most significant advantages of using premultiplied alpha are for correctness and simplicity rather than performance: premultiplied alpha allows correct filtering and blending. In addition, premultiplied alpha allows regions of regular alpha blending and regions with additive blending mode to be encoded within the same image.[4]

Assuming that the pixel color is expressed using straight (non-premultiplied) RGBA tuples, a pixel value of (0, 0.7, 0, 0.5) implies a pixel that has 70% of the maximum green intensity and 50% opacity. If the color were fully green, its RGBA would be (0, 1, 0, 0.5).

However, if this pixel uses premultiplied alpha, all of the RGB values (0, 0.7, 0) are multiplied, or scaled for occlusion, by the alpha value 0.5, which is appended to yield (0, 0.35, 0, 0.5). In this case, the 0.35 value for the G channel actually indicates 70% green emission intensity (with 50% occlusion). A pure green emission would be encoded as (0, 0.5, 0, 0.5). Knowing whether a file uses straight or premultiplied alpha is essential to correctly process or composite it, as a different calculation is required. It is also entirely acceptable to have an RGBA triplet express emission with no occlusion, such as (0.4, 0.3, 0.2, 0.0). Fires and flames, glows, flares, and other such phenomena can only be represented using associated / premultiplied alpha.

The only important difference is in the dynamic range of the color representation in finite precision numerical calculations (which is in all applications): premultiplied alpha has a unique representation for transparent pixels, avoiding the need to choose a "clear color" or resultant artifacts such as edge fringes (see the next paragraphs). In an associated / premultiplied alpha image, the RGB represents the emission amount, while the alpha is occlusion. Premultiplied alpha has some practical advantages over normal alpha blending because interpolation and filtering give correct results.[5]

Ordinary interpolation without premultiplied alpha leads to RGB information leaking out of fully transparent (A=0) regions, even though this RGB information is ideally invisible. When interpolating or filtering images with abrupt borders between transparent and opaque regions, this can result in borders of colors that were not visible in the original image. Errors also occur in areas of semitransparency because the RGB components are not correctly weighted, giving incorrectly high weighting to the color of the more transparent (lower alpha) pixels.

Premultiplication can reduce the available relative precision in the RGB values when using integer or fixed-point representation for the color components, which may cause a noticeable loss of quality if the color information is later brightened or if the alpha channel is removed. In practice, this is not usually noticeable because during typical composition operations, such as OVER, the influence of the low-precision color information in low-alpha areas on the final output image (after composition) is correspondingly reduced. This loss of precision also makes premultiplied images easier to compress using certain compression schemes, as they do not record the color variations hidden inside transparent regions, and can allocate fewer bits to encode low-alpha areas. The same “limitations” of lower quantisation bit depths such as 8 bit per channel are also present in imagery without alpha, and this argument is problematic as a result.

Gamma correctionEdit

Alpha blending, not taking into account gamma correction
Alpha blending, taking into account gamma correction.

The RGB values of typical digital images do not directly correspond to the physical light intensities, but are rather compressed by a gamma correction function:


This transformation better utilizes the limited number of bits in the encoded image by choosing   that better matches the non-linear human perception of luminance.

Accordingly, computer programs that deal with such images must decode the RGB values into a linear space (by undoing the gamma-compression), blend the linear light intensities, and re-apply the gamma compression to the result:[6][7]


When combined with premultiplied alpha, pre-multiplication is done in linear space, prior to gamma compression.[8] This results in the following formula:


Note that only the color components undergo gamma-correction; the alpha channel is always linear.

Other transparency methodsEdit

Although used for similar purposes, transparent colors and image masks do not permit the smooth blending of the superimposed image pixels with those of the background (only whole image pixels or whole background pixels allowed).

A similar effect can be achieved with a 1-bit alpha channel, as found in the 16-bit RGBA high color mode of the Truevision TGA image file format and related TARGA and AT-Vista/NU-Vista display adapters' high color graphic mode. This mode devotes 5 bits for every primary RGB color (15-bit RGB) plus a remaining bit as the "alpha channel".

Screendoor transparency can be used to simulate partial occlusion where only 1-bit alpha is available.

For some applications, a single alpha channel is not sufficient: a stained-glass window, for instance, requires a separate transparency channel for each RGB channel to model the red, green and blue transparency separately. More alpha channels can be added for accurate spectral color filtration applications.

Analytical derivation of the over operatorEdit

A third approach is found by starting out with two very simple assumptions. For simplicity, we shall here use the shorthand notation   for representing the over operator.

The first assumption is that in the case where the background is opaque (i.e.  ), the over operator represents the convex combination of   and  :


The second assumption is that the operator must respect the associative rule:


Now, let us assume that   and   have variable transparencies, whereas   is opaque. We're interested in finding


We know from the associative rule that the following must be true:


We know that   is opaque and thus follows that   is opaque, so in the above equation, each   operator can be written as a convex combination:


Hence we see that this represents an equation of the form  . By setting   and   we get


which means that we have analytically derived a formula for the output alpha and the output color of  .

An even more compact representation is given by noticing that  :


The   operator fulfills all the requirements of a non-commutative monoid, where the identity element   is chosen such that   (i.e. the identity element can be any tuple   with  ).

See alsoEdit


  1. ^ "Definition of alpha blending". PCMAG. Retrieved 2021-08-07.
  2. ^ Porter, Thomas; Duff, Tom (July 1984). "Compositing Digital Images" (PDF). SIGGRAPH Computer Graphics. New York City, New York: ACM Press. 18 (3): 253–259. doi:10.1145/800031.808606. ISBN 9780897911382. Archived (PDF) from the original on 2011-04-29. Retrieved 2019-03-11.
  3. ^ Wallace, Bruce A. (1981). "Merging and transformation of raster images for cartoon animation". SIGGRAPH Computer Graphics. New York City, New York: ACM Press. 15 (3): 253–262. CiteSeerX doi:10.1145/800224.806813. ISBN 0-89791-045-1.
  4. ^ "TomF's Tech Blog - It's only pretending to be a wiki". Archived from the original on 12 December 2017. Retrieved 8 May 2018.
  5. ^ "ALPHA COMPOSITING – Animationmet". Archived from the original on 2019-09-25. Retrieved 2019-09-25.
  6. ^ Minute Physics (March 20, 2015). "Computer Color is Broken". YouTube. Archived from the original on 2021-11-22.
  7. ^ Novak, John (September 21, 2016). "What every coder should know about gamma".
  8. ^ "Gamma Correction vs. Premultiplied Pixels – Søren Sandmann Pedersen".

External linksEdit