Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 24
Encontrada(s) 1 página(s)

Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Contribución de congreso (ConferenceOutput)

Operador de comparación de elementos multivaluados basado en funciones de equivalencia restringida

  • Castillo López, Aitor
  • López Molina, Carlos
  • Fernández Fernández, Francisco Javier
  • Sesma Sara, Mikel
  • Bustince Sola, Humberto
En este trabajo proponemos un nuevo enfoque del algoritmo de clustering gravitacional basado en lo que Einstein considero su 'mayor error': la constante cosmológica. De manera similar al algoritmo de clustering gravitacional, nuestro enfoque está inspirado en principios y leyes del cosmos, y al igual que ocurre con la teoría de la relatividad de Einstein y la teoría de la gravedad de Newton, nuestro enfoque puede considerarse una generalización del agrupamiento gravitacional, donde, el algoritmo de clustering gravitacional se recupera como caso límite. Además, se desarrollan e implementan algunas mejoras que tienen como objetivo optimizar la cantidad de iteraciones finales, y de esta forma, se reduce el tiempo de ejecución tanto para el algoritmo original como para nuestra versión., Este trabajo ha sido respaldado por los proyectos PID2019- 108392GB-I00 (AEI/10.13039/ 501100011033) de la Agencia Estatal de Investigación.
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Contribución de congreso (ConferenceOutput)

Uso de t-normas para el estudio de la convexidad en conjuntos difusos intervalo-valuados

  • Huidobro, Pedro
  • Alonso, Pedro
  • Bustince Sola, Humberto
  • Janis, Vladimír
  • Montes Rodríguez, Susana
En muchos problemas reales no se pueden tomar medidas de forma exacta. Así, los conjuntos difusos surgieron como una forma de intentar tratar con la incertidumbre de la forma más eficiente posible. Por otro lado, debe señalarse que la ‘convexidad es un concepto interesante en varias áreas dentro de las matemáticas. Teniendo esto en cuenta, en este documento proponemos una extensión del concepto de convexidad para conjuntos difusos intervalo-valuados basada en el uso de t-normas para intervalos. Para ello, y teniendo en consideración la literatura científica existente respecto de t-normas, presentamos una definición de t-norma aplicada a intervalos. Por último, comprobamos que nuestra definición de convexidad, utilizando t-normas, preserva la convexidad a través de intersecciones, es decir, que la intersección de dos conjuntos difusos intervalo-valuados convexos es también convexa., Este estudio ha sido parcialmente patrocinado por el programa español MINECO (TIN-2017-87600-P: P. Alonso; PGC2018-098623-B-I00: P. Huidobro and S. Montes), MICIN (PID2019!108392GB!I00: H. Bustince), la ayuda no. 1/0150/21 proporcionada por la agencia de subvenciones eslovaca VEGA (V. Janis) y el programa de ayudas Severo Ochoa PA-20PF-BP19-169 (P. Huidobro).
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Contribución de congreso (ConferenceOutput)

A framework for active contour initialization with application to liver segmentation in MRI

  • Mir Torres, Arnau
  • Antunes dos Santos, Felipe
  • Fernández Fernández, Francisco Javier
  • López Molina, Carlos
Object segmentation is a prominent low-level task in image processing and computer vision. A technique of special relevance within segmentation algorithms is active contour modeling. An active contour is a closed contour on an image which can be evolved to progressively fit the silhouette of certain area or object. Active contours shall be initialized as a closed contour at some position of the image, further evolving to precisely fit to the silhouette of the object of interest. While the evolution of the contour has been deeply studied in literature [5, 11], the study of strategies to define the initial location of the contour is rather absent from it. Typically, such contour is created as a small closed curve around an inner position in the object. However, literature contains no general-purpose algorithms to determine those inner positions, or to quantify their fitness. In fact, such points are frequently set manually by human experts, hence turning the segmentation process into a semi-supervised one. In this work, we present a method to find inner points in relevant object using spatial-tonal fuzzy clustering. Our proposal intends to detect dominant clusters of bright pixels, which are further used to identify candidate points or regions around which active contours can be initialized., The authors gratefully acknowledge the financial support of the grants PID2019-108392GB-I00 funded by MCIN/AEI/10.13039/501100011033, as well as that by the Government of Navarra (PC082-083-084 EHGNA). A. Mir acknowledges the financial support of the grant PID2020-113870GB-I00 funded by MCIN/AEI/10.13039/ 501100011033/.
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Contribución de congreso (ConferenceOutput)

