Person: López Molina, Carlos
Loading...
Email Address
person.page.identifierURI
Birth Date
Research Projects
Organizational Units
Job Title
Last Name
López Molina
First Name
Carlos
person.page.departamento
Estadística, Informática y Matemáticas
person.page.instituteName
ORCID
0000-0002-0904-9834
person.page.upna
810097
Name
28 results
Search Results
Now showing 1 - 10 of 28
Publication Restricted Servicios de localización para terminales moviles en redes WiFi(2006) López Molina, Carlos; Escuela Técnica Superior de Ingenieros Industriales y de Telecomunicación; Telekomunikazio eta Industria Ingeniarien Goi Mailako Eskola TeknikoaPublication Open Access Fuzzy integrals for edge detection(Springer, 2023) Marco Detchart, Cedric; Lucca, Giancarlo; Pereira Dimuro, Graçaliz; Da Cruz Asmus, Tiago; López Molina, Carlos; Borges, Eduardo N.; Rincon, J. A.; Julian, Vicente; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta MatematikaIn this work, we compare different families of fuzzy integrals in the context of feature aggregation for edge detection. We analyze the behaviour of the Sugeno and Choquet integral and some of its generalizations. In addition, we study the influence of the fuzzy measure over the extracted image features. For testing purposes, we follow the Bezdek Breakdown Structure for edge detection and compare the different fuzzy integrals with some classical feature aggregation methods in the literature. The results of these experiments are analyzed and discussed in detail, providing insights into the strengths and weaknesses of each approach. The overall conclusion is that the configuration of the fuzzy measure does have a paramount effect on the results by the Sugeno integral, but also that satisfactory results can be obtained by sensibly tuning such parameter. The obtained results provide valuable guidance in choosing the appropriate family of fuzzy integrals and settings for specific applications. Overall, the proposed method shows promising results for edge detection and could be applied to other image-processing tasks.Publication Open Access Operador de comparación de elementos multivaluados basado en funciones de equivalencia restringida(Universidad de Málaga, 2021) Castillo López, Aitor; López Molina, Carlos; Fernández Fernández, Francisco Javier; Sesma Sara, Mikel; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta MatematikaEn 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.Publication Open Access A framework for active contour initialization with application to liver segmentation in MRI(Springer, 2022) Mir Torres, Arnau; Antunes dos Santos, Felipe; Fernández Fernández, Francisco Javier; López Molina, Carlos; Estadística, Informática y Matemáticas; Estatistika, Informatika eta MatematikaObject 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.Publication Open Access Hyperspectral imaging using notions from type-2 fuzzy sets(Springer, 2019) López Maestresalas, Ainara; Miguel Turullols, Laura de; López Molina, Carlos; Arazuri Garín, Silvia; Bustince Sola, Humberto; Jarén Ceballos, Carmen; Ingeniería; Ingeniaritza; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Universidad Pública de Navarra / Nafarroako Unibertsitate PublikoaFuzzy set theory has developed a prolific armamentarium of mathematical tools for each of the topics that has fallen within its scope. One of such topics is data comparison, for which a range of operators has been presented in the past. These operators can be used within the fuzzy set theory, but can also be ported to other scenarios in which data are provided in various representations. In this work, we elaborate on notions for type-2 fuzzy sets, specifically for the comparison of type-2 fuzzy membership degrees, to create function comparison operators. We further apply these operators to hyperspectral imaging, in which pixelwise data are provided as functions over a certain energy spectra. The performance of the functional comparison operators is put to the test in the context of in-laboratory hyperspectral image segmentation.Publication Embargo Non-symmetric over-time pooling using pseudo-grouping functions for convolutional neural networks(Elsevier, 2024) Ferrero Jaurrieta, Mikel; Paiva, Rui; Cruz, Anderson; Callejas Bedregal, Benjamin; Miguel Turullols, Laura de; Takáč, Zdenko; López Molina, Carlos; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Institute of Smart Cities - ISCConvolutional Neural Networks (CNNs) are a family of networks that have become state-of-the-art in several fields of artificial intelligence due to their ability to extract spatial features. In the context of natural language processing, they can be used to build text classification models based on textual features between words. These networks fuse local features to generate global features in their over-time pooling layers. These layers have been traditionally built using the maximum function or other symmetric functions such as the arithmetic mean. It is important to note that the order of input local features is significant (i.e. the symmetry is not an inherent characteristic of the model). While this characteristic is appropriate for image-oriented CNNs, where symmetry might make the network robust to image rigid transformations, it seems counter-productive for text processing, where the order of the words is certainly important. Our proposal is, hence, to use non-symmetric pooling operators to replace the maximum or average functions. Specifically, we propose to perform over-time pooling using pseudo-grouping functions, a family of non-symmetric aggregation operators that generalize the maximum function. We present a construction method for pseudo-grouping functions and apply different examples of this family to over-time pooling layers in text-oriented CNNs. Our proposal is tested on seven different models and six different datasets in the context of engineering applications, e.g. text classification. The results show an overall improvement of the models when using non-symmetric pseudo-grouping functions over the traditional pooling function.Publication Open Access From restricted equivalence functions on Ln to similarity measures between fuzzy multisets(IEEE, 2023) Ferrero Jaurrieta, Mikel; Takáč, Zdenko; Rodríguez Martínez, Iosu; Marco Detchart, Cedric; Bernardini, Ángela; Fernández Fernández, Francisco Javier; López Molina, Carlos; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta MatematikaRestricted equivalence functions are well-known functions to compare two numbers in the interval between 0 and 1. Despite the numerous works studying the properties of restricted equivalence functions and their multiple applications as support for different similarity measures, an extension of these functions to an n-dimensional space is absent from the literature. In this paper, we present a novel contribution to the restricted equivalence function theory, allowing to compare multivalued elements. Specifically, we extend the notion of restricted equivalence functions from L to L n and present a new similarity construction on L n . Our proposal is tested in the context of color image anisotropic diffusion as an example of one of its many applications.Publication 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 KonputazioaIn 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.Publication Open Access Reduction of complexity using generators of pseudo-overlap and pseudo-grouping functions(2024) Ferrero Jaurrieta, Mikel; Paiva, Rui; Cruz, Anderson; Bedregal, Benjamín; Zhang, Xiaohong; Takac, Zdenko; López Molina, Carlos; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta MatematikaOverlap and grouping functions can be used to measure events in which we must consider either the maximum or the minimum lack of knowledge. The commutativity of overlap and grouping functions can be dropped out to introduce the notions of pseudo-overlap and pseudo-grouping functions, respectively. These functions can be applied in problems where distinct orders of their arguments yield different values, i.e., in non-symmetric contexts. Intending to reduce the complexity of pseudo-overlap and pseudo-grouping functions, we propose new construction methods for these functions from generalized concepts of additive and multiplicative generators. We investigate the isomorphism between these families of functions. Finally, we apply these functions in an illustrative problem using them in a time series prediction combined model using the IOWA operator to evidence that using these generators and functions implies better performance.Publication Open Access Neuro-inspired edge feature fusion using Choquet integrals(Elsevier, 2021) Marco Detchart, Cedric; Lucca, Giancarlo; López Molina, Carlos; Miguel Turullols, Laura de; Pereira Dimuro, Graçaliz; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Universidad Pública de Navarra / Nafarroako Unibertsitate PublikoaIt is known that the human visual system performs a hierarchical information process in which early vision cues (or primitives) are fused in the visual cortex to compose complex shapes and descriptors. While different aspects of the process have been extensively studied, such as lens adaptation or feature detection, some other aspects, such as feature fusion, have been mostly left aside. In this work, we elaborate on the fusion of early vision primitives using generalizations of the Choquet integral, and novel aggregation operators that have been extensively studied in recent years. We propose to use generalizations of the Choquet integral to sensibly fuse elementary edge cues, in an attempt to model the behaviour of neurons in the early visual cortex. Our proposal leads to a fully-framed edge detection algorithm whose performance is put to the test in state-of-the-art edge detection datasets.
- «
- 1 (current)
- 2
- 3
- »