Flat morphological operators from non-increasing set operators, I: general theory

Abstract

Abstract Flat morphology is a general method for obtaining increasing operators on grey-level or multivalued images from increasing operators on binary images (or sets). It relies on threshold stacking and superposition; equivalently, Boolean max and min operations are replaced by lattice-theoretical sup and inf operations. In this paper we consider the construction a flat operator on grey-level or colour images from an operator on binary images that is not increasing. Here grey-level and colour images are functions from a space to an interval in ℝ m or ℤ m (m ≥ 1). Two approaches are proposed. First, we can replace threshold superposition by threshold summation. Next, we can decompose the non-increasing operator on binary images into a linear combination of increasing operators, then apply this linear combination to their flat extensions. Both methods require the operator to have bounded variation, and then both give the same result, which conforms to intuition. Our approach is very general, it can be applied to linear combinations of flat operators, or to linear convolution filters. Our work is based on a mathematical theory of summation of real-valued functions of one variable ranging in a poset. In a second paper, we will study some particular properties of non-increasing flat operators.