Share Email Print

Proceedings Paper

Design of binary filters by sequential basis expansion
Author(s): Marion Jeanne; Stephen Marshall; Edward R. Dougherty
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

The mean-absolute error of an increasing binary window-based filter can be expressed in terms of the errors of the individual erosions that comprise its erosion representation. This can be done recursively, so that the error of an m-erosion filter can be represented via errors of k-erosion filter can be represented via errors of k- erosion filters, where k < m. The error representation can be used for filter design form sample realizations by estimating the errors of individual erosions and then recursively computing the errors of multiple-erosion filters. Even for modestly large windows, the method is limited to obtaining filters composed of a relatively small number of erosions because the optimal (m + 1)-erosion filter need not be a superset of the optimal m-erosion filter. This paper considers two suboptimal search strategies to achieve faster design, and thereby permit filters comprised of larger numbers of erosions. A strict sequential search strategy proceeds under the assumption that the optimal (m + 1)-erosion filter is a superset of the optimal m-erosion filter. A look-ahead search strategy, in which erosion structuring elements are occasionally deleted from the growing basis, is close to a strict sequential search in computational efficiency, and can result in improved filtering over a full search.

Paper Details

Date Published: 27 April 2001
PDF: 6 pages
Proc. SPIE 4303, Real-Time Imaging V, (27 April 2001); doi: 10.1117/12.424944
Show Author Affiliations
Marion Jeanne, Univ. of Strathclyde (United Kingdom)
Stephen Marshall, Univ. of Strathclyde (United Kingdom)
Edward R. Dougherty, Texas A&M Univ. (United States)

Published in SPIE Proceedings Vol. 4303:
Real-Time Imaging V
Nasser Kehtarnavaz, Editor(s)

© SPIE. Terms of Use
Back to Top