28 March 1995 Computational representation of lattice operators
Author Affiliations +
Abstract
Computational mathematical morphology is extended to provide computational representations of increasing and nonincreasing windowed translation-invariant operators of the form (psi) : LN yields M, where L and M are complete lattices. Representations are grounded on the Riemann zeta function and provide lattice-valued extensions of the classical disjunctive- normal-form, reduced, and positive logical representations. Both direct and dual representations are given. Representations are morphological because they involve elemental forms of erosion, dilation, or the hit-or-miss transform.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Divyendu Sinha, Divyendu Sinha, Edward R. Dougherty, Edward R. Dougherty, } "Computational representation of lattice operators", Proc. SPIE 2424, Nonlinear Image Processing VI, (28 March 1995); doi: 10.1117/12.205217; https://doi.org/10.1117/12.205217
PROCEEDINGS
8 PAGES


SHARE
RELATED CONTENT

Multilayer Boolean and stack filter design
Proceedings of SPIE (May 01 1994)
Mixed median filters and their properties
Proceedings of SPIE (April 04 1997)
Some Simple Generalizations Of Morphological Filters
Proceedings of SPIE (May 25 1989)
Morphological bounds on order-statistics filters
Proceedings of SPIE (June 23 1993)

Back to Top