Share Email Print

Proceedings Paper

Representation of finite-range increasing filters in the context of computational morphology
Author(s): Edward R. Dougherty; Divyendu Sinha
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

The classical Matheron representation of gray-scale filters considers images to possess infinite range, in particular so that they are range translation invariant. A key aspect of the theory is that binary morphology algebraically embeds into gray-scale with binary images possessing gray range minus infinity and zero. While this structure causes no algebraic problems, it does create both topological and probabilistic difficulties. In particular, the theory of optimal gray- scale filters does not contain the theory of optimal binary filters as a special case, and the optimal gray-scale filter takes finite-range images, say [0,M], and yields images with range [-M,2M]. These anomalies are mitigated by the theory of computational morphology. Here, morphological filters preserve the gray range and possess very simple Matheron-type representations. Besides range preservation for finite-range images, the key difference in computational morphology is that a filter possesses a vector of bases, not a single basis. The salient feature remains, that of the filter being represented in terms of erosions.

Paper Details

Date Published: 21 May 1993
PDF: 12 pages
Proc. SPIE 1902, Nonlinear Image Processing IV, (21 May 1993); doi: 10.1117/12.144773
Show Author Affiliations
Edward R. Dougherty, Rochester Institute of Technology (United States)
Divyendu Sinha, CUNY/College of Staten Island (United States)

Published in SPIE Proceedings Vol. 1902:
Nonlinear Image Processing IV
Edward R. Dougherty; Jaakko T. Astola; Harold G. Longbotham, Editor(s)

© SPIE. Terms of Use
Back to Top