Open Access
Image feature extraction using OD-monotone functions
(Springer, 2018) Marco Detchart, Cedric; López Molina, Carlos; Fernández Fernández, Francisco Javier; Pagola Barrio, Miguel; Bustince Sola, Humberto; Estatistika, Informatika eta Matematika; Institute of Smart Cities - ISC; Estadística, Informática y Matemáticas
Edge detection is a basic technique used as a preliminary step for, e.g., object extraction and recognition in image processing. Many of the methods for edge detection can be fit in the breakdown structure by Bezdek, in which one of the key parts is feature extraction. This work presents a method to extract edge features from a grayscale image using the so-called ordered directionally monotone functions. For this purpose we introduce some concepts about directional monotonicity and present two construction methods for feature extraction operators. The proposed technique is competitive with the existing methods in the literature. Furthermore, if we combine the features obtained by different methods using penalty functions, the results are equal or better results than stateof-the-art methods.
Open Access
Convolution lattices
(Elsevier, 2018) Miguel Turullols, Laura de; Bustince Sola, Humberto; Baets, Bernard de; Automatika eta Konputazioa; Institute of Smart Cities - ISC; Automática y Computación
We propose two convolution operations on the set of functions between two bounded lattices and investigate the algebraic structure they constitute, in particular the lattice laws they satisfy. Each of these laws requires the restriction to a specific subset of functions, such as normal, idempotent or convex functions. Combining all individual results, we identify the maximal subsets of functions resulting in a bounded lattice, and show this result to be equivalent to the distributivity of the lattice acting as domain of the functions. Furthermore, these lattices turn out to be distributive as well. Additionally, we show that for the larger subset of idempotent functions, although not satisfying the absorption laws, the convolution operations satisfy the Birkhoff equation.
Open Access
A decision tree based approach with sampling techniques to predict the survival status of poly-trauma patients
(Atlantis Press, 2017) Sanz Delgado, José Antonio; Fernández Fernández, Francisco Javier; Bustince Sola, Humberto; Gradín Purroy, Carlos; Belzunegui Otano, Tomás; Automatika eta Konputazioa; Osasun Zientziak; Institute of Smart Cities - ISC; Automática y Computación; Ciencias de la Salud; Gobierno de Navarra / Nafarroako Gobernua, PI-019/11
Survival prediction of poly-trauma patients measure the quality of emergency services by comparing their predictions with the real outcomes. The aim of this paper is to tackle this problem applying C4.5 since it achieves accurate results and it provides interpretable models. Furthermore, we use sampling techniques because, among the 378 patients treated at the Hospital of Navarre, the number of survivals excels that of deaths. Logistic regressions are used in the comparison, since they are an standard in this domain.
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
Type-2 fuzzy entropy-sets
(IEEE, 2017) Miguel Turullols, Laura de; Santos, Helida; Sesma Sara, Mikel; Bedregal, Benjamin; Jurío Munárriz, Aránzazu; Bustince Sola, Humberto; Automática y Computación; Automatika eta Konputazioa; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa
The final goal of this study is to adapt the concept of fuzzy entropy of De Luca and Termini to deal with Type-2 Fuzzy Sets. We denote this concept Type-2 Fuzzy Entropy-Set. However, the construction of the notion of entropy measure on an infinite set, such us [0, 1], is not effortless. For this reason, we first introduce the concept of quasi-entropy of a Fuzzy Set on the universe [0, 1]. Furthermore, whenever the membership function of the considered Fuzzy Set in the universe [0, 1] is continuous, we prove that the quasi-entropy of that set is a fuzzy entropy in the sense of De Luca y Termini. Finally, we present an illustrative example where we use Type-2 Fuzzy Entropy-Sets instead of fuzzy entropies in a classical fuzzy algorithm.
Open Access
From fuzzy sets to interval-valued and Atanassov intuitionistic fuzzy sets: a unified view of different axiomatic measures
(IEEE, 2019) Couso, Inés; Bustince Sola, Humberto; Estatistika, Informatika eta Matematika; Institute of Smart Cities - ISC; Estadística, Informática y Matemáticas
We examine a broad collection of axiomatic definitions from various and diverse contexts, within the domain of fuzzy sets. We evaluate their respective extensions to the case of interval-valued fuzzy sets and intuitionistic fuzzy sets, from a purely formal point of view. We conclude that a large number of such extensions follow similar formal procedures This fact allows us to formulate a general procedure which encompasses all the reviewed extensions as particular cases of it. The new general formulation allows us to identify three different procedures to derive the corresponding extension to the field of interval-valued fuzzy sets or to the field of intuitionistic fuzzy sets from a specific real-valued measure in the context of fuzzy sets. These three processes agglutinate a multitude of particular constructions found in the literature.
Open Access
Comments on "Interval type-2 fuzzy sets are generalization of interval-valued fuzzy sets: towards a wider view on their relationship" [2]
(IEEE, 2016) Mendel, Jerry M.; Hagras, Hani; Bustince Sola, Humberto; Herrera, Francisco; Automática y Computación; Automatika eta Konputazioa
This letter makes some observations about “Interval type-2 fuzzy sets are generalization of interval-valued fuzzy sets: Towards a wide view on their relationship,” IEEE Trans. Fuzzy Systems that further support the distinction between an interval type-2 fuzzy set (IT2 FS) and an interval-valued fuzzy set (IV FS), points out that all operations, methods, and systems that have been developed and published about IT2 FSs are, so far, only valid in the special case when IT2 FS = IVFS, and suggests some research opportunities.
Open Access
Join and meet operations for type-2 fuzzy sets with non-convex secondary memberships
(IEEE, 2016) Ruiz, Gonzalo; Hagras, Hani; Pomares, Héctor; Rojas, Ignacio; Bustince Sola, Humberto; Automática y Computación; Automatika eta Konputazioa
In this paper we will present two theorems for the join and meet operations for general type-2 fuzzy sets with arbitrary secondary memberships, which can be non-convex and/or non-normal type-1 fuzzy sets. These results will be used to derive the join and meet operations of the more general descriptions of interval type-2 fuzzy sets presented in [1], where the secondary grades can be non-convex. Hence, this work will help to explore the potential of type-2 fuzzy logic systems which use the general forms of interval type-2 fuzzy sets which are not equivalent to interval valued fuzzy sets. Several examples for both general type-2 and the more general forms of interval type-2 fuzzy sets are presented.
Open Access
Local properties of strengthened ordered directional and other forms of monotonicity
(Springer, 2019) Sesma Sara, Mikel; Miguel Turullols, Laura de; Mesiar, Radko; Fernández Fernández, Francisco Javier; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa, PJUPNA13
In this study we discuss some of the recent generalized forms of monotonicity, introduced in the attempt of relaxing the monotonicity condition of aggregation functions. Specifically, we deal with weak, directional, ordered directional and strengthened ordered directional monotonicity. We present some of the most relevant properties of the functions that satisfy each of these monotonicity conditions and, using the concept of pointwise directional monotonicity, we carry out a local study of the discussed relaxations of monotonicity. This local study enables to highlight the differences between each notion of monotonicity. We illustrate such differences with an example of a restricted equivalence function.
Open Access
The interval-valued Choquet integral based on admissible permutations
(IEEE, 2018) Paternain Dallo, Daniel; Miguel Turullols, Laura de; Ochoa Lezaun, Gustavo; Lizasoain Iriso, María Inmaculada; Mesiar, Radko; 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
Aggregation or fusion of interval data is not a trivial task, since the necessity of arranging data arises in many aggregation functions, such as OWA operators or the Choquet integral. Some arranging procedures have been given to solve this problem, but they need certain parameters to be set. In order to solve this problem, in this work we propose the concept of an admissible permutation of intervals. Based on this concept, which avoids any parameter selection, we propose a new approach for the interval-valued Choquet integral that takes into account every possible permutation fitting to the considered ordinal structure of data. Finally, a consensus among all the permutations is constructed.