A lattice-based minimal gray-scale switching algorithm for obtaining the optimal increasing filter from the optimal filter Academic Article

abstract

• For binary window-based filters, the optimal increasing filter is often derived from the optimal unconstrained (nonincreasing) filter by iteratively switching the filter values at pixels from 0 to 1 or from 1 to 0 so as to make the resulting filter be the optimal increasing filter. This paper gives a corresponding switching algorithm for gray-scale nonlinear filters, and it does so in the context of finite lattices, which makes the algorithm applicable to computational morphology on lattices. The algorithm is minimal in the sense that it involves a minimal search if one wishes to be certain to obtain the optimal increasing filter when beginning with the optimal unconstrained filter.

authors

• Dougherty, Edward

published proceedings

• JOURNAL OF MATHEMATICAL IMAGING AND VISION

author list (cited authors)

• Dougherty, E. R.

citation count

• 0

complete list of authors

• Dougherty, ER

publication date

• July 2004

publisher

• Springer Nature  Publisher

published in

• Journal of Mathematical Imaging and Vision  Journal

keywords

• Aperture Filter
• Computational Morphology
• Nonlinear Filter
• Optimal Filter

Digital Object Identifier (DOI)

• 10.1023/B:JMIV.0000026556.21021.2a

start page

• 43

end page

• 52

volume

• 21

issue

• 1

URL

• http%3A%2F%2Fdx.doi.org%2F10.1023%2Fb%3Ajmiv.0000026556.21021.2a