Fuzzy clustering to encode contextual information in artistic image classification

  • Fumanal Idocin, Javier
  • Takáč, Zdenko
  • Horanská, Lubomíra
  • Bustince Sola, Humberto
  • Cordón, Óscar
Automatic art analysis comprises of utilizing diverse processing methods to classify and categorize works of art. When working with this kind of pictures, we have to take under consideration different considerations compared to classical picture handling, since works of art alter definitely depending on the creator, the scene delineated or their aesthetic fashion. This extra data improves the visual signals gotten from the images and can lead to better performance. However, this information needs to be modeled and embed alongside the visual features of the image. This is often performed utilizing deep learning models, but they are expensive to train. In this paper we utilize the Fuzzy C-Means algorithm to create a embedding strategy based on fuzzy memberships to extract relevant information from the clusters present in the contextual information. We extend an existing state-of-the-art art classification system utilizing this strategy to get a new version that presents similar results without training additional deep learning models., Javier Fumanal Idocin and Humberto Bustince’s research has been supported by the project PID2019-108392GB I00 (AEI/10.13039/501100011033). Zdenko Takác and Lúbomíra Horanská’s research has been supported by the grant VEGA 1/0267/21.
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Contribución de congreso (ConferenceOutput)

Análisis de redes sociales basado en las conquistas de César Borgia

  • Fumanal Idocin, Javier
  • Cordón, Óscar
  • Alonso Betanzos, Amparo
  • Bustince Sola, Humberto
  • Fernández Fernández, Francisco Javier
En este trabajo presentamos el modelado de redes sociales y detección de comunidades utilizando como base un evento histórico real, las conquistas de César Borgia en el siglo XV. Para ello, proponemos un nuevo conjunto de funciones, llamadas funciones de afinidad, disenadas para capturar la 'naturaleza de las interacciones locales entre cada par de actores en una red. Utilizando estas funciones, desarrollamos un nuevo algoritmo de detección de comunidades, el Borgia Clustering, donde las comunidades surgen naturalmente de un proceso de simulación de interacción de múltiples agentes en la red. También discutimos los efectos del tamaño y la escala de cada comunidad, y como pueden ser tomadas en cuenta en el proceso de simulación. Finalmente, comparamos nuestra detección de comunidades con otros algoritmos representativos, encontrando resultados favorables a nuestra propuesta., El trabajo de Javier Fumanal Idocin y Humberto Bustince ha sido financiado por el proyecto PID2019-108392GB-I00 (AEI/10.13039/ 501100011033). El trabajo de Oscar Cordón ha sido financiado por el Gobierno de España, EXASOCO (PGC2018-101216-B-I00), incluyendo fondos de desarrollo regional europeo (ERDF). La investigación de Amparo Alonso Betanzos ha sido parcialmente financiado por el Ministerio de Economía y Competitividad de España (TIN2015-65069-C2-1-R), por los fondos europeos FEDER y por la Consellería de Industria de la Xunta de Galicia (GRC2014 /035). El trabajo de María Minárová ha sido financiado por los proyectos APVV-17-0066, and APVV-18-0052.
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Contribución de congreso (ConferenceOutput)

Combinations of affinity functions for different community detection algorithms in social networks

  • Fumanal Idocin, Javier
  • Cordón, Óscar
  • Minárová, María
  • Alonso Betanzos, Amparo
  • Bustince Sola, Humberto
