Fast Summed-Area Table Generation and its Applications

@article{Hensley2005FastST,
  title={Fast Summed-Area Table Generation and its Applications},
  author={Justin Hensley and Thorsten Scheuermann and Greg Coombe and Montek Singh and Anselmo Lastra},
  journal={Comput. Graph. Forum},
  year={2005},
  volume={24},
  pages={547-555}
}
We introduce a technique to rapidly generate summed-area tables using graphics hardware. Summed area tables, originally introduced by Crow, provide a way to filter arbitrarily large rectangular regions of an image in a constant amount of time. Our algorithm for generating summed-area tables, similar to a technique used in scientific computing called recursive doubling, allows the generation of a summed-area table in O(log n) time. We also describe a technique to mitigate the precision… CONTINUE READING
BETA

Citations

Publications citing this paper.
SHOWING 1-10 OF 118 CITATIONS, ESTIMATED 32% COVERAGE

366 Citations

02040'07'10'13'16'19
Citations per Year
Semantic Scholar estimates that this publication has 366 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-10 OF 10 REFERENCES

Summed area tables using graphics hardware

  • S. GREENE
  • Game Developers Conference,
  • 2003

Filtering by repeated integration

  • P S.
  • Proceedings of the 13th annual conference on…
  • 1986

An analysis of the recursive doubling algorithm

  • P. DUBOIS, G. RODRIGUE
  • In High Speed Computer and Algorithm Organization
  • 1977

Similar Papers

Loading similar papers…