Open Access
Less can be more: representational vs. stereotypical gender bias in facial expression recognition
(Springer, 2024-10-14) Domínguez Catena, Iris; Paternain Dallo, Daniel; Jurío Munárriz, Aránzazu; Galar Idoate, Mikel; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Universidad Publica de Navarra / Nafarroako Unibertsitate Publikoa
Machine learning models can inherit biases from their training data, leading to discriminatory or inaccurate predictions. This is particularly concerning with the increasing use of large, unsupervised datasets for training foundational models. Traditionally, demographic biases within these datasets have not been well-understood, limiting our ability to understand how they propagate to the models themselves. To address this issue, this paper investigates the propagation of demographic biases from datasets into machine learning models. We focus on the gender demographic component, analyzing two types of bias: representational and stereotypical. For our analysis, we consider the domain of facial expression recognition (FER), a field known to exhibit biases in most popular datasets. We use Affectnet, one of the largest FER datasets, as our baseline for carefully designing and generating subsets that incorporate varying strengths of both representational and stereotypical bias. Subsequently, we train several models on these biased subsets, evaluating their performance on a common test set to assess the propagation of bias into the models¿ predictions. Our results show that representational bias has a weaker impact than expected. Models exhibit a good generalization ability even in the absence of one gender in the training dataset. Conversely, stereotypical bias has a significantly stronger impact, primarily concentrated on the biased class, although it can also influence predictions for unbiased classes. These results highlight the need for a bias analysis that differentiates between types of bias, which is crucial for the development of effective bias mitigation strategies.
Open Access
A survey of fingerprint classification Part II: experimental analysis and ensemble proposal
(Elsevier, 2015) Galar Idoate, Mikel; Derrac, Joaquín; Peralta, Daniel; Triguero, Isaac; Paternain Dallo, Daniel; López Molina, Carlos; García, Salvador; Benítez, José Manuel; Pagola Barrio, Miguel; Barrenechea Tartas, Edurne; Bustince Sola, Humberto; Herrera, Francisco; Automática y Computación; Automatika eta Konputazioa
In the first part of this paper we reviewed the fingerprint classification literature from two different perspectives: the feature extraction and the classifier learning. Aiming at answering the question of which among the reviewed methods would perform better in a real implementation we end up in a discussion which showed the difficulty in answering this question. No previous comparison exists in the literature and comparisons among papers are done with different experimental frameworks. Moreover, the difficulty in implementing published methods was stated due to the lack of details in their description, parameters and the fact that no source code is shared. For this reason, in this paper we will go through a deep experimental study following the proposed double perspective. In order to do so, we have carefully implemented some of the most relevant feature extraction methods according to the explanations found in the corresponding papers and we have tested their performance with different classifiers, including those specific proposals made by the authors. Our aim is to develop an objective experimental study in a common framework, which has not been done before and which can serve as a baseline for future works on the topic. This way, we will not only test their quality, but their reusability by other researchers and will be able to indicate which proposals could be considered for future developments. Furthermore, we will show that combining different feature extraction models in an ensemble can lead to a superior performance, significantly increasing the results obtained by individual models.
Open Access
Dissimilarity based choquet integrals
(Springer, 2020) Bustince Sola, Humberto; Mesiar, Radko; Fernández Fernández, Francisco Javier; Galar Idoate, Mikel; Paternain Dallo, Daniel; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika
In this paper, in order to generalize the Choquet integral, we replace the difference between inputs in its definition by a restricted dissimilarity function and refer to the obtained function as d-Choquet integral. For some particular restricted dissimilarity function the corresponding d-Choquet integral with respect to a fuzzy measure is just the ‘standard’ Choquet integral with respect to the same fuzzy measure. Hence, the class of all d-Choquet integrals encompasses the class of all 'standard' Choquet integrals. This approach allows us to construct a wide class of new functions, d-Choquet integrals, that are possibly, unlike the 'standard' Choquet integral, outside of the scope of aggregation functions since the monotonicity is, for some restricted dissimilarity function, violated and also the range of such functions can be wider than [0, 1], in particular it can be [0, n].
Open Access
On the influence of admissible orders in IVOVO
(Springer, 2019) Uriz Martín, Mikel Xabier; Paternain Dallo, Daniel; Bustince Sola, Humberto; Galar Idoate, Mikel; Estatistika, Informatika eta Matematika; Institute of Smart Cities - ISC; Estadística, Informática y Matemáticas; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa, PJUPNA13
It is known that when dealing with interval-valued data, there exist problems associated with the non-existence of a total order. In this work we investigate a reformulation of an interval-valued decomposition strategy for multi-class problems called IVOVO, and we analyze the effectiveness of considering different admissible orders in the aggregation phase of IVOVO. We demonstrate that the choice of an appropriate admissible order allows the method to obtain significant differences in terms of accuracy.
Open Access
Enhancing DreamBooth with LoRA for generating unlimited characters with stable diffusion
(IEEE, 2024-09-09) Pascual Casas, Rubén; Maiza Coupin, Adrián Mikel; Sesma Sara, Mikel; Paternain Dallo, Daniel; Galar Idoate, Mikel; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Institute of Smart Cities - ISC; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa, PJUPNA2023-11377
This paper addresses the challenge of generating unlimited new and distinct characters that encompass the style and shared visual characteristics of a limited set of human designed characters. This is a relevant problem in the audiovisual industry, as the ability to rapidly produce original characters that adhere to specific characteristics greatly increases the possibilities in the production of movies, series, or video games. Our solution is built upon DreamBooth, a widely extended fine-tuning method for text-to-image models. We propose an adaptation focusing on two main challenges: the impracticality of relying on detailed image prompts for character description and the few-shot learning scenario with a limited set of characters available for training. To solve these issues, we introduce additional character-specific tokens to DreamBooth training and remove its class-specific regularization dataset. For an unlimited generation of characters, we propose the usage of random tokens and random embeddings. This proposal is tested on two specialized datasets and the results shows our method¿s capability to produce diverse characters that adhere to a style and visual characteristics. An ablation study to analyze the contributions of the proposed modifications is also developed.
Open Access
d-Choquet integrals: Choquet integrals based on dissimilarities
(Elsevier, 2020) Bustince Sola, Humberto; Mesiar, Radko; Fernández Fernández, Francisco Javier; Galar Idoate, Mikel; Paternain Dallo, Daniel; Altalhi, A. H.; Pereira Dimuro, Graçaliz; Bedregal, Benjamin; Takáč, Zdenko; Estatistika, Informatika eta Matematika; Institute of Smart Cities - ISC; Estadística, Informática y Matemáticas; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa, PJUPNA13
The paper introduces a new class of functions from [0,1]n to [0,n] called d-Choquet integrals. These functions are a generalization of the 'standard' Choquet integral obtained by replacing the difference in the definition of the usual Choquet integral by a dissimilarity function. In particular, the class of all d-Choquet integrals encompasses the class of all 'standard' Choquet integrals but the use of dissimilarities provides higher flexibility and generality. We show that some d-Choquet integrals are aggregation/pre-aggregation/averaging/functions and some of them are not. The conditions under which this happens are stated and other properties of the d-Choquet integrals are studied.
Open Access
Orness for real m-dimensional interval-valued OWA operators and its application to determine a good partition
(Taylor & Francis, 2019) Miguel Turullols, Laura de; Paternain Dallo, Daniel; Lizasoain Iriso, María Inmaculada; Ochoa Lezaun, Gustavo; Bustince Sola, Humberto; Estatistika, Informatika eta Matematika; Institute of Smart Cities - ISC; Institute for Advanced Materials and Mathematics - INAMAT2; Estadística, Informática y Matemáticas; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa, PJUPNA1
Ordered Weighted Averaging (OWA) operators are a profusely applied class of averaging aggregation functions, i.e. operators that always yield a value between the minimum and the maximum of the inputs. The orness measure was introduced to classify the behavior of the OWA operators depending on the weight vectors. Defining a suitable orness measure is an arduous task when we deal with OWA operators defined over more intricate spaces, such us intervals or lattices. In this work we propose a suitable definition for the orness measure to classify OWA operators defined on the set of m-dimensional intervals taking real values in [0, 1]. The orness measure is applied to decide which is the best partition of a continuous range that should be divided into four linguistic labels. This example shows the good behavior of the proposed orness measure.
Open Access
Image reduction using means on discrete product lattices
(IEEE, 2012) Beliakov, Gleb; Bustince Sola, Humberto; Paternain Dallo, Daniel; Automática y Computación; Automatika eta Konputazioa
We investigate the problem of averaging values on lattices, and in particular on discrete product lattices. This problem arises in image processing when several color values given in RGB, HSL, or another coding scheme, need to be combined. We show how the arithmetic mean and the median can be constructed by minimizing appropriate penalties, and we discuss which of them coincide with the Cartesian product of the standard mean and median. We apply these functions in image processing. We present three algorithms for color image reduction based on minimizing penalty functions on discrete product lattices.
Open Access
Application of two different methods for extending lattice-valued restricted equivalence functions used for constructing similarity measures on L-fuzzy sets
(Elsevier, 2018) Palmeira, Eduardo S.; Bedregal, Benjamin; Bustince Sola, Humberto; Paternain Dallo, Daniel; Miguel Turullols, Laura de; Automatika eta Konputazioa; Institute of Smart Cities - ISC; Automática y Computación; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa
Based on previous investigations, we have proposed two different methods to extend lattice-valued fuzzy connectives (t-norms, t-conorms, negations and implications) and other related operators, considering a generalized notion of sublattices. Taking into account the results obtained and seeking to analyze the behavior of both extension methods in face of fuzzy operators related to image processing, we have applied these methods so as to extend restricted equivalence functions, restricted dissimilarity functions and Ee,N-normal functions. We also generalize the concepts of similarity measure, distance measure and entropy measure for L-fuzzy sets constructing them via restricted equivalence functions, restricted dissimilarity functions and Ee,N-normal functions
Open Access
Orness measurements for lattice m-dimensional interval-valued OWA operators
(Elsevier, 2018) Miguel Turullols, Laura de; Paternain Dallo, Daniel; Lizasoain Iriso, María Inmaculada; Ochoa Lezaun, Gustavo; Bustince Sola, Humberto; Estatistika, Informatika eta Matematika; Institute for Advanced Materials and Mathematics - INAMAT2; Institute of Smart Cities - ISC; Estadística, Informática y Matemáticas
Ordered weighted average (OWA) operators are commonly used to aggregate information in multiple situations, such as decision making problems or image processing tasks. The great variety of weights that can be chosen to determinate an OWA operator provides a broad family of aggegating functions, which obviously give diferent results in the aggregation of the same set of data. In this paper, some possible classifications of OWA operators are suggested when they are de ned on m-dimensional intervals taking values on a complete lattice satisfying certain local conditions. A first classification is obtained by means of a quantitative orness measure that gives the proximity of each OWA to the OR operator. In the case in which the lattice is finite, another classification is obtained by means of a qualitative orness measure. In the present paper, several theoretical results are obtained in order to perform this qualitative value for each OWA operator.