Social network analysis is a popular discipline among the social and behavioural sciences, in which the relationships between different social entities are modelled as a network. One of the most popular problems in social network analysis is finding communities in its network structure. Usually, a community in a social network is a functional sub-partition of the graph. However, as the definition of community is somewhat imprecise, many algorithms have been proposed to solve this task, each of them focusing on different social characteristics of the actors and the communities. In this work we propose to use novel combinations of affinity functions, which are designed to capture different social mechanics in the network interactions. We use them to extend already existing community detection algorithms in order to combine the capacity of the affinity functions to model different social interactions than those exploited by the original algorithms., Javier Fumanal Idocin and Humberto Bustince’s re-search has been supported by the project PID2019-108392GBI00 (AEI/10.13039/501100011033). Maria Minarová research has been funded by the project work was supported by the projects APVV-17-0066 andAPVV-18-0052. Oscar Cordon’s research was supported by the Spanish Ministry of Science, Innovation and Universities under grant EXASOCO (PGC2018-101216-B-I00), including, European Regional Development Funds (ERDF).
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Contribución de congreso (ConferenceOutput)

Reemplazo de la función de pooling de redes neuronales convolucionales por combinaciones lineales de funciones crecientes

  • Rodríguez Martínez, Iosu
  • Lafuente López, Julio
  • Sesma Sara, Mikel
  • Herrera, Francisco
  • Ursúa Medrano, Pablo
  • Bustince Sola, Humberto
Las redes convolucionales llevan a cabo un proceso automatico de extracción y fusión de características mediante el cual obtienen la información más relevante de una imagen dada. El proceso de submuestreo mediante el cual se fusionan características localmente próximas, conocido como ‘pooling’, se lleva a cabo tradicionalmente con funciones sencillas como el máximo o la media aritmética, ignorando otras opciones muy populares en el campo de la teoría de agregaciones. En este trabajo proponemos reemplazar dichas funciones por otra serie de ordenes estadísticos, así como por la integral de Sugeno y una nueva generalización de la misma. Además, basándonos en trabajos que emplean la combinación convexa del máximo y la media, presentamos una nueva capa que permite combinar varias de las nuevas agregaciones, mejorando sus resultados individuales., Este trabajo ha sido financiado por los proyectos de investigación PID2019-108392GB-I00 (AEI/10.13039/501100011033) de la Agencia Estatal de Investigación, PC095-096 FUSIPROD y P18-FR-4961.
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Contribución de congreso (ConferenceOutput)

Clusterig cosmológico: un enfoque del clustering gravitacional clásico inspirado en la estructura y dinámica del cosmos a gran escala

  • Castillo López, Aitor
  • Fumanal Idocin, Javier
  • Fernández Fernández, Francisco Javier
  • Bustince Sola, Humberto
En este trabajo proponemos un nuevo enfoque del algoritmo de clustering gravitacional basado en lo que Einstein considero su 'mayor error': la constante cosmológica. De manera similar al algoritmo de clustering gravitacional, nuestro enfoque está inspirado en principios y leyes del cosmos, y al igual que ocurre con la teoría de la relatividad de Einstein y la teoría de la gravedad de Newton, nuestro enfoque puede considerarse una generalización del agrupamiento gravitacional, donde, el algoritmo de clustering gravitacional se recupera como caso límite. Además, se desarrollan e implementan algunas mejoras que tienen como objetivo optimizar la cantidad de iteraciones finales, y de esta forma, se reduce el tiempo de ejecución tanto para el algoritmo original como para nuestra versión., Este trabajo ha sido respaldado por los proyectos PID2019-108392GB-I00 (AEI/10.13039/ 501100011033) de la Agencia Estatal de Investigación.
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Contribución de congreso (ConferenceOutput)

Diffusion models for remote sensing imagery semantic segmentation

  • Ayala Lauroba, Christian
  • Sesma Redín, Rubén
  • Aranda, Carlos
  • Galar Idoate, Mikel
