Novel applications of discrete mereotopology to mathematical morphology

Landini, Gabriel and Galton, Antony and Randell, David and Fouad, Shereen (2019) Novel applications of discrete mereotopology to mathematical morphology. Signal Processing: Image Communication. ISSN 0923-5965 (In Press)

[img] Text
signal_processing_paper_submitted.pdf - Accepted Version
Restricted to Repository staff only until 27 April 2021.
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (485kB) | Request a copy

Abstract

This paper shows how the Discrete Mereotopology notions of adjacency and neighbourhood between regions
can be exploited through Mathematical Morphology to accept or reject changes resulting from traditional
morphological operations such as closing and opening. This leads to a set of six morphological operations
(here referred to generically as minimal opening and minimal closing ) where minimal changes fulfil specific
spatial constraints. We also present an algorithm to compute the RCC5D and RCC8D relation sets across
multiple regions resulting in a performance improvement of over three orders of magnitude over our previously
published algorithm for Discrete Mereotopology.

Item Type: Article
Uncontrolled Keywords: Mathematical morphology Discrete mereotopology Image processing Spatial reasoning
Subjects: B800 Medical Technology
G400 Computer Science
G900 Others in Mathematical and Computing Sciences
Divisions: Faculty of Computing, Engineering and the Built Environment
Faculty of Computing, Engineering and the Built Environment > School of Computing and Digital Technology
Faculty of Computing, Engineering and the Built Environment > School of Computing and Digital Technology > Cyber Security
REF UoA Output Collections > REF2021 UoA11: Computer Science and Informatics
Depositing User: Shereen Mahmoud
Date Deposited: 01 May 2019 08:54
Last Modified: 08 May 2019 14:05
URI: http://www.open-access.bcu.ac.uk/id/eprint/7409

Actions (login required)

View Item View Item

Research

In this section...