On morphological hierarchical representations for image processing and spatial data clustering

Hierarchical data representations in the context of classi cation and data clustering were put forward during the fties. Recently, hierarchical image representations have gained renewed interest for segmentation purposes. In this paper, we briefly survey fundamental results on hierarchical clustering and then detail recent paradigms developed for the hierarchical representation of images in the framework of mathematical morphology: constrained connectivity and ultrametric watersheds. Constrained connectivity can be viewed as a way to constrain an initial hierarchy in such a way that a set of desired constraints are satis ed. The framework of ultrametric watersheds provides a generic scheme for computing any hierarchical connected clustering, in particular when such a hierarchy is constrained. The suitability of this framework for solving practical problems is illustrated with applications in remote sensing

Graph ambiguity

In this paper, we propose a rigorous way to define the concept of ambiguity in the domain of graphs. In past studies, the classical definition of ambiguity has been derived starting from fuzzy set and fuzzy information theories. Our aim is to show that also in the domain of the graphs it is possible to derive a formulation able to capture the same semantic and mathematical concept. To strengthen the theoretical results, we discuss the application of the graph ambiguity concept to the graph classification setting, conceiving a new kind of inexact graph matching procedure. The results prove that the graph ambiguity concept is a characterizing and discriminative property of graphs. (C) 2013 Elsevier B.V. All rights reserved

Defining Bonferroni means over lattices

In the face of mass amounts of information and the need for transparent and fair decision processes, aggregation functions are essential for summarizing data and providing overall evaluations. Although families such as weighted means and medians have been well studied, there are still applications for which no existing aggregation functions can capture the decision makers\u27 preferences. Furthermore, extensions of aggregation functions to lattices are often needed to model operations on L-fuzzy sets, interval-valued and intuitionistic fuzzy sets. In such cases, the aggregation properties need to be considered in light of the lattice structure, as otherwise counterintuitive or unreliable behavior may result. The Bonferroni mean has recently received attention in the fuzzy sets and decision making community as it is able to model useful notions such as mandatory requirements. Here, we consider its associated penalty function to extend the generalized Bonferroni mean to lattices. We show that different notions of dissimilarity on lattices can lead to alternative expressions.<br /

General combination rules for qualitative and quantitative beliefs

Martin and Osswald \cite{Martin07} have recently proposed many generalizations of combination rules on quantitative beliefs in order to manage the conflict and to consider the specificity of the responses of the experts. Since the experts express themselves usually in natural language with linguistic labels, Smarandache and Dezert \cite{Li07} have introduced a mathematical framework for dealing directly also with qualitative beliefs. In this paper we recall some element of our previous works and propose the new combination rules, developed for the fusion of both qualitative or quantitative beliefs