Efficient derivation of the optimal mean-square binary morphological filter from the conditional expectation via a switching algorithm for discrete power-set lattice
From MaRDI portal
Publication:2366535
DOI10.1007/BF01223318zbMath0775.93268OpenAlexW2013004461MaRDI QIDQ2366535
Edward R. Dougherty, A. V. Mathew, V. Swarnakar
Publication date: 17 August 1993
Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01223318
Filtering in stochastic control theory (93E11) Least squares and related methods for stochastic control systems (93E24)
Related Items (2)
Efficient derivation of the optimal mean-square binary morphological filter from the conditional expectation via a switching algorithm for discrete power-set lattice ⋮ Existence and synthesis of minimal-basis morphological solutions for restoration-based boundary-value problem.
Cites Work
- Unnamed Item
- Efficient derivation of the optimal mean-square binary morphological filter from the conditional expectation via a switching algorithm for discrete power-set lattice
- Convergence behavior and N-roots of stack filters
- A representation theory for morphological image and signal processing
- The algebraic basis of mathematical morphology I. Dilations and erosions
- Optimal mean-square N-observation digital morphological filters
- Optimal mean-square N-observation digital morphological filters
This page was built for publication: Efficient derivation of the optimal mean-square binary morphological filter from the conditional expectation via a switching algorithm for discrete power-set lattice