1,564 research outputs found
Interval-valued and intuitionistic fuzzy mathematical morphologies as special cases of L-fuzzy mathematical morphology
Mathematical morphology (MM) offers a wide range of tools for image processing and computer vision. MM was originally conceived for the processing of binary images and later extended to gray-scale morphology. Extensions of classical binary morphology to gray-scale morphology include approaches based on fuzzy set theory that give rise to fuzzy mathematical morphology (FMM). From a mathematical point of view, FMM relies on the fact that the class of all fuzzy sets over a certain universe forms a complete lattice. Recall that complete lattices provide for the most general framework in which MM can be conducted.
The concept of L-fuzzy set generalizes not only the concept of fuzzy set but also the concepts of interval-valued fuzzy set and Atanassov’s intuitionistic fuzzy set. In addition, the class of L-fuzzy sets forms a complete lattice whenever the underlying set L constitutes a complete lattice. Based on these observations, we develop a general approach towards L-fuzzy mathematical morphology in this paper. Our focus is in particular on the construction of connectives for interval-valued and intuitionistic fuzzy mathematical morphologies that arise as special, isomorphic cases of L-fuzzy MM. As an application of these ideas, we generate a combination of some well-known medical image reconstruction techniques in terms of interval-valued fuzzy image processing
Properties of Bipolar Fuzzy Hypergraphs
In this article, we apply the concept of bipolar fuzzy sets to hypergraphs
and investigate some properties of bipolar fuzzy hypergraphs. We introduce the
notion of tempered bipolar fuzzy hypergraphs and present some of their
properties. We also present application examples of bipolar fuzzy hypergraphs
Explaining computer predictions with augmented appraisal degrees
An augmented appraisal degree (AAD) has been conceived as a mathematical representation of the connotative meaning in an experience-based evaluation, which depends on a particular experience or knowledge. Aiming to improve the interpretability of computer predictions, we explore the use of AADs to represent evaluations that are per- formed by a machine to predict the class of a particular object. Hence, we propose a novel method whereby predictions made using a support vector machine classification process are augmented through AADs. An illustra- tive example, in which the classes of handwritten digits are predicted, shows how the augmentation of such predictions can favor their interpretability
- …