Matrix morphology with extremum principle

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The fundamental operations of mathematical morphology are dilation and erosion. In previous works, these operations have been generalised in a discrete setting to work with fields of symmetric matrices, and also corresponding methods based on partial differential equations have been constructed. However, the existing methods for dilation and erosion in the matrix-valued setting are not overall satisfying. By construction they may violate a discrete extremum principle, which means that results may leave the convex hull of the matrices that participate in the computation. This may not be desirable from the theoretical point of view, as the corresponding property is fundamental for discrete and continuous-scale formulations of dilation and erosion in the scalar setting. Moreover, if such a principle could be established in the matrix-valued framework, this would help to make computed solutions more interpretable. In our paper we address this issue. We show how to construct a method for matrix-valued morphological dilation and erosion that satisfies a discrete extremum principle. We validate the construction by showing experimental results on synthetic data as well as colour images, as the latter can be cast as fields of symmetric matrices.

Cite

CITATION STYLE

APA

Welk, M., Breuß, M., & Sridhar, V. (2019). Matrix morphology with extremum principle. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11564 LNCS, pp. 177–188). Springer Verlag. https://doi.org/10.1007/978-3-030-20867-7_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free