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
17 results
Search Results
Now showing 1 - 10 of 17
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 Evaluation of near-infrared hyperspectral imaging for the assessment of potato processing aptitude(Frontiers Media, 2022) López Maestresalas, Ainara; López Molina, Carlos; Oliva Lobo, Gil Alfonso; Jarén Ceballos, Carmen; Ruiz de Galarreta, José Ignacio; Peraza Alemán, Carlos Miguel; Arazuri Garín, Silvia; Ingeniaritza; Estatistika, Informatika eta Matematika; Institute on Innovation and Sustainable Development in Food Chain - ISFOOD; Ingeniería; Estadística, Informática y MatemáticasThe potato (Solanum tuberosum L.) is the world's fifth most important staple food with high socioeconomic relevance. Several potato cultivars obtained by selection and crossbreeding are currently on the market. This diversity causes tubers to exhibit different behaviors depending on the processing to which they are subjected. Therefore, it is interesting to identify cultivars with specific characteristics that best suit consumer preferences. In this work, we present a method to classify potatoes according to their cooking or frying as crisps aptitude using NIR hyperspectral imaging (HIS) combined with a Partial Least Squares Discriminant Analysis (PLS-DA). Two classification approaches were used in this study. First, a classification model using the mean spectra of a dataset composed of 80 tubers belonging to 10 different cultivars. Then, a pixel-wise classification using all the pixels of each sample of a small subset of samples comprised of 30 tubers. Hyperspectral images were acquired using fresh-cut potato slices as sample material placed on a mobile platform of a hyperspectral system in the NIR range from 900 to 1,700 nm. After image processing, PLS-DA models were built using different pre-processing combinations. Excellent accuracy rates were obtained for the models developed using the mean spectra of all samples with 90% of tubers correctly classified in the external dataset. Pixel-wise classification models achieved lower accuracy rates between 66.62 and 71.97% in the external validation datasets. Moreover, a forward interval PLS (iPLS) method was used to build pixel-wise PLS-DA models reaching accuracies above 80 and 71% in cross-validation and external validation datasets, respectively. Best classification result was obtained using a subset of 100 wavelengths (20 intervals) with 71.86% of pixels correctly classified in the validation dataset. Classification maps were generated showing that false negative pixels were mainly located at the edges of the fresh-cut slices while false positive were principally distributed at the central pith, which has singular characteristics.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 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 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 Reduction of complexity using generators of pseudo-overlap and pseudo-grouping functions(2024) Ferrero Jaurrieta, Mikel; Paiva, Rui; Cruz, Anderson; Callejas Bedregal, Benjamin; 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 Hyperspectral system trade-offs for illumination, hardware and analysis methods: a case study of seed mix ingredient discrimination(IM Publications, 2020) Blanch Pérez del Notario, Carolina; López Molina, Carlos; Lambrechts, Andy; Saeys, Wouter; Estadística, Informática y Matemáticas; Estatistika, Informatika eta MatematikaThe discrimination power of a hyperspectral imaging system for image segmentation or object detection is determined by the illumination, the camera spatial–spectral resolution, and both the pre-processing and analysis methods used for image processing. In this study, we methodically reviewed the alternatives for each of those factors for a case study from the food industry to provide guidance in the construction and configuration of hyperspectral imaging systems in the visible near infrared range for food quality inspection. We investigated both halogen-and LED-based illuminations and considered cameras with different spatial–spectral resolution trade-offs. At the level of the data analysis, we evaluated the impact of binning, median filtering and bilateral filtering as pre-or post-processing and compared pixel-based classifiers with convolutional neural networks for a challenging application in the food industry, namely ingredient identification in a flour–seed mix. Starting from a basic configuration and by modifying the combination of system aspects we were able to increase the mean accuracy by at least 25%. In addition, different trade-offs in performance-complexity were identified for different combinations of system parameters, allowing adaptation to diverse application requirements.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.Publication Open Access Content-aware image smoothing based on fuzzy clustering(Springer, 2022) Antunes dos Santos, Felipe; López Molina, Carlos; Mir Fuentes, Arnau; Mendióroz Iriarte, Maite; Baets, Bernard de; Estadística, Informática y Matemáticas; Estatistika, Informatika eta MatematikaLiterature contains a large variety of content-aware smoothing methods. As opposed to classical smoothing methods, content-aware ones intend to regularize the image while avoiding the loss of relevant visual information. In this work, we propose a novel approach to contentaware image smoothing based on fuzzy clustering, specifically the Spatial Fuzzy c-Means (SFCM) algorithm. We develop the proposal and put it to the test in the context of automatic analysis of immunohistochemistry imagery for neural tissue analysis.Publication Open Access On the role of distance transformations in Baddeley's Delta Metric(Elsevier, 2021) López Molina, Carlos; Iglesias Rey, Sara; Bustince Sola, Humberto; Baets, Bernard de; Estadística, Informática y Matemáticas; Estatistika, Informatika eta MatematikaComparison and similarity measurement have been a key topic in computer vision for a long time. There is, indeed, an extensive list of algorithms and measures for image or subimage comparison. The superiority or inferiority of different measures is hard to scrutinize, especially considering the dimensionality of their parameter space and their many different configurations. In this work, we focus on the comparison of binary images, and study different variations of Baddeley's Delta Metric, a popular metric for such images. We study the possible parameterizations of the metric, stressing the numerical and behavioural impact of different settings. Specifically, we consider the parameter settings proposed by the original author, as well as the substitution of distance transformations by regularized distance transformations, as recently presented by Brunet and Sills. We take a qualitative perspective on the effects of the settings, and also perform quantitative experiments on separability of datasets for boundary evaluation.