SearcharxivSearch

arXiv · 2005.01715

Abstract Mathematical morphology based on structuring element: Application to morpho-logic

Abstract

A general definition of mathematical morphology has been defined within the algebraic framework of complete lattice theory. In this framework, dealing with deterministic and increasing operators, a dilation (respectively an erosion) is an operation which is distributive over supremum (respectively infimum). From this simple definition of dilation and erosion, we cannot say much about the properties of them. However, when they form an adjunction, many important properties can be derived such as monotonicity, idempotence, and extensivity or anti-extensivity of their composition, preservation of infimum and supremum, etc. Mathematical morphology has been first developed in the setting of sets, and then extended to other algebraic structures such as graphs, hypergraphs or simplicial complexes. For all these algebraic structures, erosion and dilation are usually based on structuring elements. The goal is then to match these structuring elements on given objects either to dilate or erode them. One of the advantages of defining erosion and dilation based on structuring elements is that these operations are adjoint. Based on this observation, this paper proposes to define, at the abstract level of category theory, erosion and dilation based on structuring elements. We then define the notion of morpho-category on which erosion and dilation are defined. We then show that topos and more precisely topos of presheaves are good candidates to generate morpho-categories. However, topos do not allow taking into account the notion of inclusion between substructures but rather are defined by monics up to domain isomorphism. Therefore we define the notion of morpholizable category which allows generating morpho-categories where substructures are defined along inclusion morphisms. {A direct application of this framework is to generalize modal morpho-logic to other algebraic structures than simple sets.

Explore related subjects

Keep this discovery

BibTeXRIS

Marc Aiguier, Isabelle Bloch, Ramon Pino-Pérez. 2020-05-04. Abstract Mathematical morphology based on structuring element: Application to morpho-logic. https://arxiv.org/abs/2005.01715

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A model structure for cartesian 2-fibrations

Cartesian 2-fibrations provide a way to understand indexed categories, but their classical ``straightening'' construction requires several layers of weak coherence data. This paper develops a homotopical framework that replaces much of this bookkeeping with a fully strict model. By using marked 2-categories to record the cartesian morphisms and 2-cells, we construct a model structure whose fibrant objects are precisely the cartesian 2-fibrations over a fixed 2-category $\mathcal{C}$. We then show that the marked Grothendieck construction identifies these 2-fibrations, up to weak equivalence, with strict 2-functors from $\mathcal{C}$ into $2\mathrm{Cat}$. As an additional contribution, we construct localizations of 2-categories that simultaneously invert selected morphisms and 2-cells.

math.CT

A Natural Fuzzy Order on Fuzzy Numbers

This paper introduces a natural fuzzy order on fuzzy numbers that extends the natural orders on real numbers and interval numbers. We investigate its completeness properties and show that the space of uniformly bounded fuzzy numbers is conically complete and conically cocomplete, and that it is complete if and only if the underlying continuous t-norm is the G\"odel t-norm. Moreover, it is proved that this space constitutes a \([0,1]\)-enriched domain if and only if the underlying continuous t-norm satisfies the (S) condition. These results provide a foundation for ordering fuzzy numbers.

math.CT

Noetherian forms of free non-symmetric operads

In this paper, we study certain categories of labeled finite rooted ordered trees over a fixed set of labels where each label is equipped with an arity: a fixed number of children that the vertex with the given label must have. Equivalently, these are expression trees for operations in a free non-symmetric operad. A morphism between these trees matches a pruning of one tree (a prefix) with an entire subtree of another (a suffix). We characterize such categories, up to isomorphism, in terms of suitable exactness properties. It turns out that these categories exhibit strong algebraic behavior, in the sense that every such category, when appended with a strict initial object, has a particularly nice noetherian form.

math.CT