Issue No. 12 - December (1991 vol. 13)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.106995
<p>P. Maragos (1989) provided a framework for the decomposition of many morphologic operations into orthogonal components or basis sets. Using this framework, a method to find the minimal basis set for the important operation of closing in two dimensions is described. The closing basis sets are special because their elements are members of an ordered, global set of closing shapes or primitives. The selection or design of appropriate individual or multiple structuring elements for image filtering can be better understood, and sometimes implemented more easily, through consideration of the orthogonal closing decomposition. Partial closing of images using ordered fractions of a closing basis set may give a finer texture or roughness measure than that obtained from the conventional use of scaled sets of shapes such as the disc. The connection between elements of the basis set for closing and the complete, minimal representation of arbitrary logic functions is analyzed from a geometric viewpoint.</p>
parallel algorithms; picture processing; texture measure; formal logic; Boolean functions; partial images closing; geometry; basis sets; morphologic closing; closing shapes; primitives; image filtering; orthogonal closing decomposition; roughness measure; minimal representation; logic functions; Boolean functions; filtering and prediction theory; formal logic; geometry; parallel algorithms; picture processing; set theory
I. Svalbe, "The Geometry of Basis Sets for Morphologic Closing," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 13, no. , pp. 1214-1224, 1991.