Share Email Print
cover

Proceedings Paper

Efficient algorithm for Gaussian blur using finite-state machines
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

2D Gaussian blur operations are used in many image processing applications. The execution times of these operations can be rather long, especially where large kernels are involved. Proper use of two properties of Gaussian blurs can help to reduce these long execution times: (1) Large kernels can be decomposed into the sequential application of small kernels. (2) Gaussian blurs are separable into row and column operations. This paper makes use of both of these characteristics and adds a third one: (3) The row and column operations can be formulated as finite-state machines to produce highly efficient code and, for multi-step decompositions, eliminate writing to intermediate images. This paper shows the FSM formulation of the Gaussian blur for the general case and provides examples. Speed comparisons between various implementations are provided for some of the examples. The emphasis is on software implementations, but implementations in pipelined hardware are also discussed. Straightforward extensions of these concepts to 3- and higher-dimensional image processing are also presented. Implementation techniques for DOG (Difference-of-Gaussian filters) are also provided.

Paper Details

Date Published: 6 October 1998
PDF: 8 pages
Proc. SPIE 3521, Machine Vision Systems for Inspection and Metrology VII, (6 October 1998); doi: 10.1117/12.326976
Show Author Affiliations
Frederick M. Waltz, Consultant (United States)
John W. V. Miller, Univ. of Michigan/Dearborn (United States)


Published in SPIE Proceedings Vol. 3521:
Machine Vision Systems for Inspection and Metrology VII
Bruce G. Batchelor; John W. V. Miller; Susan Snell Solomon, Editor(s)

© SPIE. Terms of Use
Back to Top