Denoising Diffusion Probabilistic Models have exhibited impressive performance for generative modelling of images. This paper aims to explore the potential of diffusion models for semantic segmentation tasks in the context of remote sensing. The major challenge of employing these models for semantic segmentation tasks is the generative nature of the model, which produces an arbitrary segmentation mask from a random noise input. Therefore, the diffusion process needs to be constrained to produce a segmentation mask that matches the target image. To address this issue, the denoising process is conditioned by utilizing the input image as a reference. In the experimental study, the proposed model is compared against other state-of-the-art semantic segmentation architectures using the Massachusetts Buildings Aerial dataset. The results of this study provide valuable insights into the potential of diffusion models for semantic segmentation tasks in the field of remote sensing., Thanks to the Government of Navarre for supporting under the industrial PhD program 2020 reference 0011-1408-2020-000008 Thanks to the Spanish Ministry of Science and Innovation for supporting under project PID2019-108392GB-I00 (AEI/10.13039/501100011033) and the Public University of Navarre under project PJUPNA25-2022.
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Contribución de congreso (ConferenceOutput)

New classes of the moderate deviation functions

  • Špirková, Jana
  • Bustince Sola, Humberto
  • Fernández Fernández, Francisco Javier
  • Sesma Sara, Mikel
At present, in the field of aggregation of various input values, attention is focused on the construction of aggregation functions using other functions that can affect the resulting aggregated value. This resulting value should characterize the properties of the individual input values as accurately as possible. Attention is also paid to aggregation using the so-called moderate deviation function. Using this function in aggregation ensures that all properties of aggregation functions are preserved. This work offers constructions of the moderate deviation functions using negations and automorphisms on the symmetric interval [−1, 1] and a general closed interval [a, b] ⊂ [−∞, ∞]., The work of Jana Špirková has been supported by the Slovak Scientific Grant Agency VEGA no. 1/0150/21. The work of Humberto Bustince, Javier Fernandez and Mikel Sesma-Sara has been supported by grand PID2019-108392GB-I00 (AEI/10.13039/501100011033).
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Contribución de congreso (ConferenceOutput)

Explainable classification methods for fish species detection using hydroacoustic data

  • Costa, Lucas Tubino Bonifacio
  • Lucca, Giancarlo
  • Pereira Dimuro, Graçaliz
  • Borges, Eduardo N.
  • Emmendorfer, Leonardo R.
  • Weigert, Stefan Cruz
This work aims to evaluate explainable classification methods for the detection of fish species from hydroacoustic data acquired by echo sounders at a region near the coastline of south and southeastern Brazil. Decision trees and fuzzy rule-based methods were adopted. The fitted models were evaluated by quality measures based on the performance of the classifiers and also by an expert which analyzed the usefulness of the rules on describing the schools. The models learned by the algorithms performed well for the available data and were able to represent the documented behavior of the species considered in the studied region, according to the literature., This study was supported by the Spanish Ministry of Science (TIN2016-77356-P, PID2019-108392GB-I00 AEI/10.13039/501100011033), PNPD/CAPES (464880/2019-00), CNPq (301618/2019-4), FAPERGS (19/2551-0001660), and CAPES Financial Code 001.
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Contribución de congreso (ConferenceOutput)

Improving Michigan-style fuzzy-rule base classification generation using a Choquet-like Copula-based aggregation function

  • Hinojosa-Cardenas, Edward
  • Sarmiento-Calisaya, Edgar
  • Camargo, Heloisa A.
  • Sanz Delgado, José Antonio
This paper presents a modification of a Michigan-style fuzzy rule based classifier by applying the Choquet-like Copula-based aggregation function, which is based on the minimum t-norm and satisfies all the conditions required for an aggregation function. The proposed new version of the algorithm aims at improving the accuracy in comparison to the original algorithm and involves two main modifications: replacing the fuzzy reasoning method of the winning rule by the one based on Choquet-like Copula-based aggregation function and changing the calculus of the fitness of each fuzzy rule. The modification proposed, as well as the original algorithm, uses a (1+1) evolutionary strategy for learning the fuzzy rulebase and it shows promising results in terms of accuracy, compared to the original algorithm, over ten classification datasets with different sizes and different numbers of variables and clases., This work was supported by the Universidad Nacional de San Agustin de Arequipa under Project IBAIB-06-2019-UNSA and in part by the Spanish Ministry of Economy and Competitiveness through the Spanish National Research (project PID2019-108392GB-I00 / AEI / 10.13039/501100011033) and by the Public University of Navarre under the project PJUPNA1926.
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Contribución de congreso (ConferenceOutput)

