A switching algorithm for design of optimal increasing binary filters over large windows
- 30 June 2000
- journal article
- Published by Elsevier in Pattern Recognition
- Vol. 33 (6) , 1059-1081
- https://doi.org/10.1016/s0031-3203(99)00165-x
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Enhancement and Restoration of Digital Documents: Statistical Design of Nonlinear AlgorithmsPublished by SPIE-Intl Soc Optical Eng ,1997
- Finding of optimal binary morphological erosion filter via greedy and branch & bound searchingJournal of Mathematical Imaging and Vision, 1996
- Precision of morphological-representation estimators for translation-invariant binary filters: Increasing and nonincreasingSignal Processing, 1994
- Optimal morphological restoration: The morphological filter mean-absolute-error theoremJournal of Visual Communication and Image Representation, 1992
- Unification of nonlinear filtering in the context of binary logical calculus, part I: Binary filtersJournal of Mathematical Imaging and Vision, 1992
- Optimal mean-square N-observation digital morphological filtersCVGIP: Image Understanding, 1992
- Facilitation of optimal binary morphological filter design via structuring element libraries and design constraintsOptical Engineering, 1992
- Minimal Representations for Translation-Invariant Set Mappings by Mathematical MorphologySIAM Journal on Applied Mathematics, 1991
- Morphological filters--Part I: Their set-theoretic analysis and relations to linear shift-invariant filtersIEEE Transactions on Acoustics, Speech, and Signal Processing, 1987
- On Dedekind's Problem: The Number of Isotone Boolean Functions. IITransactions of the American Mathematical Society, 1975