journal: Mathematical Morphology - Theory and Applications

Eingestellt

Open Access Veröffentlicht von 3. März 2016 bis 1. Januar 2021

Mathematical Morphology - Theory and Applications

ISSN: 2353-3390

Über diese Zeitschrift

THE JOURNAL IS CLOSED FOR SUBMISSIONS

Mathematical Morphology - Theory and Applications (MMTA) was an Open Access electronic journal publishing either purely theoretical advances, or new ways of applying mathematical morphology to real-world problems.
MMTA was a forum open to other related mathematical image processing approaches as discrete geometry, topological imaging and scale-space models.

The journal was published in Open Access model and is archived in Portico.

All authors retain copyright, unless – due to their local circumstances – their work is not copyrighted. The copyrights are governed by the Creative-Commons license.

The journal was edited by Nicolas Passat (Université de Reims Champagne-Ardenne, France) and Hugues Talbot (Universite Paris-Saclay, France)

Abstracting und Indexing

Mathematical Morphology - Theory and Applications ist in den folgenden Services indiziert:

Baidu Scholar
Cabells Journalytics
Chronos Hub
CNKI Scholar (China National Knowledge Infrastructure)
DBLP Computer Science Bibliography
Dimensions
DOAJ (Directory of Open Access Journals)
EBSCO (relevant databases)
EBSCO Discovery Service
Google Scholar
J-Gate
JournalTOCs
KESLI-NDSL (Korean National Discovery for Science Leaders)
MyScienceWork
Naver Academic
Naviga (Softweco)
Primo Central (ExLibris)
ProQuest (relevant databases)
Publons
QOAM (Quality Open Access Market)
ReadCube
Scilit
Semantic Scholar
Sherpa/RoMEO
Summon (ProQuest)
TDNet
Ulrich's Periodicals Directory/ulrichsweb
WanFang Data
WorldCat (OCLC)
X-MOL
Yewno Discover
zbMATH Open

Zusatzmaterial

Publication Ethics

Fachgebiete

Externe Links

Band 5 Heft 1

Januar 2021

Regular Articles

Open Access 6. April 2021

Modeling Imprecise and Bipolar Algebraic and Topological Relations using Morphological Dilations

Isabelle Bloch

Seiten: 1-20

Mehr PDF downloaden

Abstract

In many domains of information processing, such as knowledge representation, preference modeling, argumentation, multi-criteria decision analysis, spatial reasoning, both vagueness, or imprecision, and bipolarity, encompassing positive and negative parts of information, are core features of the information to be modeled and processed. This led to the development of the concept of bipolar fuzzy sets, and of associated models and tools, such as fusion and aggregation, similarity and distances, mathematical morphology. Here we propose to extend these tools by defining algebraic and topological relations between bipolar fuzzy sets, including intersection, inclusion, adjacency and RCC relations widely used in mereotopology, based on bipolar connectives (in a logical sense) and on mathematical morphology operators. These definitions are shown to have the desired properties and to be consistent with existing definitions on sets and fuzzy sets, while providing an additional bipolar feature. The proposed relations can be used for instance for preference modeling or spatial reasoning. They apply more generally to any type of functions taking values in a poset or a complete lattice, such as L-fuzzy sets.

Open Access 16. Juli 2021

Efficient Hierarchical Multi-Object Segmentation in Layered Graphs

Leissi M.C. Leon, Krzysztof C. Ciesielski, Paulo A.V. Miranda

Seiten: 21-42

Mehr PDF downloaden

Abstract

We propose a novel efficient seed-based method for the multi-object segmentation of images based on graphs, named Hierarchical Layered Oriented Image Foresting Transform (HLOIFT). It uses a tree of the relations between the image objects, with each node in the tree representing an object. Each tree node may contain different individual high-level priors of its corresponding object and defines a weighted digraph, named as layer. The layer graphs are then integrated into a hierarchical graph, considering the hierarchical relations of inclusion and exclusion. A single energy optimization is performed in the hierarchical layered weighted digraph leading to globally optimal results satisfying all the high-level priors. The experimental evaluations of HLOIFT, on medical, natural, and synthetic images, indicate promising results comparable to the related baseline methods that include structural information, but with lower computational complexity. Compared to the hierarchical segmentation by the min-cut/max-flow algorithm, our approach is less restrictive, leading to globally optimal results in more general scenarios, and has a better running time.

Open Access 5. Juli 2021

Mathematical morphology based on stochastic permutation orderings

Olivier Lézoray

Seiten: 43-69

Mehr PDF downloaden

Abstract