Multi-temporal data augmentation for high frequency satellite imagery: a case study in Sentinel-1 and Sentinel-2 building and road segmentation

  • Ayala Lauroba, Christian
  • Aranda Magallón, Coral
  • Galar Idoate, Mikel
Semantic segmentation of remote sensing images has many practical applications such as urban planning or disaster assessment. Deep learning-based approaches have shown their usefulness in automatically segmenting large remote sensing images, helping to automatize these tasks. However, deep learning models require large amounts of labeled data to generalize well to unseen scenarios. The generation of global-scale remote sensing datasets with high intraclass variability presents a major challenge. For this reason, data augmentation techniques have been widely applied to artificially increase the size of the datasets. Among them, photometric data augmentation techniques such as random brightness, contrast, saturation, and hue have been traditionally applied aiming at improving the generalization against color spectrum variations, but they can have a negative effect on the model due to their synthetic nature. To solve this issue, sensors with high revisit times such as Sentinel-1 and Sentinel-2 can be exploited to realistically augment the dataset. Accordingly, this paper sets out a novel realistic multi-temporal color data augmentation technique. The proposed methodology has been evaluated in the building and road semantic segmentation tasks, considering a dataset composed of 38 Spanish cities. As a result, the experimental study shows the usefulness of the proposed multi-temporal data augmentation technique, which can be further improved with traditional photometric transformations., Christian Ayala was partially supported by the Government of Navarra under the industrial Ph.D. program 2020 reference 0011-1408-2020-000008. Mikel Galar was partially supported by Tracasa Instrumental S.L. under the project OTRI 2020- 901-156, and by the Spanish MICIN (PID2019-108392GB-I00 / AEI / 10.13039/501100011033).
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Contribución de congreso (ConferenceOutput)

Sobre órdenes admisibles en el conjunto de números borrosos discretos y su aplicación en problemas de toma de decisiones

  • Riera, Juan Vicente
  • Massanet, Sebastia
  • Bustince Sola, Humberto
  • Fernández Fernández, Francisco Javier
Este trabajo es un resumen del artículo [1] publicado en Mathematics para su presentación en la Multiconferencia CAEPIA’21 KeyWorks., Este trabajo ha estado parcialmente financiado por los proyectos FEDER/Ministerio de Economía, Industria y Competitividad - AEI/TIN2016-75404-P y PID2019-108392GBI00 (AEI/10.13039/501100011033).
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Contribución de congreso (ConferenceOutput)

Additively generated (a,b)-implication functions*

  • Santos, Helida
  • Pereira Dimuro, Graçaliz
  • Bedregal, Benjamin
  • Paiva, Rui
  • Lucca, Giancarlo
  • Moura, Bruno
  • Cruz, Anderson
  • Bustince Sola, Humberto
Some problems involving classification through neural networks are known to use inputs out of the scope of the unit interval. Therefore, defining operations on arbitrary closed real intervals may be an interesting strategy to tackle this issue and enhance those application environments. In this paper we follow the ideas already discussed in the literature regarding (a,b)-fusion functions, and (a,b)-negations, to provide a new way to construct implication functions. The main idea is to construct an operator using additively generated functions that preserve the properties required by implication functions., The authors gratefully acknowledge the partial support of Brazilian funding agencies CNPq (301618/2019-4, 200282/2022-0, 409696/2022-6), CNPq/FAPERGS (23/2551-0000126-8), Agencia Estatal de Investigación from the Government of Spain (PID2019-108392GB-I00 (AEI/10.13039/ 501100011033)), and Fundación La Caixa.
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Contribución de congreso (ConferenceOutput)

