Efficient computation of two-dimensional Gaussian windows

Peter Meer

Research output: Contribution to journalArticlepeer-review


Kaiser (1987) described a fast recursive algorithm for computation of equidistant samples of a one-dimensional Gaussian function requiring only two multiplications per sampling point. We show that the algorithm remains valid for two-dimensional Gaussian windows and discuss its application to specific computer vision problems.

Original languageEnglish (US)
Pages (from-to)227-229
Number of pages3
JournalPattern Recognition Letters
Issue number4
StatePublished - Apr 1988

All Science Journal Classification (ASJC) codes

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence


  • Gaussian windows
  • fast filters
  • recursive computations


Dive into the research topics of 'Efficient computation of two-dimensional Gaussian windows'. Together they form a unique fingerprint.

Cite this