Edurne Barrenechea
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Edurne Barrenechea has a total of 86 co-authors. Here are the top co-authors by number of shared publications:
- Miguel Pagola
Universidad Pública de Navarra
41 shared publications - Humberto Bustince
Universidad Pública de Navarra
32 shared publications Humberto Bustince
22 shared publications- Javier Fernandez
Research Group of Theory of Copulas and Applications University of Almería 04120 Almería Spain
20 shared publications H. Bustince
18 shared publications- Mikel Galar
Public University of Navarre (UPNA)
15 shared publications
Latest Publications
- 28 June 2021
- Published by Universidad Publica de Navarra. Biblioteca
Nuevos métodos para la combinación de características en procesamiento de imágenes
En esta memoria estudiamos diferentes problemas abiertos entorno a la agregación de información y presentamos el estudio de nuevas técnicas de agregación de características de imágenes para mejorar el rendimiento en los problemas de clasificación y recuperación de imágenes, realizando propuestas para algoritmos de visión por computador tradicional y para modelos de Deep Learning. Concretamente, hemos propuesto un método para agregar información en problemas de clasificación multi-clase a través de ensembles ponderados. También presentamos una nueva función de pooling capaz de auto aprenderse para redes neuronales convolucionales. Centrándonos en el problema de recuperación de imágenes proponemos un esquema de agregación de características donde damos mayor importancia a los objetos relevantes de la imagen y finalmente introducimos una nueva representación de Co-Ocurrencias auto aprendible para redes neuronales convolucionales capaz de capturar la correlación espacial entre diferentes características. La memoria está dividida en dos partes: Parte I. Dedicada al planteamiento del problema, la discusión de los métodos propuestos, los resultados y las conclusiones obtenidas. Parte II. Contiene las publicaciones asociadas al estudio realizado.
- 28 June 2021
- Published by Universidad Publica de Navarra. Biblioteca
Nuevos métodos para la combinación de características en procesamiento de imágenes
En esta memoria estudiamos diferentes problemas abiertos entorno a la agregación de información y presentamos el estudio de nuevas técnicas de agregación de características de imágenes para mejorar el rendimiento en los problemas de clasificación y recuperación de imágenes, realizando propuestas para algoritmos de visión por computador tradicional y para modelos de Deep Learning. Concretamente, hemos propuesto un método para agregar información en problemas de clasificación multi-clase a través de ensembles ponderados. También presentamos una nueva función de pooling capaz de auto aprenderse para redes neuronales convolucionales. Centrándonos en el problema de recuperación de imágenes proponemos un esquema de agregación de características donde damos mayor importancia a los objetos relevantes de la imagen y finalmente introducimos una nueva representación de Co-Ocurrencias auto aprendible para redes neuronales convolucionales capaz de capturar la correlación espacial entre diferentes características. La memoria está dividida en dos partes: Parte I. Dedicada al planteamiento del problema, la discusión de los métodos propuestos, los resultados y las conclusiones obtenidas. Parte II. Contiene las publicaciones asociadas al estudio realizado.
- 1 October 2019
- Published by Elsevier in Information Sciences
- Vol. 501, 19-29
Moderate deviation and restricted equivalence functions for measuring similarity between data
- 1 October 2019
- Published by Elsevier in Information Sciences
- Vol. 501, 19-29
Moderate deviation and restricted equivalence functions for measuring similarity between data
- 22 February 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 28 (1) , 163-177
CFM-BD: A Distributed Rule Induction Algorithm for Building Compact Fuzzy Models in Big Data Classification Problems
- 22 February 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 28 (1) , 163-177
CFM-BD: A Distributed Rule Induction Algorithm for Building Compact Fuzzy Models in Big Data Classification Problems
- Open Access
- 18 May 2018
- Published by Springer Nature
- p. 416-426
Strengthened Ordered Directional and Other Generalizations of Monotonicity for Aggregation Functions
- 18 May 2018
- Published by Springer Nature
- p. 416-426
Open AccessStrengthened Ordered Directional and Other Generalizations of Monotonicity for Aggregation Functions
- 1 March 2018
- Published by Elsevier in Information Sciences
- Vol. 432, 97-115
Interval-valued fuzzy strong S-subsethood measures, interval-entropy and P-interval-entropy
- 1 March 2018
- Published by Elsevier in Information Sciences
- Vol. 432, 97-115
Interval-valued fuzzy strong S-subsethood measures, interval-entropy and P-interval-entropy
- 2 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 26 (4) , 2237-2250
Ordered Directionally Monotone Functions: Justification and Application
In this paper we introduce the notion of ordered directionally monotone function as a type of function which allows monotonicity along different directions in different points. In particular, these functions take into account the ordinal size of the coordinates of the inputs in order to fuse them. We show several examples of these functions and we study their properties. Finally, we present an illustrative example of an application which justifies the introduction and the study of the concept of ordered directional monotonicity.
- 2 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 26 (4) , 2237-2250
Ordered Directionally Monotone Functions: Justification and Application
In this paper we introduce the notion of ordered directionally monotone function as a type of function which allows monotonicity along different directions in different points. In particular, these functions take into account the ordinal size of the coordinates of the inputs in order to fuse them. We show several examples of these functions and we study their properties. Finally, we present an illustrative example of an application which justifies the introduction and the study of the concept of ordered directional monotonicity.
- 1 July 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Some properties and construction methods for ordered directionally monotone functions
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.
- 1 July 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Some properties and construction methods for ordered directionally monotone functions
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.
- 1 July 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Use of OWA operators for feature aggregation in image classification
Feature aggregation is a crucial step in many methods of image classification, like the Bag-of-Words (BoW) model or the Convolutional Neural Networks (CNN). In this aggregation step, usually known as spatial pooling, the descriptors of neighbouring elements within a region of the image are combined into a local or a global feature vector. The combined vector must contain relevant information, while removing irrelevant and confusing details. Maximum and average are the most common aggregation functions used in the pooling step. To improve the aggregation of relevant information without degrading their discriminative power for classification in this work we propose the use of Ordered Weighted operators. We provide an extensive evaluation that shows that the final result of the classification using OWA aggregation is always better than average pooling and better than maximum pooling when dealing with small dictionary sizes.
- 1 July 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Use of OWA operators for feature aggregation in image classification
Feature aggregation is a crucial step in many methods of image classification, like the Bag-of-Words (BoW) model or the Convolutional Neural Networks (CNN). In this aggregation step, usually known as spatial pooling, the descriptors of neighbouring elements within a region of the image are combined into a local or a global feature vector. The combined vector must contain relevant information, while removing irrelevant and confusing details. Maximum and average are the most common aggregation functions used in the pooling step. To improve the aggregation of relevant information without degrading their discriminative power for classification in this work we propose the use of Ordered Weighted operators. We provide an extensive evaluation that shows that the final result of the classification using OWA aggregation is always better than average pooling and better than maximum pooling when dealing with small dictionary sizes.
- 1 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Generalizing an interval-valued image magnification algorithm using homogeneity measures and interval fusion functions
In this work we study and generalize an image magnification algorithm based on the use of interval-valued fuzzy sets. The first proposed generalization incorporates an homogeneity measure that allows to model the length of the intervals generated by the algorithm. The second one makes use of several homogeneity measures and, by means of a fusion function, it combines the intervals generated by each individual homogeneity measure. The results show that our generalization outperforms the original algorithm when an appropriate homogeneity measure is used. Moreover, experiments have demonstrated that the second generalization, based on interval fusion functions, avoids low quality results due to bad homogeneity measures.
- 1 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Generalizing an interval-valued image magnification algorithm using homogeneity measures and interval fusion functions
In this work we study and generalize an image magnification algorithm based on the use of interval-valued fuzzy sets. The first proposed generalization incorporates an homogeneity measure that allows to model the length of the intervals generated by the algorithm. The second one makes use of several homogeneity measures and, by means of a fusion function, it combines the intervals generated by each individual homogeneity measure. The results show that our generalization outperforms the original algorithm when an appropriate homogeneity measure is used. Moreover, experiments have demonstrated that the second generalization, based on interval fusion functions, avoids low quality results due to bad homogeneity measures.
- 12 May 2017
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 437-444
A Study on the Cardinality of Ordered Average Pooling in Visual Recognition
- 12 May 2017
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 437-444
A Study on the Cardinality of Ordered Average Pooling in Visual Recognition