Abstract

The present thesis derives error representations and develops design methodologies for optimal mean-absolute-error (MAE) morphological-based filters. Four related morphological-based filter-types are treated. Three are translation-invariant, monotonically increasing operators, and our analysis is based on the Matheron (1975) representation. In this class we analyze conventional binary, conventional gray-scale, and computational morphological filters. The fourth filter class examined is that of binary translation invariant operators. Our analysis is based on the Banon and Barrera (1991) representation and hit-or-miss operator of Serra (1982). A starting point will be the optimal morphological filter paradigm of Dougherty (1992a,b) whose analysis de scribes the optimal filter by a system of nonlinear inequalities with no known method of solution, and thus reduces filter design to minimal search strategies. Although the search analysis is definitive, practical filter design remained elu sive because the search space can be prohibitively large if it not mitigated in some way. The present thesis extends from Dougherty's starting point in several ways. Central to the thesis is the MAE analysis for the various filter settings, where in each case, a theorem is derived that expresses overall filter MAE as a sum of MAE values of individual structuring-element filters and MAE of combinations of unions (maxima) of those elements. Recursive forms of the theorems can be employed in a computer algorithm to rapidly evaluate combinations of structuring elements and search for an optimal filter basis. Although the MAE theorems provide a rapid means for examining the filter design space, the combinatoric nature of this space is, in general, too large for a exhaustive search. Another key contribution of this thesis concerns mitigation of the computational burden via design constraints. The resulting constrained filter will be suboptimal, but, if the constraints are imposed in a suitable man ner, there is little loss of filter performance in return for design tractability. Three constraint approaches developed here are (1) limiting the number of terms in the filter expansion, (2) constraining the observation window, and (3) employing structuring element libraries from which to search for an optimal basis. Another contribution of this thesis concerns the application of optimal morphological filters to image restoration. Statistical and deterministic image and degradation models for binary and low-level gray images were developed here that relate to actual problems in the optical character recognition and electronic printing fields. In the filter design process, these models are employed to generate realizations, from which we extract single-erosion and single-hit-or-miss MAE statistics. These realization-based statistics are utilized in the search for the optimal combination of structuring elements.

Library of Congress Subject Headings

Image processing--Digital techniques--Mathematics; Morphisms (Mathematics); Digital filters (Mathematics); Filters (Mathematics)

Publication Date

5-1-1993

Document Type

Thesis

Department, Program, or Center

Chester F. Carlson Center for Imaging Science (COS)

Advisor

Biles, A.

Advisor/Committee Member

Dougherty, E.

Advisor/Committee Member

Haralick, R.

Comments

Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works. Physical copy available through RIT's The Wallace Library at: TA1637 L634 1993

Campus

RIT – Main Campus

Download

Share

COinS