Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Summed-area table

Numerical Algorithm

A summed-area table is a data structure and algorithm for quickly summing the values in any rectangular part of a grid, and in image processing it is also called an integral image. Each cell of the table holds the sum of all values above and to the left of it, inclusive, and the whole table can be built in a single pass over the image. Once built, the sum over any rectangle needs exactly four array references, whatever the size of the rectangle. Frank Crow introduced it to computer graphics in 1984 for use with mipmaps, and it was popularized in computer vision by Lewis and then named the integral image and used prominently in the Viola-Jones object detection framework in 2001. The idea extends to higher dimensions and to higher powers of the image, which allows quick local variance, skewness and kurtosis, and an implementation may need a larger data type for the sums to avoid overflow.

Connections

In Field

Source Summed-area table (Wikipedia)
Source Summed-area table (Wikipedia)
Sources
Summed-area table (Wikipedia)
  • In Field: Computer Graphics, Lead, graphics
    It was introduced to computer graphics in 1984 by Frank Crow for use with mipmaps.
  • In Field: Computer Vision, Lead, vision
    In computer vision it was popularized by Lewis and then given the name
  • In Group: Signal Processing and Transforms, Lead, group
    quickly and efficiently generating the sum of values in a rectangular subset of a grid
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.