The extension of mathematical morphology to multivariate data has been an active research topic in recent years. In this paper we propose an approach that relies on the consensus combination of several stochastic permutation orderings. The latter are obtained by searching for a smooth shortest path on a graph representing an image. This path is obtained with a randomized version nearest of neighbors heuristics on a graph. The construction of the graph is of crucial importance and can be based on both spatial and spectral information to enable the obtaining of smoother shortest paths. The starting vertex of a path being taken at random, many different permutation orderings can be obtained and we propose to build a consensus ordering from several permutation orderings. We show the interest of the approach with both quantitative and qualitative results.

Open Access 6. August 2021

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

Christian Ronse

Seiten: 70-107

Mehr PDF downloaden

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.

Open Access 9. Oktober 2021

Median-Tree: An Efficient Counterpart of Tree-of-Shapes

Behzad Mirmahboub, Deise Santana Maia, François Merciol, Sébastien Lefèvre

Seiten: 108-127

Mehr PDF downloaden

Abstract

Representing an image through a tree structure as provided with a morphological hierarchy enables efficient image analysis and processing methods operating directly on the tree structure. Max-tree and min-tree can be built with efficient algorithms but they only focus on brighter and darker components of the image respectively. Conversely, the Tree-of-Shapes is a self-complementary image representation that provides access to all regional extrema of the image (both brighter and darker components), but its computation is more time-consuming. In this paper, we introduce a new, simple and efficient tree structure called median-tree. It relies on a median image that is straightforwardly constructed by subtracting the median pixel value from an image to decompose it into positive and negative parts. The median tree can then be obtained by applying the efficient max-tree algorithms available in the literature on this median image. We show through theoretical and experimental studies that the median-tree offers similar characteristics to the Tree-of-Shapes, but comes with a considerably lower construction complexity.

Open Access 17. Dezember 2021

Robust Object Detection in Colour Images Using a Multivariate Percentage Occupancy Hit-or-Miss Transform

Fraser Macfarlane, Paul Murray, Stephen Marshall, Benjamin Perret, Adrian Evans, Henry White

Seiten: 128-152

Mehr PDF downloaden

Abstract

The extension of Mathematical Morphology to colour and multivariate images is challenging due to the need to define a total ordering in the colour space. No one general way of ordering multivariate data exists and, therefore, there is no single, definitive way of performing morphological operations on colour images. In this paper, we propose an extension to mathematical morphology, based on reduced ordering, specifically the morphological Hit-or-Miss Transform which is used for object detection. The reduced ordering employed transforms multivariate observations to scalar comparisons allowing for an order to be derived and for both flat and non-flat structuring elements to be used. We also compare other definitions of the Hit-or-Miss Transform and test alternative colour ordering schemes presented in the literature. Our proposed method is shown to be intuitive and outperforms other approaches to multivariate Hit-or-Miss Transforms. Furthermore, methods of setting the parameters of the proposed Hit-or-Miss Transform are introduced in order to make the transform robust to noise and partial occlusion of objects and, finally, a set of design tools are presented in order to obtain optimal values for setting these parameters accordingly.

Für diese Zeitschrift sind keine Journal Metrics verfügbar.

Editorial

Editors-in-Chief
Nicolas Passat, Université de Reims Champagne-Ardenne, France
Hugues Talbot, Universite Paris-Saclay, France

Editorial Advisory Board
Akira Asano, Kansai University, Japan
Junior Barrera, University of Sao Paulo, Brazil
Isabelle Bloch, TELECOM ParisTech, France
Bhabatosh Chanda, Indian Statistical Institute, Kalkota, India
Jocelyn Chanussot, Grenoble Institute of Technology, France
Marcin Iwanowski, Warsaw University of Technology, Poland
Cris Luengo, Uppsala University, Sweden
Dominique Jeulin, MINES ParisTech, France
Fernand Meyer, MINES ParisTech, France
Christian Ronse, Université de Strasbourg, France
Jos Roerdink, University of Groningen, The Netherlands
Philippe Salembier, Technical University of Catalonia, Barcelona, Spain
Iván R. Terol-Villalobos, CIDETEQ, Mexico

Publisher
DE GRUYTER Poland
Bogumiła Zuga 32A Str.
01-811 Warsaw, Poland
T: +48 22 701 50 15

Editorial Contact
Agnieszka.Bednarczyk-Drag@degruyter.com

(English)

Typ: Zeitschrift
Sprache: Englisch
Verlag: De Gruyter Open Access
Erstveröffentlichung: 3. März 2016
Letzte Veröffentlichung: 1. Januar 2021
Erscheinungsweise: 1 Heft pro Jahr
Zielgruppe: researchers in the field of theoretical advances and new ways of applying mathematical morphology to real-world problems