Morphological filters--Part I: Their set-theoretic analysis and relations to linear shift-invariant filters

Abstract

Abstract-This paper examines the set-theoretic interpretation of morphological filters in the framework of mathematical morphology and introduces the representation of classical linear filters in terms of morphological correlations, which involve supremumlinfimum operations and additions. Binary signals are classified as sets, and multilevel signals as functions. Two set-theoretic representations of signals are reviewed. Filters are classified as set-processing (SP) or function-processing (FP). Conditions are provided for certain FP filters that pass binary signals to commute with signal thresholding because then they can be analyzed and implemented as SP filters.The basic morphological operations of set erosion, dilation, opening, and closing are related to Minkowski set operations and are used to construct FP morphological filters. Emphasis is then given to analytically and geometrically quantifying the similarities and differences between morphological filtering of signals by sets and functions; the latter case allows the definition of morphological convolutions and correlations. Toward this goal, various properties of FP morphological filters are also examined.Linear shift-invariant filters (due to their translation-invariance) are uniquely characterized by their kernel, which is a special collection of input signals. Increasing linear filters are represented as the supremum of erosions by their kernel functions. If the filters are also discrete and have a finite-extent impulse response, they can be represented as the supremum of erosions only by their minimal (with respect to a signal ordering) kernel functions. Stable linear filters can be represented as the sum of (at most) two weighted suprema of erosions. These results demonstrate the power of mathematical morphology as a unifying approach to both linear and nonlinear signal-shaping strategies.M

Morphological Counterparts of Linear Shift-Invariant Scale-Spaces

“…Linear system theory and mathematical morphology are two successful and widely-used concepts in signal and image processing, and attempts to establish connections between these paradigms are undergoing since about three decades [43]. It is well-known that any linear shift-invariant system can be described as a convolution that can be computed elegantly as multiplication in the Fourier domain [40,46].…”

Enhanced resolution for EPR imaging by two-step deblurring

“…First, edge detection is performed using Laplacian of Gaussian [37] (LoG) with a 2D isotropic Gaussian kernel having a standard deviation of two pixels. Second, a morphological filter [38] is used to fill all the close contours generated by the edge detector. Third, segmentation is carried out by assigning all the connected pixels to one object.…”

Morphological scale-space in image processing

“…A binary signal can be considered a set A, and erosion and dilation then correspond to Minkowski addition and subtraction by another set B called the structuring element [17]. Here we use the notation…”