On the generalizations of the Choquet integral for application in FRBCs

  • Lucca, Giancarlo
  • Borges, Eduardo N.
  • Berri, Rafael A.
  • Emmendorfer, Leonardo R.
  • Pereira Dimuro, Graçaliz
  • Da Cruz Asmus, Tiago
An effective way to cope with classification problems, among others, is by using Fuzzy Rule-Based Classification Systems (FRBCSs). These systems are composed by two main components, the Knowledge Base (KB) and the Fuzzy Reasoning Method (FRM). The FRM is responsible for performing the classification of new examples based on the information stored in the KB. A key point in the FRM is how the information given by the fired fuzzy rules is aggregated. Precisely, the aggregation function is the component that differs from the two most widely used FRMs in the specialized literature. In this paper we provide a revision of the literature discussing the generalizations of the Choquet integral that has been applied in the FRM of a FRBCS. To do so, we consider an analysis of different generalizations, by t-norms, copulas, and by F functions. Also, the main contributions of each generalization are discussed., Supported by PNPD/CAPES (process. 464880/2019-00), FAPERGS (19/2551-0001279-9, 19/2551-0001660), CNPq (301618/2019-4), the Spanish Ministry of Science and Technology (TIN2016-77356-P, PID2019-108392GB I00 (AEI/10.13039/501100 011033)).
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Contribución de congreso (ConferenceOutput)

Extensión multidimensional de la integral de Choquet discreta y su aplicación en redes neuronales recurrentes

  • Ferrero Jaurrieta, Mikel
  • Rodríguez Martínez, Iosu
  • Pereira Dimuro, Graçaliz
  • Fernández Fernández, Francisco Javier
  • Bustince Sola, Humberto
En este trabajo presentamos una definición de la integral de Choquet discreta n-dimensional, para fusionar datos vectoriales. Como aplicación, utilizamos estas nuevas integrales de Choquet discretas multidimensionales en la fusión de información secuencial en las redes neuronales recurrentes, mejorando los resultados obtenidos mediante el método de agregación tradicional., Este trabajo ha sido financiado por la Agencia Estatal de Investigación (España) bajo el proyecto PID2019-108392GBI00 (AEI/10.13039/ 501100011033).
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Contribución de congreso (ConferenceOutput)

General admissibly ordered interval-valued overlap functions

  • Da Cruz Asmus, Tiago
  • Pereira Dimuro, Graçaliz
  • Sanz Delgado, José Antonio
  • Wieczynski, Jonata
  • Lucca, Giancarlo
  • Bustince Sola, Humberto
Overlap functions are a class of aggregation functions that measure the verlapping degree between two values. They have been successfully applied in several problems in which associativity is not required, such as classification and image processing. Some generalizations of overlap functions were proposed for them to be applied in problems with more than two classes, such as 𝑛- dimensional and general overlap functions. To measure the overlapping of interval data, interval-valued overlap functions were defined, and, later, they were also generalized in the form of 𝑛-dimensional and general interval-valued overlap functions. In order to apply some of those concepts in problems with interval data considering the use of admissible orders, which are total orders that refine the most used partial order for intervals, 𝑛-dimensional admissibly ordered interval-valued overlap functions were recently introduced, proving to be suitable to be applied in classification problems. However, the sole construction method presented for this kind of function do not allow the use of the well known lexicographical orders. So, in this work we combine previous developments to introduce general admissibly ordered interval-valued overlap functions, while also presenting different construction methods and the possibility to combine such methods, showcasing the flexibility and adaptability of this approach, while also being compatible with the lexicographical orders., Supported by the Spanish Ministry of Science and Technology (PC093-094 TFIPDL, TIN2016-81731-REDT, TIN2016-77356-P (AEI/FEDER, UE)), Spanish Ministry of Economy and Competitiveness through the Spanish National Research (project PID2019-108392GB-I00 / AEI / 10.13039/501100011033), UPNA (PJUPNA1926), CNPq (311429/2020-3, 301618/2019-4) and FAPERGS (19/2551-0001660).
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Contribución de congreso (ConferenceOutput)

