Connective Segmentation Generalized to Arbitrary Complete Lattices
We begin by defining the setup and the framework of connective segmentation. Then we start from a theorem based on connective criteria, established for the power set of an arbitrary set. As the power set is an example of a complete lattice, we formulate and prove an analogue of the theorem for general complete lattices.
Secondly, we consider partial partitions and partial connections. We recall the definitions, and quote a result that gives a characterization of (partial) connections. As a continuation of the work in the first part, we generalize this characterization to complete lattices as well.
Finally we link these two approaches by means of a commutative diagram, in two manners.
KeywordsConnective segmentation complete lattice partial partition block-splitting opening commutative diagram
Unable to display preview. Download preview PDF.
- 4.Ronse, C.: Idempotent Block Splitting on Partial Partitions, I: Isotone Operators. Order. SpringerLink (2010)Google Scholar
- 6.Ronse, C., Serra, J.: Algebraic foundations of morphology. In: Najman, L., Talbot, H. (eds.) Mathematical Morphology: From Theory to Applications. ISTE/J. Wiley & Sons, London (2010)Google Scholar