Share Email Print

Proceedings Paper

Computational representation of increasing lattice-valued image operators
Author(s): Divyendu Sinha; Edward R. Dougherty
Format Member Price Non-Member Price
PDF $17.00 $21.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 11 August 1995
PDF: 7 pages
Proc. SPIE 2568, Neural, Morphological, and Stochastic Methods in Image and Signal Processing, (11 August 1995); doi: 10.1117/12.216368
Show Author Affiliations
Divyendu Sinha, CUNY/Staten Island College (United States)
Edward R. Dougherty, Rochester Institute of Technology (United States)

Published in SPIE Proceedings Vol. 2568:
Neural, Morphological, and Stochastic Methods in Image and Signal Processing
Edward R. Dougherty; Francoise J. Preteux; Sylvia S. Shen, Editor(s)

© SPIE. Terms of Use
Back to Top