Fuzzy sets complement-based gated recurrent unit

  • Ferrero Jaurrieta, Mikel
  • Pereira Dimuro, Graçaliz
  • Takáč, Zdenko
  • Santiago, Regivan
  • Fernández Fernández, Francisco Javier
  • Bustince Sola, Humberto
Gated Recurrent Units (GRU) are neural network gated architectures that simplify other ones (suchas, LSTM) by joining gates mainly. For this, instead of using two gates, if𝑥is the first gate, standardoperation1−𝑥is used to generate the second one, optimizing the number of parameters. In this work, we interpret this information as a fuzzy set, and we generalize the standard operation using fuzzy negations, and improving the accuracy obtained with the standard one., Grant PID2019-108392GB-I00 funded by MCIN/AEI/10.13039/501100011033 and by Tracasa Instrumental and the Immigration Policy and Justice Department of the Government of Navarre.
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Contribución de congreso (ConferenceOutput)

Content-aware image smoothing based on fuzzy clustering

  • Antunes dos Santos, Felipe
  • López Molina, Carlos
  • Mir Fuentes, Arnau
  • Mendióroz Iriarte, Maite
  • Baets, Bernard de
Literature contains a large variety of content-aware smoothing methods. As opposed to classical smoothing methods, content-aware ones intend to regularize the image while avoiding the loss of relevant visual information. In this work, we propose a novel approach to contentaware image smoothing based on fuzzy clustering, specifically the Spatial Fuzzy c-Means (SFCM) algorithm. We develop the proposal and put it to the test in the context of automatic analysis of immunohistochemistry imagery for neural tissue analysis., The authors gratefully acknowledge the financial support of the Spanish Ministry of Science (Project PID2019-108392GB-I00 AEI/FEDER, UE), as well as the funding from the European Union’s H2020 research and innovation programme under Marie Sklodowska-Curie Grant Agreement Number 801586.
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Contribución de congreso (ConferenceOutput)

Constructing interval-valued fuzzy material implication functions derived from general interval-valued grouping functions

  • Pereira Dimuro, Graçaliz
  • Santos, Helida
  • Da Cruz Asmus, Tiago
  • Wieczynski, Jonata
  • Pinheiro, Jocivania
  • Bedregal, Benjamin
  • Bustince Sola, Humberto
Grouping functions and their dual counterpart, overlap functions, have drawn the attention of many authors, mainly because they constitute a richer class of operators compared to other types of aggregation functions. Grouping functions are a useful theoretical tool to be applied in various problems, like decision making based on fuzzy preference relations. In pairwise comparisons, for instance, those functions allow one to convey the measure of the amount of evidence in favor of either of two given alternatives. Recently, some generalizations of grouping functions were proposed, such as (i) the n-dimensional grouping functions and the more flexible general grouping functions, which allowed their application in n-dimensional problems, and (ii) n-dimensional and general interval-valued grouping functions, in order to handle uncertainty on the definition of the membership functions in real-life problems. Taking into account the importance of interval-valued fuzzy implication functions in several application problems under uncertainty, such as fuzzy inference mechanisms, this paper aims at introducing a new class of interval-valued fuzzy material implication functions. We study their properties, characterizations, construction methods and provide examples., upported by CNPq (301618/2019-4, 311429/2020-3), FAPERGS (19/2551-0001660-3), UFERSA, the Spanish Ministry of Science and Technology (TIN2016-77356-P, PID2019-108392GB I00 (MCIN/AEI/10.13039/501100011033)) and Navarra de Servicios y Tecnologías, S.A. (NASERTIC).
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Contribución de congreso (ConferenceOutput)

Optimizando desviaciones moderadas ponderadas para interfaces cerebro ordenador

  • Fumanal Idocin, Javier
  • Vidaurre Arbizu, Carmen
  • Gómez Fernández, Marisol
  • Urío Larrea, Asier
  • Pereira Dimuro, Graçaliz
  • Bustince Sola, Humberto
