Paper
11 August 1995 Computational representation of increasing lattice-valued image operators
Divyendu Sinha, Edward R. Dougherty
Author Affiliations +
Abstract
Computational mathematical morphology provides zeta-function-based representation for windowed, translation-invariant image operators taking their values in a complete lattice. Image operators are induced via windowing by product lattice operators and, in both the increasing and nonincreasing cases, these reduce to classical logical representation for binary operators. The present paper presents the image-operator theory for increasing filters. In particular, it treats gray-to-binary and gray-to-gray morphological operators, as well as representation of lattice-valued stack filters via threshold decomposition.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Divyendu Sinha and Edward R. Dougherty "Computational representation of increasing lattice-valued image operators", Proc. SPIE 2568, Neural, Morphological, and Stochastic Methods in Image and Signal Processing, (11 August 1995); https://doi.org/10.1117/12.216368
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Binary data

Digital filtering

Electroluminescence

Mathematical morphology

Fermium

Frequency modulation

Image filtering

RELATED CONTENT


Back to Top