Bustince Sola, Humberto
Loading...
Email Address
person.page.identifierURI
Birth Date
Job Title
Last Name
Bustince Sola
First Name
Humberto
person.page.departamento
Estadística, Informática y Matemáticas
person.page.instituteName
ISC. Institute of Smart Cities
ORCID
person.page.observainves
person.page.upna
Name
- Publications
- item.page.relationships.isAdvisorOfPublication
- item.page.relationships.isAdvisorTFEOfPublication
- item.page.relationships.isAuthorMDOfPublication
4 results
Search Results
Now showing 1 - 4 of 4
Publication Open Access Penalty function in optimization problems: a review of recent developments(Springer, 2018) Bustince Sola, Humberto; Fernández Fernández, Francisco Javier; Burillo López, Pedro; Automática y Computación; Automatika eta Konputazioa; Institute of Smart Cities - ISCIn this chapter we make a brief revision of some recent developments on the notion of penalty function as a tool for the fusion of information, including the most recently published definition as well as the extension of the concept to the lattice setting.Publication Open Access Moderate deviation and restricted equivalence functions for measuring similarity between data(Elsevier, 2019) Altalhi, A. H.; Forcén Carvalho, Juan Ignacio; Pagola Barrio, Miguel; Barrenechea Tartas, Edurne; Bustince Sola, Humberto; Takáč, Zdenko; Estatistika, Informatika eta Matematika; Institute of Smart Cities - ISC; Estadística, Informática y MatemáticasIn this work we study the relation between moderate deviation functions, restricted dissimilarity functions and restricted equivalence functions. We use moderate deviation functions in order to measure the similarity or dissimilarity between a given set of data. We show an application of moderate deviate functions used in the same way as penalty functions to make a final decision from a score matrix in a classification problem.Publication Open Access Consensus image method for unknown noise removal(Elsevier, 2014) González Jaime, Luis; Kerre, Etienne E.; Nachtegael, Mike; Bustince Sola, Humberto; Automática y Computación; Automatika eta KonputazioaNoise removal has been, and it is nowadays, an important task in computer vision. Usually, it is a previous task preceding other tasks, as segmentation or reconstruction. However, for most existing denoising algorithms the noise model has to be known in advance. In this paper, we introduce a new approach based on consensus to deal with unknown noise models. To do this, different filtered images are obtained, then combined using multifuzzy sets and averaging aggregation functions. The final decision is made by using a penalty function to deliver the compromised image. Results show that this approach is consistent and provides a good compromise between filters.Publication Open Access Supervised penalty-based aggregation applied to motor-imagery based brain-computer-interface(Elsevier, 2024) Fumanal Idocin, Javier; Vidaurre Arbizu, Carmen; Fernández Fernández, Francisco Javier; Gómez Fernández, Marisol; Andreu-Pérez, Javier; Prasad, M.; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Institute for Advanced Materials and Mathematics - INAMAT2; Institute of Smart Cities - ISCIn this paper we propose a new version of penalty-based aggregation functions, the Multi Cost Aggregation choosing functions (MCAs), in which the function to minimize is constructed using a convex combination of two relaxed versions of restricted equivalence and dissimilarity functions instead of a penalty function. We additionally suggest two different alternatives to train a MCA in a supervised classification task in order to adapt the aggregation to each vector of inputs. We apply the proposed MCA in a Motor Imagery-based Brain- Computer Interface (MI-BCI) system to improve its decision making phase. We also evaluate the classical aggregation with our new aggregation procedure in two publicly available datasets. We obtain an accuracy of 82.31% for a left vs. right hand in the Clinical BCI challenge (CBCIC) dataset, and a performance of 62.43% for the four-class case in the BCI Competition IV 2a dataset compared to a 82.15% and 60.56% using the arithmetic mean. Finally, we have also tested the goodness of our proposal against other MI-BCI systems, obtaining better results than those using other decision making schemes and Deep Learning on the same datasets.