Las interfaces cerebro-ordenador (BCI) basadas en el análisis de Electroencefalografía (EEG) están compuestas por varios elementos para procesar y clasificar las señales de entrada del cerebro. Una fase relevante de estos sistemas es el módulo de toma de decisiones, en el que la salida de diferentes clasificadores se fusiona en uno solo. En este trabajo proponemos el uso de funciones basadas en desviaciones moderadas con ponderaciones para la fase de toma de decisiones del sistema de BCI de fusión multimodal mejorado (EMF). Las funciones de agregación basadas en desviación moderada (MD) nos permiten elegir el mejor valor para agregar un vector de puntos utilizando una función de desviación moderada. Usando una MD ponderada, también podemos tener en cuenta la importancia relativa de cada dimensión en los datos multidimensionales que estamos agregando. Utilizando estas funciones en el EMF, podemos ponderar cada una de las diferentes señales cerebrales según su importancia, y utilizando la diferenciación automática, también podemos optimizarlas para el problema concreto a solucionar., La investigación de Javier Fumanal Idocin, A.Urio y Humberto Bustince ha sido apoyada por el proyecto PID2019-108392GB I00 (AEI / 10.13039 / 501100011033). La investigación de Carmen Vidaurre ha sido financiada por el proyecto RyC-2014-15671.
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Contribución de congreso (ConferenceOutput)

Distance transformations based on ordered weighted averaging operators

  • López Molina, Carlos
  • Miguel Turullols, Laura de
  • Iglesias Rey, Sara
  • Bustince Sola, Humberto
  • Baets, Bernard de
Binary image comparison has been a study subject for a long time, often rendering in context-specific solutions that depend upon the type of visual contents in the binary images. Distance transformations have been a recurrent tool in many of such solutions. The literature contains works on the generation and definition of distance transformations, but also on how to make a sensible use of their results. In this work, we attempt to solve one of the most critical problems in the application of distance transformations to real problems: their oversensitivity to certain spurious pixels which, even if having a minimal visual impact in the binary images to be compared, may have a severe impact on their distance transforms. With this aim, we combine distance transformations with Ordered Weighted Averaging (OWA) operators, a well-known information fusion tool from Fuzzy Set Theory., The authors gratefully acknowledge the financial support of the Spanish Research Agency, project PID2019-108392GB-I00 (AEI/10.13039/501100011033), as well as that by Navarra de Servicios y Tecnologías (Nasertic).
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Contribución de congreso (ConferenceOutput)

On construction methods of (interval-valued) general grouping functions

  • Pereira Dimuro, Graçaliz
  • Da Cruz Asmus, Tiago
  • Pinheiro, Jocivania
  • Santos, Helida
  • Borges, Eduardo N.
  • Lucca, Giancarlo
  • Rodríguez Martínez, Iosu
  • Mesiar, Radko
  • Bustince Sola, Humberto
Recently, several theoretical and applied studies on grouping functions and overlap functions appeared in the literature, mainly because of their flexibility when comparing them with the popular aggregation operators t-conorms and t-norms, respectively. Additionally, they constitute richer classes of disjunction/conjunction operations than t-norms and t-conorms. In particular, grouping functions have been applied as the disjunction operator in several problems, like decision making based on fuzzy preference relations. In this case, when performing pairwise comparisons, grouping functions allow one to evaluate the measure of the amount of evidence in favor of either of two given alternatives. However, grouping functions are not associative. Then, in order to allow them to be applied in n-dimensional problems, such as the pooling layer of neural networks, some generalizations were introduced, namely, n-dimensional grouping functions and the more flexible general grouping functions, the latter for enlarging the scope of applications. Then, in order to h andle uncertainty on the definition of the membership functions in real-life problems, n-dimensional and general interval-valued grouping functions were proposed. This paper aims at providing new constructions methods of general (interval-valued) grouping functions, also providing some examples., Supported by CNPq (301618/2019-4, 305805/2021-5), FAPERGS (19/2551-0001660-3), Spanish Ministry Science and Tech. (TIN2016-77356-P, PID2019-108392GB I00 (MCIN/AEI/10.13039/501100011033)), Navarra Servicios y Tecnologías, S.A. (NASERTIC).