Abstract In this work, we explore the impact of adaptive fuzzy measures on edge detection, aiming to enhance how computers interpret images by identifying edges more accurately. Traditional methods rely on analysing changes in image brightness to locate edges, but they often use fixed rules that do not account for the unique characteristics of each image. Our approach differs by adjusting fuzzy measures based on the information within specific areas of an image under a sliding window approach, utilizing a variety of fusion functions and generalizations of the Choquet integral to analyse and combine pixel data. The proposed method is flexible, allowing for the adaptation of measures in response to the image's local features. We put our method to the test against the well‐established Canny edge detector to evaluate its effectiveness. Our experimental results suggest that by adapting fuzzy measures for each image section, we can improve edge detection results.

In data stream (DS) learning, the system has to extract knowledge from data generated continuously, usually at high speed and in large volumes, making it impossible to store the entire set of data to be processed in batch mode. Hence, machine learning models must be built incrementally by processing the incoming examples, as data arrive, while updating the model to be compatible with the current data. In fuzzy DS clustering, the model can either absorb incoming data into existing clusters or initiate a new cluster. As the volume of data increases, there is a possibility that the clusters will overlap to the point where it is convenient to merge two or more clusters into one. Then, a cluster comparison measure (CM) should be applied, to decide whether such clusters should be combined, also in an incremental manner. This defines an incremental fusion process based on aggregation functions that can aggregate the incoming inputs without storing all the previous inputs. The objective of this article is to solve the fuzzy DS clustering problem of incrementally comparing fuzzy clusters on a formal basis. First, we formalize and operationalize incremental fusion processes of fuzzy clusters by introducing recursively extendable (RE) aggregation functions, studying construction methods and different classes of such functions. Second, we propose two approaches to compare clusters: 1) similarity and 2) overlapping between clusters, based on RE aggregation functions. Finally, we analyze the effect of those incremental CMs on the online and offline phases of the well-known fuzzy clustering algorithm d-FuzzStream, showing that our new approach outperforms the original algorithm and presents better or comparable performance to other state-of-the-art DS clustering algorithms found in the literature.

Restricted equivalence functions are well-known functions to compare two numbers in the interval between 0 and 1. Despite the numerous works studying the properties of restricted equivalence functions and their multiple applications as support for different similarity measures, an extension of these functions to an n-dimensional space is absent from the literature. In this article, we present a novel contribution to the restricted equivalence function theory, allowing to compare multivalued elements. Specifically, we extend the notion of restricted equivalence functions from$L$to$L^{n}$and present a new similarity construction on$L^{n}$. proposal is tested in the context of color image anisotropic diffusion as an example of one of its many applications.

It is known that the human visual system performs a hierarchical information process in which early vision cues (or primitives) are fused in the visual cortex to compose complex shapes and descriptors. While different aspects of the process have been extensively studied, such as lens adaptation or feature detection, some other aspects, such as feature fusion, have been mostly left aside. In this work, we elaborate on the fusion of early vision primitives using generalizations of the Choquet integral, and novel aggregation operators that have been extensively studied in recent years. We propose to use generalizations of the Choquet integral to sensibly fuse elementary edge cues, in an attempt to model the behaviour of neurons in the early visual cortex. Our proposal leads to a fully-framed edge detection algorithm whose performance is put to the test in state-of-the-art edge detection datasets.

In this work we propose a new axiomatic definition of distance between interval-valued fuzzy sets which takes into account the width of the membership intervals and linear orders. We discuss some construction methods using aggregation functions which are defined in terms of admissible orders.

In this work we propose a new generalization of the notion of monotonicity, the so-called ordered directionally monotonicity. With this new notion, the direction of increasingness or decreasingness at a given point depends on that specific point, so that it is not the same for every value on the domain of the considered function.

Differentiation of interval-valued functions is an intricate problem, since it cannot be defined as a direct generalization of differentiation of scalar ones. Literature on interval arithmetic contains proposals and definitions for differentiation, but their semantic is unclear for the cases in which intervals represent the ambiguity due to hesitancy or lack of knowledge. In this work we analyze the needs, tools and goals for interval-valued differentiation, focusing on the case of interval-valued images. This leads to the formulation of a differentiation schema inspired by bilateral filters, which allows for the accommodation of most of the methods for scalar image differentiation, but also takes support from interval-valued arithmetic. This schema can produce area-, segment- and vector-valued gradients, according to the needs of the image processing task it is applied to. Our developments are put to the test in the context of edge detection.