68 research outputs found

    Triangular norms which are join-morphisms in 3-dimensional fuzzy set theory

    Get PDF
    The n-dimensional fuzzy sets have been introduced as a generalization of interval-valued fuzzy sets, Atanassov's intuitionistic and interval-valued intuitionistic fuzzy sets. In this paper we investigate t-norms on 3-dimensional sets which are join-morphisms. Under some additional conditions we show that they can be represented using a representation which generalizes a similar representation for t-norms in interval-valued fuzzy set theory

    A Unified Algebraic Framework for Fuzzy Image Compression and Mathematical Morphology

    Full text link
    In this paper we show how certain techniques of image processing, having different scopes, can be joined together under a common "algebraic roof"

    Fuzzy techniques for noise removal in image sequences and interval-valued fuzzy mathematical morphology

    Get PDF
    Image sequences play an important role in today's world. They provide us a lot of information. Videos are for example used for traffic observations, surveillance systems, autonomous navigation and so on. Due to bad acquisition, transmission or recording, the sequences are however usually corrupted by noise, which hampers the functioning of many image processing techniques. A preprocessing module to filter the images often becomes necessary. After an introduction to fuzzy set theory and image processing, in the first main part of the thesis, several fuzzy logic based video filters are proposed: one filter for grayscale video sequences corrupted by additive Gaussian noise and two color extensions of it and two grayscale filters and one color filter for sequences affected by the random valued impulse noise type. In the second main part of the thesis, interval-valued fuzzy mathematical morphology is studied. Mathematical morphology is a theory intended for the analysis of spatial structures that has found application in e.g. edge detection, object recognition, pattern recognition, image segmentation, image magnification… In the thesis, an overview is given of the evolution from binary mathematical morphology over the different grayscale morphology theories to interval-valued fuzzy mathematical morphology and the interval-valued image model. Additionally, the basic properties of the interval-valued fuzzy morphological operators are investigated. Next, also the decomposition of the interval-valued fuzzy morphological operators is investigated. We investigate the relationship between the cut of the result of such operator applied on an interval-valued image and structuring element and the result of the corresponding binary operator applied on the cut of the image and structuring element. These results are first of all interesting because they provide a link between interval-valued fuzzy mathematical morphology and binary mathematical morphology, but such conversion into binary operators also reduces the computation. Finally, also the reverse problem is tackled, i.e., the construction of interval-valued morphological operators from the binary ones. Using the results from a more general study in which the construction of an interval-valued fuzzy set from a nested family of crisp sets is constructed, increasing binary operators (e.g. the binary dilation) are extended to interval-valued fuzzy operators

    Relational Approach to the L-Fuzzy Concept Analysis

    Get PDF
    Modern industrial production systems benefit from the classification and processing of objects and their attributes. In general, the object classification procedure can coincide with vagueness. Vagueness is a common problem in object analysis that exists at various stages of classification, including ambiguity in input data, overlapping boundaries between classes or regions, and uncertainty in defining or extracting the properties and relationships of objects. To manage the ambiguity mentioned in the classification of objects, using a framework for L-fuzzy relations, and displaying such uncertainties by it can be a solution. Obtaining the least unreliable and uncertain output associated with the original data is the main concern of this thesis. Therefore, my general approach to this research can be categorized as follows: We developed an L-Fuzzy Concept Analysis as a generalization of a regular Concept Analysis. We start our work by providing the input data. Data is stored in a table (database). The next step is the creation of the contexts and concepts from the given original data using some structures. In the next stage, rules, or patterns (Attribute Implications) from the data will be generated. This includes all rules and a minimal base of rules. All of them are using L-fuzziness due to uncertainty. This requires L-fuzzy relations that will be implemented as L -valued matrices. In the end, everything is nicely packed in a convenient application and implemented in Java programming language. Generally, our approach is done in an algebraic framework that covers both regular and L -Fuzzy FCA, simultaneously. The tables we started with are already L-valued (not crisp) in our implementation. In other words, we work with the L-Fuzzy data directly. This is the idea here. We start with vague data. In simple terms, the data is shown using L -valued tables (vague data) trying to relate objects with their attributes at the start of the implementation. Generating attribute implications from many-valued contexts by a relational theory is the purpose of this thesis, i.e, a range of degrees is used to indicate the relationship between objects and their properties. The smallest degree corresponds to the classical no and the greatest degree corresponds to the classical yes in the table

    Author index to volumes 301–400

    Get PDF

    Full Issue

    Get PDF
    • …
    corecore