Finding of optimal binary morphological erosion filter via greedy and branch & bound searching
- 1 December 1996
- journal article
- Published by Springer Nature in Journal of Mathematical Imaging and Vision
- Vol. 6 (4) , 335-353
- https://doi.org/10.1007/bf00123351
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Efficient derivation of the optimal mean-square binary morphological filter from the conditional expectation via a switching algorithm for discrete power-set latticeCircuits, Systems, and Signal Processing, 1993
- Optimal morphological restoration: The morphological filter mean-absolute-error theoremJournal of Visual Communication and Image Representation, 1992
- An overview of median and stack filteringCircuits, Systems, and Signal Processing, 1992
- Optimal mean-square N-observation digital morphological filtersCVGIP: Image Understanding, 1992
- Hole spectrum: model-based optimization of morphological filtersPublished by SPIE-Intl Soc Optical Eng ,1991
- Using structuring-element libraries to design suboptimal morphological filtersPublished by SPIE-Intl Soc Optical Eng ,1991
- Conditional-expectation-based implementation of the optimal mean-square binary morphological filterPublished by SPIE-Intl Soc Optical Eng ,1991
- A representation theory for morphological image and signal processingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Morphological filters--Part I: Their set-theoretic analysis and relations to linear shift-invariant filtersIEEE Transactions on Acoustics, Speech, and Signal Processing, 1987
- Bounds on the Number of Pseudothreshold FunctionsIEEE Transactions on Computers, 1971