Skip to main content

COMPUTACION DE ALTAS PRESTACIONES Y CLOUD PARA APLICACIONES DE ALTO INTERES

PID2019-104834GB-I00

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Call Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Call year 2019
State Plan 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSIDADE DE SANTIAGO DE COMPOSTELA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 47
Encontrada(s) 1 página(s)

Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

Design of CGAN Models for Multispectral Reconstruction in Remote Sensing

  • Rodríguez Suárez, Brais
  • Quesada Barriuso, Pablo
  • Argüello Pedreira, Francisco
Multispectral imaging methods typically require cameras with dedicated sensors that make them expensive. In some cases, these sensors are not available or existing images are RGB, so the advantages of multispectral processing cannot be exploited. To solve this drawback, several techniques have been proposed to reconstruct the spectral reflectance of a scene from a single RGB image captured by a camera. Deep learning methods can already solve this problem with good spectral accuracy. Recently, a new type of deep learning network, the Conditional Generative Adversarial Network (CGAN), has been proposed. It is a deep learning architecture that simultaneously trains two networks (generator and discriminator) with the additional feature that both networks are conditioned on some sort of auxiliary information. This paper focuses the use of CGANs to achieve the reconstruction of multispectral images from RGB images. Different regression network models (convolutional neuronal networks, U-Net, and ResNet) have been adapted and integrated as generators in the CGAN, and compared in performance for multispectral reconstruction. Experiments with the BigEarthNet database show that CGAN with ResNet as a generator provides better results than other deep learning networks with a root mean square error of 316 measured over a range from 0 to 16,384.
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

Security by Design for Big Data Frameworks over Cloud Computing

  • Awaysheh, Feras M.
  • Aladwan, Mohammad N.
  • Alazab, Mamoun
  • Alawadi, Sadi
  • Cabaleiro Domínguez, José Carlos
  • Fernández Pena, Anselmo Tomás
Cloud deployment architectures have become a preferable computation model of Big Data (BD) operations. Their scalability, flexibility, and cost-effectiveness motivated this trend. In a such deployment model, the data are no longer physically maintained under the user’s direct control, which raises new security concerns. In this context, BD security plays a decisive role in the widespread adoption of cloud architectures. However, it is challenging to develop a comprehensive security plan unless it is based on a preliminary analysis that ensures a realistic secure assembly and addresses domain-specific vulnerabilities. This article presents a novel security-by-design framework for BD frameworks deployment over cloud computing (BigCloud). In particular, it relies on a systematic security analysis methodology and a completely automated security assessment framework. Our framework enables the mapping of BigCloud security domain knowledge to the best practices in the design phase. We validated the proposed framework by implementing an Apache Hadoop stack use case. The study findings demonstrate its effectiveness in improving awareness of security aspects and reducing security design time. It also evaluates the strengths and limitations of the proposed framework, from which it highlights the main existing and open challenges in the BigCloud-related area.
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

Texture Extraction Techniques for the Classification of Vegetation Species in Hyperspectral Imagery: Bag of Words Approach Based on Superpixels

  • Rey Blanco, Sergio
  • Blanco Heras, Dora
  • Argüello Pedreira, Francisco
Texture information allows characterizing the regions of interest in a scene. It refers to the spatial organization of the fundamental microstructures in natural images. Texture extraction has been a challenging problem in the field of image processing for decades. In this paper, different techniques based on the classic Bag of Words (BoW) approach for solving the texture extraction problem in the case of hyperspectral images of the Earth surface are proposed. In all cases the texture extraction is performed inside regions of the scene called superpixels and the algorithms profit from the information available in all the bands of the image. The main contribution is the use of superpixel segmentation to obtain irregular patches from the images prior to texture extraction. Texture descriptors are extracted from each superpixel. Three schemes for texture extraction are proposed: codebook-based, descriptor-based, and spectral-enhanced descriptor-based. The first one is based on a codebook generator algorithm, while the other two include additional stages of keypoint detection and description. The evaluation is performed by analyzing the results of a supervised classification using Support Vector Machines (SVM), Random Forest (RF), and Extreme Learning Machines (ELM) after the texture extraction. The results show that the extraction of textures inside superpixels increases the accuracy of the obtained classification map. The proposed techniques are analyzed over different multi and hyperspectral datasets focusing on vegetation species identification. The best classification results for each image in terms of Overall Accuracy (OA) range from 81.07% to 93.77% for images taken at a river area in Galicia (Spain), and from 79.63% to 95.79% for a vast rural region in China with reasonable computation times
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

LBMA and IMAR2: Weighted lottery based migration strategies for NUMA multiprocessing servers

  • Laso Rodríguez, Rubén
  • García Lorenzo, Óscar
  • Fernández Rivera, Francisco
  • Cabaleiro Domínguez, José Carlos
  • Fernández Pena, Anselmo Tomás
  • Lorenzo del Castillo, Juan Ángel
Multicore NUMA systems present on-board memory hierarchies and communication networks that influence performance when executing shared memory parallel codes. Characterizing this influence is complex, and understanding the effect of particular hardware configurations on different codes is of paramount importance. In this article, monitoring information extracted from hardware counters at runtime is used to characterize the behavior of each thread for an arbitrary number of multithreaded processes running in a multiprocessing environment. This characterization is given in terms of number of operations per second, operational intensity, and latency of memory accesses. We propose a runtime tool, executed in user space, that uses this information to guide two different thread migration strategies for improving execution efficiency by increasing locality and affinity without requiring any modification in the running codes. Different configurations of NAS Parallel OpenMP benchmarks running concurrently on multicore NUMA systems were used to validate the benefits of our proposal, in which up to four processes are running simultaneously. In more than the 95% of the executions of our tool, results outperform those of the operating system (OS) and produces up to 38% improvement in execution time over the OS for heterogeneous workloads, under different and realistic locality and affinity scenarios.
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

Deep learning with simulated laser scanning data for 3D point cloud classification

  • Esmorís Pena, Alberto Manuel
  • Weiser, Hannah
  • Winiwarter, Lukas
  • Cabaleiro Domínguez, José Carlos
  • Höfle, Bernhard
Laser scanning is an active remote sensing technique applied in many disciplines to acquire state-of-the-art spatial measurements. Semantic labeling is often necessary to extract information from the raw point cloud. Deep learning methods constitute a data-hungry solution for the semantic segmentation of point clouds. In this work, we investigate the use of simulated laser scanning for training deep learning models, which are applied to real data subsequently. We show that training a deep learning model purely on virtual laser scanning data can produce results comparable to models trained on real data when evaluated on real data. For leaf-wood segmentation of trees, using the KPConv model trained with virtual data achieves 93.7% overall accuracy, while the model trained on real data reaches 94.7% overall accuracy. In urban contexts, a KPConv model trained on virtual data achieves 74.1% overall accuracy on real validation data, while the model trained on real data achieves 82.4%. Our models outperform the state-of-the-art model FSCT in terms of generalization to unseen real data as well as a baseline model trained on points randomly sampled from the tree mesh surface. From our results, we conclude that the combination of laser scanning simulation and deep learning is a cost-effective alternative to real data acquisition and manual labeling in the domain of geospatial point cloud analysis. The strengths of this approach are that (a) a large amount of diverse laser scanning training data can be generated quickly and without the need for expensive equipment, (b) the simulation configurations can be adapted so that the virtual training data have similar characteristics to the targeted real data, and (c) the whole workflow can be automated through procedural scene generation.
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

Deep Learning for Ultra-Large-Scale Semantic Segmentation of Geographic 3D Point Clouds With Missing Labels

  • Esmorís Pena, Alberto Manuel
  • Yermo, Miguel
  • Rodríguez Alcaraz, Silvia
  • Soutullo, Samuel
  • Fernández Rivera, Francisco
Semantic segmentation of 3D point clouds is a critical task essential for research and industry in a wide variety of domains. Most works until now use datasets where the concept of large-scale varies between 1.17 and 9,261 million points and 0.31 and 250 square kilometers. In this research, we push the limits of 3D deep learning by considering approximately 36,369 million points and 29,557 square kilometers in our case study. To the best of our knowledge, it is the largest geographic region ever classified with neural networks for 3D point clouds in scientific works. The main contributions of our research are: 1) The first published results on semantic segmentation of ultra-large-scale and low-resolution airborne laser scanning point clouds, 2) adapted neural networks to work under missing labels and high measurement error conditions, 3) the introduction of class ambiguity as a more robust uncertainty measurement compared to entropy, and 4) an open-source deep learning framework for 3D point clouds that enables the reproducibility of our experiments and further studies.
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

NetQIR: An extension of QIR for distributed quantum computing

  • Cardama Santiago, Francisco Javier
  • Vázquez Pérez, Jorge
  • Piñeiro Pomar, César Alfredo
  • Fernández Pena, Anselmo Tomás
  • Pichel Campos, Juan Carlos
  • Gómez, Andrés
The rapid advancement of quantum computing has highlighted the need for scalable and efficient software infrastructures to fully exploit its potential. Current quantum processors face significant scalability constraints due to the limited number of qubits per chip. In response, distributed quantum computing (DQC) — achieved by networking multiple quantum processor units (QPUs)— is emerging as a promising solution. To support this paradigm, robust intermediate representations (IRs) are needed to translate high-level quantum algorithms into executable instructions suitable for distributed systems. This paper presents NetQIR, an extension of Microsoft’s Quantum Intermediate Representation (QIR), specifically designed to facilitate DQC by incorporating new instruction specifications. NetQIR was developed in response to the lack of abstraction at the network and hardware layers identified in the existing literature as a significant obstacle to effectively implementing distributed quantum algorithms. Based on this analysis, NetQIR introduces new essential abstraction features to support compilers in DQC contexts. It defines network communication instructions independent of specific hardware, abstracting the complexities of inter-QPU communication. Although the proposed work allows abstraction of the underlying network, it is important to note that it is intended for the development of high-performance code on future modular quantum architectures. Leveraging the QIR framework, NetQIR aims to bridge the gap between high-level quantum algorithm design and low-level hardware execution, thus promoting modular and scalable approaches to quantum software infrastructures for distributed applications. Furthermore, its design may serve as a foundational component for future implementations of distributed quantum standards such as the Quantum Message Passing Interface (QMPI).
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

HSI-MSER: Hyperspectral Image Registration Algorithm based on MSER and SIFT

  • Ordóñez Iglesias, Álvaro
  • Acción Montes, Álvaro
  • Argüello Pedreira, Francisco
  • Blanco Heras, Dora
Image alignment is an essential task in many applications of hyperspectral remote sensing images. Before any processing, the images must be registered. The Maximally Stable Extremal Regions (MSER) is a feature detection algorithm which extracts regions by thresholding the image at different grey levels. These extremal regions are invariant to image transformations making them ideal for registration. The Scale-Invariant Feature Transform (SIFT) is a well-known keypoint detector and descriptor based on the construction of a Gaussian scale-space. This article presents a hyperspectral remote sensing image registration method based on MSER for feature detection and SIFT for feature description. It efficiently exploits the information contained in the different spectral bands to improve the image alignment. The experimental results over nine hyperspectral images show that the proposed method achieves a higher number of correct registration cases using less computational resources than other hyperspectral registration methods. Results are evaluated in terms of accuracy of the registration and also in terms of execution time
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

A novel machine learning workflow to optimize cooling devices grounded in solid-state physics

  • García Fernández, Julián
  • Etesse, Guéric
  • Seoane Iglesias, Natalia
  • Comesaña Figueroa, Enrique
  • Hirakawa, Kazuhiko
  • García Loureiro, Antonio Jesús
  • Bescond, Marc
Cooling devices grounded in solid-state physics are promising candidates for integrated-chip nanocooling applications. These devices are modeled by coupling the quantum non-equilibirum Green’s function for electrons with the heat equation (NEGF+H), which allows to accurately describe the energetic and thermal properties. We propose a novel machine learning (ML) workflow to accelerate the design optimization process of these cooling devices, alleviating the high computational demands of NEGF+H. This methodology, trained with NEGF+H data, obtains the optimum heterostructure designs that provide the best trade-off between the cooling power of the lattice (CP) and the electron temperature (Te). Using a vast search space of 1.18 × 10−5 different device configurations, we obtained a set of optimum devices with prediction relative errors lower than 4 % for CP and 1 % for Te. The ML workflow reduces the computational resources needed, from two days for a single NEGF+H simulation to 10 s to find the optimum designs.
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

Virtual LiDAR simulation as a high performance computing challenge: toward HPC HELIOS++

  • Esmorís Pena, Alberto Manuel
  • Yermo, Miguel
  • Weiser, Hannah
  • Winiwarter, Lukas
  • Höfle, Bernhard
  • Fernández Rivera, Francisco
The software HELIOS++ simulates the laser scanning of a given virtual scene that can be composed of different spatial primitives and 3D meshes with distinct granularity. The high computational cost of this type of simulation software demands efficient computational solutions. Classical solutions based on GPU are not well suited when irregular geometries compose the scene combining different primitives and physics models because they lead to different computation branches. In this paper, we explore the usage of parallelization strategies based on static and dynamic workload balancing and heuristic optimization strategies to speed up the ray tracing process based on a k-dimensional tree (KDT). Using HELIOS++ as our case study, we analyze the performance of our algorithms on different parallel computers, including the CESGA FinisTerrae-II supercomputer. There is a significant performance boost in all cases, with the decrease in computation time ranging from 89.5% to 99.4%. Our results show that the proposed algorithms can boost the performance of any software that relies heavily on a KDT or a similar data structure, as well as those that spend most of the time computing with only a few synchronization barriers. Hence, the algorithms presented in this paper improve performance, whether computed on personal computers or supercomputers
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

Characterizing zebra crossing zones using LiDAR data

  • Esmorís Pena, Alberto Manuel
  • López Vilariño, David
  • Arango, David F.
  • Varela García, Francisco Alberto
  • Cabaleiro Domínguez, José Carlos
  • Fernández Rivera, Francisco
Light detection and ranging (LiDAR) scanning in urban environments leads to accurate and dense three-dimensional point clouds where the different elements in the scene can be precisely characterized. In this paper, two LiDAR-based algorithms that complement each other are proposed. The first one is a novel profiling method robust to noise and obstacles. It accurately characterizes the curvature, the slope, the height of the sidewalks, obstacles, and defects such as potholes. It was effective for 48 of 49 detected zebra crossings, even in the presence of pedestrians or vehicles in the crossing zone. The second one is a detailed quantitative summary of the state of the zebra crossing. It contains information about the location, the geometry, and the road marking. Coarse grain statistics are more prone to obstacle-related errors and are only fully reliable for 18 zebra crossings free from significant obstacles. However, all the anomalous statistics can be analyzed by looking at the associated profiles. The results can help in the maintenance of urban roads. More specifically, they can be used to improve the quality and safety of pedestrian routes
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

CPU and GPU oriented optimizations for LiDAR data processing

  • Muñoz, Felipe
  • Asenjo, Rafael
  • Navarro, Ángeles
  • Cabaleiro Domínguez, José Carlos
Digital Terrain Models (DTM) can be accurately obtained from clouds of LiDAR points but the corresponding cloud processing time can be prohibitive. This paper describes several optimization techniques that have been applied to the Overlap Window Method (OWM) that is a key component in DTM applications. OWM was originally implemented in R which translates into serious limitations in terms of the size of the LiDAR point cloud that can be processed. We have ported the code to C++, significantly optimized the data structure to minimize memory accesses, and developed parallel implementations for CPU and GPU commodity devices using oneAPI libraries and tools. This results in CPU and GPU versions that are up to 19x and 83x faster, respectively, than an OpenMP baseline that uses eight CPU cores. Most importantly, the proposed optimizations for CPU and GPU can be paramount to get the most out of other LiDAR-based algorithms in which the careful selection of the right data structure, parallelization strategies and memory access reduction techniques will certainly result in significant performance improvements.
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

A comprehensive Pelgrom-based on-current variability model for FinFET, NWFET and NSFET

  • García Fernández, Julián
  • Seoane Iglesias, Natalia
  • Comesaña Figueroa, Enrique
  • García Loureiro, Antonio Jesús
We present a novel Pelgrom-based predictive (PBP) model to estimate the impact of variability on the on-current of different state-of-the-art semiconductor devices. In this work, we focus on two of the most problematic sources of variability, the metal grain granularity (MGG) and the line edge roughness (LER). This model allows us to make an accurate prediction of the on-current standard deviation , being the relative error of the predicted data lower than 8% in 92% of the studied cases. The PBP model entails an immense reduction in the computational cost since once it is calibrated for an architecture, the prediction of the impact of a variability on devices with any given dimension can be made without any further simulations. This model could be useful for predicting the effect of variability on future technology nodes
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Capítulo o parte de un libro (BookPart)

Implementación paralela del algoritmo HSI-MSER para el registro de imágenes hiperespectrales

  • Castillo de la Rosa, Daniel del
  • Ordóñez Iglesias, Álvaro
  • Blanco Heras, Dora
  • Argüello Pedreira, Francisco
El registro de imágenes es una tarea destinada a alinear imágenes como un paso anterior a otros tipos de procesado como son la detección de cambios o el seguimiento de objetos. En el caso de imágenes de teledetección hiperespectrales tenemos una gran cantidad de información tanto espacial como espectral para cada imagen. Esto ha propiciado la aparición de métodos de registro específicos para este tipo de imágenes que no solo usan las bandas RGB, como sucede en los algoritmos más clásicos, sino que además aprovechan la información espectral contenida en todas las bandas, que pueden llegar a ser del orden de un centenar. No obstante, para algunos de estos algoritmos, especialmente los basados en detección de características como líneas, puntos o regiones, el tiempo de ejecución sigue siendo una barrera para su uso en aplicaciones que requieren un procesado especialmente rápido. Uno de estos algoritmos es Hyperspectral Image-Maximally Stable Extremal Regions (HSI-MSER), que trata de encontrar regiones comunes en las imágenes explotando la información disponible en las bandas espectrales para conseguir un mejor registro. En este artículo se presenta una versión paralela del algoritmo HSI-MSER sobre una arquitectura heterogénea de bajo coste. Ha sido diseñada para explotar eficientemente las arquitecturas de la CPU y GPU usando OpenMP y CUDA, respectivamente. Como resultado, para imágenes hiperespectrales de teledetección disponibles en la bibliografía estado del arte se consiguen aceleraciones de hasta 7 veces respecto a la versión secuencial de HSI-MSER
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

ResBaGAN: A Residual Balancing GAN with Data Augmentation for Forest Mapping

  • Goldar Dieste, Álvaro
  • Argüello Pedreira, Francisco
  • Blanco Heras, Dora
Although deep learning techniques are known to achieve outstanding classification accuracies, remote sensing datasets often present limited labeled data and class imbalances, two challenges to attaining high levels of accuracy. In recent years, the GAN architecture has achieved great success as a data augmentation method, driving research toward further enhancements. This work presents ResBaGAN, a GAN-based method for the classification of remote sensing images, designed to overcome the challenges of data scarcity and class imbalances by constructing an advanced data augmentation framework. This framework builds upon a GAN architecture enhanced with an autoencoder initialization and class balancing properties, a superpixel-based sample extraction procedure with traditional augmentation techniques, and an improved residual network as classifier. Experiments were conducted on large, very high-resolution multispectral images of riparian forests in Galicia, Spain, with limited training data and strong class imbalances, comparing ResBaGAN to other machine learning methods such as simpler GANs. ResBaGAN achieved higher overall classification accuracies, particularly improving the accuracy of minority classes with F1-score enhancements reaching up to 22%.
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

Using heterogeneous computing and edge computing to accelerate anomaly detection in remotely sensed multispectral images

  • López Fandiño, Javier
  • Blanco Heras, Dora
  • Argüello Pedreira, Francisco
This paper proposes a parallel algorithm exploiting heterogeneous computing and edge computing for anomaly detection (AD) in remotely sensed multispectral images. These images present high spatial resolution and are captured onboard unmanned aerial vehicles. AD is applied to identify patterns within an image that do not conform to the expected behavior. In this paper, the anomalies correspond to human-made constructions that trigger alarms related to the integrity of fluvial ecosystems. An algorithm based on extracting spatial information by using extinction profiles (EPs) and detecting anomalies by using the Reed–Xiaoli (RX) technique is proposed. The parallel algorithm presented in this paper is designed to be executed on multi-node heterogeneous computing platforms that include nodes with multi-core central processing units (CPUs) and graphics processing units (GPUs) and on a mobile embedded system consisting of a multi-core CPU and a GPU. The experiments are carried out on nodes of the FinisTerrae III supercomputer and, with the objective of analyzing its efficiency under different energy consumption scenarios, on a Jetson AGX Orin.
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

QPU integration in OpenCL for heterogeneous programming

  • Vázquez Pérez, Jorge
  • Piñeiro Pomar, César Alfredo
  • Pichel Campos, Juan Carlos
  • Fernández Pena, Anselmo Tomás
  • Gómez, Andrés
The integration of quantum processing units (QPUs) in a heterogeneous high-performance computing environment requires solutions that facilitate hybrid classical–quantum programming. Standards such as OpenCL facilitate the programming of heterogeneous environments, consisting of CPUs and hardware accelerators. This study presents an innovative method that incorporates QPU functionality into OpenCL, standardizing quantum processes within classical environments. By leveraging QPUs within OpenCL, hybrid quantum–classical computations can be sped up, impacting domains like cryptography, optimization problems, and quantum chemistry simulations. Using Portable Computing Language (Jääskeläinen et al. in Int J Parallel Program 43(5):752–785, 2014. https://doi.org/10.1007/s10766-014-0320-y) and the Qulacs library (Suzuki et al. in Quantum 5:559, 2021. https://doi.org/10.22331/q-2021-10-06-559), results demonstrate, for instance, the successful execution of Shor’s algorithm (Nielsen and Chuang in Quantum computation and quantum information, 10th anniversary edn. Cambridge University Press, Cambridge, 2010), serving as a proof of concept for extending the approach to larger qubit systems and other hybrid quantum–classical algorithms. This integration approach bridges the gap between quantum and classical computing paradigms, paving the way for further optimization and application to a wide range of computational problems.
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

GPU Accelerated Waterpixel algorithm for Superpixel Segmentation of Hyperspectral Images

  • Quesada Barriuso, Pablo
  • Blanco Heras, Dora
  • Argüello Pedreira, Francisco
The high computational cost of the superpixel segmentation algorithms for hyperspectral remote sensing images makes them ideal candidates for parallel computation. The waterpixel algorithm, in particular, extracts segmentation regions called waterpixels and consists of four stages called vectorial gradient, spatial regularization, marker selection, and watershed transform. In this paper, an efficient version of a GPU algorithm for waterpixel segmentation using the Compute Unified Device Architecture (CUDA) is presented. The algorithm extracts all the spectral information available in the bands of the hyperspectral image through the vectorial gradient. A cellular automaton is selected for the computation of the watershed transform using a block-asynchronous implementation with 8-connectivity. The experimental analysis shows high speedup values for the resulting GPU algorithm when it is compared to a multicore OpenMP implementation using 8 threads.
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

A hybrid CUDA, OpenMP, and MPI parallel TCA-based domain adaptation for classification of very high-resolution remote sensing images

  • Suárez Garea, Jorge Alberto
  • Blanco Heras, Dora
  • Argüello Pedreira, Francisco
  • Demir, Begüm
Domain Adaptation (DA) is a technique that aims at extracting information from a labeled remote sensing image to allow classifying a different image obtained by the same sensor but at a different geographical location. This is a very complex problem from the computational point of view, specially due to the very high-resolution of multispectral images. TCANet is a deep learning neural network for DA classification problems that has been proven as very accurate for solving them. TCANet consists of several stages based on the application of convolutional filters obtained through Transfer Component Analysis (TCA) computed over the input images. It does not require backpropagation training, in contrast to the usual CNN-based networks, as the convolutional filters are directly computed based on the TCA transform applied over the training samples. In this paper, a hybrid parallel TCA-based domain adaptation technique for solving the classification of very high-resolution multispectral images is presented. It is designed for efficient execution on a multi-node computer by using Message Passing Interface (MPI), exploiting the available Graphical Processing Units (GPUs), and making efficient use of each multicore node by using Open Multi-Processing (OpenMP). As a result, an accurate DA technique from the point of view of classification and with high speedup values over the sequential version is obtained, increasing the applicability of the technique to real problems
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

Pelgrom-based predictive model to estimate metal grain granularity and line edge roughness in advanced multigate MOSFETs

  • García Fernández, Julián
  • Seoane Iglesias, Natalia
  • Comesaña Figueroa, Enrique
  • García Loureiro, Antonio Jesús
The impact of different variability sources on the transistor performance increases as devices are scaled-down, being the metal grain granularity (MGG) and the line edge roughness (LER) some of the major contributors to this increase. Variability studies require the simulation of large samples of different device configurations to have statistical significance, increasing the computational cost. A novel Pelgrom-based predictive (PBP) model that estimates the impact of MGG and LER through the study of the threshold voltage standard deviation (σ VT h), is proposed. This technique is computationally efficient since once the threshold voltage mismatch is calculated, σ V T h can be predicted for different gate lengths (Lg), cross-sections, and intrinsic variability parameters, without further simulations. The validity of the PBP model is demonstrated for three state-of-the-art architectures (FinFETs, nanowire FETs, and nanosheet FETs) with different Lg, cross-sections, and drain biases (VD). The relative errors between the predicted and simulated data are lower than 10%, in the 92% of the cases
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

Watershed Monitoring in Galicia from UAV Multispectral Imagery Using Advanced Texture Methods

  • Argüello Pedreira, Francisco
  • Blanco Heras, Dora
  • Suárez Garea, Jorge Alberto
  • Quesada Barriuso, Pablo
Watershed management is the study of the relevant characteristics of a watershed aimed at the use and sustainable management of forests, land, and water. Watersheds can be threatened by deforestation, uncontrolled logging, changes in farming systems, overgrazing, road and track construction, pollution, and invasion of exotic plants. This article describes a procedure to automatically monitor the river basins of Galicia, Spain, using five-band multispectral images taken by an unmanned aerial vehicle and several image processing algorithms. The objective is to determine the state of the vegetation, especially the identification of areas occupied by invasive species, as well as the detection of man-made structures that occupy the river basin using multispectral images. Since the territory to be studied occupies extensive areas and the resulting images are large, techniques and algorithms have been selected for fast execution and efficient use of computational resources. These techniques include superpixel segmentation and the use of advanced texture methods. For each one of the stages of the method (segmentation, texture codebook generation, feature extraction, and classification), different algorithms have been evaluated in terms of speed and accuracy for the identification of vegetation and natural and artificial structures in the Galician riversides. The experimental results show that the proposed approach can achieve this goal with speed and precision
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

Digital forensic analysis of the private mode of browsers on Android

  • Fernández-Fuentes, Xosé
  • Fernández Pena, Anselmo Tomás
  • Cabaleiro Domínguez, José Carlos
The smartphone has become an essential electronic device in our daily lives. We carry our most precious and important data on it, from family videos of the last few years to credit card information so that we can pay with our phones. In addition, in recent years, mobile devices have become the preferred device for surfing the web, already representing more than 50% of Internet traffic. As one of the devices we spend the most time with throughout the day, it is not surprising that we are increasingly demanding a higher level of privacy. One of the measures introduced to help us protect our data by isolating certain activities on the Internet is the private mode integrated in most modern browsers. Of course, this feature is not new, and has been available on desktop platforms for more than a decade. Reviewing the literature, one can find several studies that test the correct functioning of the private mode on the desktop. However, the number of studies conducted on mobile devices is incredibly small. And not only is it small, but also most of them perform the tests using various emulators or virtual machines running obsolete versions of Android. Therefore, in this paper we apply the methodology we presented in a previous work to Google Chrome, Brave, Mozilla Firefox, and Tor Browser running on a tablet with Android 13 and on two virtual devices created with Android Emulator. The results confirm that these browsers do not store information about the browsing performed in private mode in the file system. However, the analysis of the volatile memory made it possible to recover the username and password used to log in to a website or the keywords typed in a search engine, even after the devices had been rebooted
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

Review of Distributed Quantum Computing: From single QPU to High Performance Quantum Computing

  • Barral, David
  • Cardama Santiago, Francisco Javier
  • Díaz-Camacho, Guillermo
  • Faílde, Daniel
  • Llovo, Iago F.
  • Mussa Juane, Mariamo
  • Vázquez Pérez, Jorge
  • Villasuso, Juan
  • Piñeiro Pomar, César Alfredo
  • Costas, Natalia
  • Pichel Campos, Juan Carlos
  • Fernández Pena, Anselmo Tomás
  • Gómez, Andrés
The emerging field of quantum computing has shown it might change how we process information by using the unique principles of quantum mechanics. As researchers continue to push the boundaries of quantum technologies to unprecedented levels, distributed quantum computing raises as an obvious path to explore with the aim of boosting the computational power of current quantum systems. This paper presents a comprehensive survey of the current state of the art in the distributed quantum computing field, exploring its foundational principles, landscape of achievements, challenges, and promising directions for further research. From quantum communication protocols to entanglement-based distributed algorithms, each aspect contributes to the mosaic of distributed quantum computing, making it an attractive approach to address the limitations of classical computing. Our objective is to offer a comprehensive review that serves both experts in the field and researchers or enthusiasts in quantum computing looking for a starting point to explore the area of distributed quantum computing.
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

CIMAR, NIMAR, and LMMA: novel algorithms for thread and memory migrations in user space on NUMA systems using hardware counters

  • Laso Rodríguez, Rubén
  • García Lorenzo, Óscar
  • Cabaleiro Domínguez, José Carlos
  • Fernández Pena, Anselmo Tomás
  • Lorenzo del Castillo, Juan Ángel
  • Fernández Rivera, Francisco
This paper introduces two novel algorithms for thread migrations, named CIMAR (Core-aware Interchange and Migration Algorithm with performance Record –IMAR–) and NIMAR (Node-aware IMAR), and a new algorithm for the migration of memory pages, LMMA (Latency-based Memory pages Migration Algorithm), in the context of Non-Uniform Memory Access (NUMA) systems. This kind of system has complex memory hierarchies that present a challenging problem in extracting the best possible performance, where thread and memory mapping play a critical role. The presented algorithms gather and process the information provided by hardware counters to make decisions about the migrations to be performed, trying to find the optimal mapping. They have been implemented as a user space tool that looks for improving the system performance, particularly in, but not restricted to, scenarios where multiple programs with different characteristics are running. This approach has the advantage of not requiring any modification on the target programs or the Linux kernel while keeping a low overhead. Two different benchmark suites have been used to validate our algorithms: The NAS parallel benchmark, mainly devoted to computational routines, and the LevelDB database benchmark focused on read–write operations. These benchmarks allow us to illustrate the influence of our proposal in these two important types of codes. Note that those codes are state-of-the-art implementations of the routines, so few improvements could be initially expected. Experiments have been designed and conducted to emulate three different scenarios: a single program running in the system with full resources, an interactive server where multiple programs run concurrently varying the availability of resources, and a queue of tasks where granted resources are limited. The proposed algorithms have been able to produce significant benefits, especially in systems with higher latency penalties for remote accesses. When more than one benchmark is executed simultaneously, performance improvements have been obtained, reducing execution times up to 60%. In this kind of situation, the behaviour of the system is more critical, and the NUMA topology plays a more relevant role. Even in the worst case, when isolated benchmarks are executed using the whole system, that is, just one task at a time, the performance is not degraded
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

A Parallel Skeleton for Divide-and-conquer Unbalanced and Deep Problems

  • Martínez, Millán A.
  • Fraguela, Basilio B.
  • Cabaleiro Domínguez, José Carlos
The Divide-and-conquer (D&C) pattern appears in a large number of problems and is highly suitable to exploit parallelism. This has led to much research on its easy and efficient application both in shared and distributed memory parallel systems. One of the most successful approaches explored in this area consists of expressing this pattern by means of parallel skeletons which automate and hide the complexity of the parallelization from the user while trying to provide good performance. In this paper, we tackle the development of a skeleton oriented to the efficient parallel resolution of D&C problems with a high degree of imbalance among the subproblems generated and/or a deep level of recurrence. The skeleton achieves in our experiments average speedups between 11 and 18% higher than those of other solutions, reaching a maximum speedup of 78% in some tests. Nevertheless, the new proposal requires an average of between 13 and 29% less programming effort than the usual alternatives.
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

A new thread-level speculative automatic parallelization model and library based on duplicate code execution

  • Martínez, Millan A.
  • Fraguela, Basilio B.
  • Cabaleiro Domínguez, José Carlos
  • Fernández Rivera, Francisco
Loop-efficient automatic parallelization has become increasingly relevant due to the growing number of cores in current processors and the programming effort needed to parallelize codes in these systems efficiently. However, automatic tools fail to extract all the available parallelism in irregular loops with indirections, race conditions or potential data dependency violations, among many other possible causes. One of the successful ways to automatically parallelize these loops is the use of speculative parallelization techniques. This paper presents a new model and the corresponding C++ library that supports the speculative automatic parallelization of loops in shared memory systems, seeking competitive performance and scalability while keeping user effort to a minimum. The primary speculative strategy consists of redundantly executing chunks of loop iterations in a duplicate fashion. Namely, each chunk is executed speculatively in parallel to obtain results as soon as possible and sequentially in a different thread to validate the speculative results. The implementation uses C++11 threads and it makes intensive use of templates and advanced multithreading techniques. An evaluation based on various benchmarks confirms that our proposal provides a competitive level of performance and scalability.
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

Laser power converter architectures based on 3C-SiC with efficiencies >80%

  • Fernández Lozano, Javier
  • Seoane Iglesias, Natalia
  • Comesaña Figueroa, Enrique
  • Almonacid, Florencia
  • Fernández , Eduardo
  • García Loureiro, Antonio Jesús
High power laser transmission technology is based on energy transfer through a monochromatic laser onto a photovoltaic receiver avoiding the limitations of conventional wiring. Current technology, headed by GaAs-based devices, faces two limitations: the intrinsic entropic losses and the degradation at high input power densities due to ohmic losses. Two novel laser power converters focused on overcoming these limitations are proposed. 3C-SiC is used as base material because of its high bandgap (2.36 eV) and its excellent crystallographic properties in order to reduce the entropic losses. Also, the current decreases due to the inherent flux reduction of high energy photons. To minimize ohmic losses, a recently proposed vertical architecture is explored, which can significantly reduce series resistance around two orders of magnitude (≈10−5 Ω cm2). Furthermore, 3C-SiC is also implemented in a conventional horizontal architecture to show the advantage of increasing the energy gap to reduce the ohmic losses. The two laser power converters obtain efficiencies above the state-of-the-art (87.4% at 3000 W cm−2 for the vertical architecture and 81.1% at 100 W cm−2 for the horizontal architecture) Taking this into account, the new devices open a new route for ultrahigh efficiency remote powered systems
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

A New Multispectral Data Augmentation Technique Based on Data Imputation

  • Acción Montes, Álvaro
  • Argüello Pedreira, Francisco
  • Blanco Heras, Dora
Deep Learning (DL) has been recently introduced into the hyperspectral and multispectral image classification landscape. Despite the success of DL in the remote sensing field, DL models are computationally intensive due to the large number of parameters they need to learn. The high density of information present in remote sensing imagery with high spectral resolution can make the application of DL models to large scenes challenging. Methods such as patch-based classification require large amounts of data to be processed during the training and prediction stages, which translates into long processing times and high energy consumption. One of the solutions to decrease the computational cost of these models is to perform segment-based classification. Segment-based classification schemes can significantly decrease training and prediction times, and also offer advantages over simply reducing the size of the training datasets by randomly sampling training data. The lack of a large enough number of samples can, however, pose an additional challenge, causing these models to not generalize properly. Data augmentation methods are used to generate new synthetic samples based on existing data to increase the classification performance. In this work, we propose a new data augmentation scheme using data imputation and matrix completion methods for segment-based classification. The proposal has been validated using two high-resolution multispectral datasets from the literature. The results obtained show that the proposed approach successfully increases the classification performance across all the scenes tested and that data imputation methods applied to multispectral imagery are a valid means to perform data augmentation. A comparison of classification accuracy between different imputation methods applied to the proposed scheme was also carried out.
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

A highly optimized skeleton for unbalanced and deep divide‑and‑conquer algorithms on multi‑core clusters

  • Martínez, Millán A.
  • Fraguela, Basilio B.
  • Cabaleiro Domínguez, José Carlos
Efficiently implementing the divide-and-conquer pattern of parallelism in distributed memory systems is very relevant, given its ubiquity, and difficult, given its recursive nature and the need to exchange tasks and data among the processors. This task is noticeably further complicated in the presence of multi-core systems, where hybrid parallelism must be exploited to attain the best performance, and when unbalanced and deep workloads are considered, as additional measures must be taken to load balance and avoid deep recursion problems. In this manuscript a parallel skeleton that fulfills all these requirements while providing high levels of usability is presented. In fact, the evaluation shows that our proposal is on average 415.32% faster than MPI codes and 229.18% faster than MPI + OpenMP benchmarks, while offering an average improvement in the programmability metrics of 131.04% over MPI alternatives and 155.18% over MPI + OpenMP solutions.
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

GaAs Vertical-Tunnel-Junction Converter for Ultra-High Laser Power Transfer

  • Outes, Celia
  • Fernández Fernández, Eduardo
  • Seoane Iglesias, Natalia
  • Almonacid, Florencia
  • García Loureiro, Antonio Jesús
High power laser transmission is being intensively researched as a potential solution to transfer power to remote systems, being the power converter (PC) one of the main limiting factor to improve the system efficiency ( η ). Current PCs are mostly horizontal structures in which the η heavily decreases at large input power. In this work, we propose a novel GaAs-based vertical-tunnel-junction (VTJ) PC suitable for ultra-high (UH) input power density (Pin). This structure does not suffer from η degradation at high Pin because it is designed to have low current density, high output voltage and reduced series resistance (~ 2 orders of magnitude lower than the state-of-the-art PCs). We have demonstrated increasing η with Pin, reaching values higher than 76% at 3000 W⋅ cm−2. This vertical-based architecture enables a new set of potential applications for wireless PC to power remote systems with η exceeding today’ s state-of-the-art PC designs.
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

A fast and optimal pathfinder using airborne LiDAR data

  • Yermo, Miguel
  • Fernández Rivera, Francisco
  • Cabaleiro Domínguez, José Carlos
  • López Vilariño, David
  • Fernández Pena, Anselmo Tomás
Determining the optimal path between two points in a 3D point cloud is a problem that have been addressed in many different situations: from road planning and escape routes determination, to network routing and facility layout. This problem is addressed using different input information, being 3D point clouds one of the most valuables. Its main utility is to save costs, whatever the field of application is. In this paper, we present a fast algorithm to determine the least cost path in an Airborne Laser Scanning point cloud. In some situations, like finding escape routes for instance, computing the solution in a very short time is crucial, and there are not many works developed in this theme. State of the art methods are mainly based on a digital terrain model (DTM) for calculating these routes, and these methods do not reflect well the topography along the edges of the graph. Also, the use of a DTM leads to a significant loss of both information and precision when calculating the characteristics of possible routes between two points. In this paper, a new method that does not require the use of a DTM and is suitable for airborne point clouds, whether they are classified or not, is proposed. The problem is modeled by defining a graph using the information given by a segmentation and a Voronoi Tessellation of the point cloud. The performance tests show that the algorithm is able to compute the optimal path between two points by processing up to 678,820 points per second in a point cloud of 40,000,000 points and 16 km² of extension
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Capítulo o parte de un libro (BookPart)

Redes convolucionales basadas en escalado uniforme de dimensiones para la clasificación de imágenes multiespectrales

  • Vilela Pérez, Nicolás
  • Goldar Dieste, Álvaro
  • Blanco Heras, Dora
  • Argüello Pedreira, Francisco
En el campo de la clasificación de imágenes multi e hiperespectrales se ha popularizado en la última década el uso de técnicas basadas en aprendizaje profundo, en particular las basadas en redes convolucionales. Dado que su coste computacional es más alto que el de las técnicas de aprendizaje automático más clásicas, recientemente se han propuesto nuevos esquemas de clasificación que tienen como objetivo reducir el tiempo de ejecución requerido por ellas. Un modelo de red que ha sido aplicado con éxito a problemas de clasificación de imágenes en la literatura es la llamada red EfficientNet. Este tipo de redes de aprendizaje profundo se caracterizan por realizar un escalado uniforme de las tres dimensiones que componen la red: profundidad, anchura y resolución. De esta forma, se obtiene un modelo con buenas precisiones de clasificación a la vez que se cumplen las restricciones computacionales impuestas por el problema. En este trabajo se propone la adaptación de las redes tipo EfficientNet para resolver la clasificación de imágenes multiespectrales de alta resolución. Se analizan diferentes configuraciones de este tipo de redes variando el escalado de la arquitectura, tanto en términos de precisión de la clasificación del esquema resultante como de tiempo de ejecución. Los experimentos realizados sobre imágenes multiespectrales de alta resolución espacial obtenidas mediante vehículos aéreos no tripulados han mostrado que algunas variantes específicas de EfficientNet permiten una reducción importante del coste computacional sin degradar la precisión de clasificación.
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Contribución de congreso (ConferenceOutput)

Multi-GPU registration of high-resolution multispectral images using HSI-KAZE in a cluster system

  • Ordóñez Iglesias, Álvaro
  • Blanco Heras, Dora
  • Argüello Pedreira, Francisco
Feature-based registration methods have been demonstrated to be very effective to register multispectral images with large distortions or transformations despite the higher execution time that they require. In this paper, a first approach to a multi-node, multi-GPU implementation of the Hyperspectral KAZE (HSI-KAZE) method for co-registering bands and multispectral images is presented. Different multispectral datasets are distributed among the available nodes of a cluster using MPI and exploiting the parallel stream-based capabilities of the GPUs inside each node using CUDA.
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Capítulo o parte de un libro (BookPart)

Exploring the MSER-based hyperspectral remote sensing image registration

  • Ordóñez Iglesias, Álvaro
  • Blanco Heras, Dora
  • Argüello Pedreira, Francisco
Image registration is an essential preprocessing task in many applications of hyperspectral images capturing the Earth surface. Maximally Stable Extremal Regions (MSER) is a feature–based method for image registration which extracts regions by thresholding the image at different grey levels. Its invariance to affine transformations makes it ideal for image registration. This method is usually employed in text detection and recognition as well as in the medical domain. Hyperspectral images contain spectral information that can be used for improving the image alignment. This article presents a first approach to a hyperspectral remote sensing image registration method based on MSER that efficiently exploits the information contained in the different spectral bands. The experimental results over four hyperspectral images show that the proposed method is promising as it achieves a higher number of correct registration cases than other feature–based methods.
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Capítulo o parte de un libro (BookPart)

Alineamiento de imágenes multiespectrales de teledetección en un clúster de GPUs

  • Ordóñez Iglesias, Álvaro
  • Blanco Heras, Dora
  • Argüello Pedreira, Francisco
El registro o alineamiento de imágenes de teledetección multiespectrales o hiperespectrales es una tarea fundamental tras la captura de dichas imágenes, ya que permite alinear las diferentes bandas de la imagen o diferentes imágenes entre sí para construir escenas de mayor tamaño o para construir imágenes de mayor resolución. En los casos en los que es necesario registrar las bandas de una o varias imágenes y posteriormente diferentes imágenes, el tiempo de ejecución es muy alto debido no solo a la complejidad del proceso de registrado sino también a que es necesario ejecutar muchas veces dicho proceso. En este artículo se presenta una implementación multinodo-multiGPU para el registro de bandas e imágenes multiespectrales utilizando el algoritmo HSI-KAZE. Los distintos conjuntos de datos son distribuidos entre los nodos disponibles de un clúster de GPUs usando MPI y a su vez, cada nodo, distribuye las bandas e imágenes de un mismo conjunto entre las distintas GPUs del nodo utilizando OpenMP. Las GPUs son programadas mediante CUDA
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Contribución de congreso (ConferenceOutput)

Prospective Comparison of SURF and Binary Keypoint Descriptors for Fast Hyperspectral Remote Sensing Registration

  • Rodríguez Molina, Adrián
  • Ordóñez Iglesias, Álvaro
  • Blanco Heras, Dora
  • Argüello Pedreira, Francisco
  • López Feliciano, José Francisco
Image registration is a crucial process that involves determining the geometric transformation required to align multiple images. It plays a vital role in various remote sensing image processing tasks that involve analyzing changes among images. To enable real-time response, it is essential to have computationally efficient registration algorithms, especially when dealing with large datasets as is the case of hyperspectral images. This article presents a comparative analysis of two descriptors used to characterize local features of images prior to their matching and registration. The objective is to analyze whether the LATCH binary keypoint descriptor, which produces compact descriptors, provides similar results to the gradient-based SURF descriptor in terms of execution time and registration precision. To obtain the best computational performance, multithreaded implementations using OpenMP have been proposed. LATCH has proven to be 7 times faster and as reliable as SURF in terms of accuracy on scale differences of up to 1.2 times.
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

Consensus Techniques for Unsupervised Binary Change Detection Using Multi-Scale Segmentation Detectors for Land Cover Vegetation Images

  • Cardama Santiago, Francisco Javier
  • Blanco Heras, Dora
  • Argüello Pedreira, Francisco
Change detection in very-high-spatial-resolution (VHR) remote sensing images is a very challenging area with applicability in many problems ranging from damage assessment to land management and environmental monitoring. In this study, we investigated the change detection problem associated with analysing the vegetation corresponding to crops and natural ecosystems over VHR multispectral and hyperspectral images obtained by sensors onboard drones or satellites. The challenge of applying change detection methods to these images is the similar spectral signatures of the vegetation elements in the image. To solve this issue, a consensus multi-scale binary change detection technique based on the extraction of object-based features was developed. With the objective of capturing changes at different granularity levels taking advantage of the high spatial resolution of the VHR images and, as the segmentation operation is not well defined, we propose to use several detectors based on different segmentation algorithms, each applied at different scales. As the changes in vegetation also present high variability depending on capture conditions such as illumination, the use of the CVA-SAM applied at the segment level instead of at the pixel level is also proposed. The results revealed the effectiveness of the proposed approach for identifying changes over land cover vegetation images with different types of changes and different spatial and spectral resolutions.
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

Cheesemap: A high-performance point-indexing data structure for neighbor search in LiDAR data

  • Laso Rodríguez, Rubén
  • Yermo, Miguel
Point-cloud data, as the representation of three-dimensional spatial information, is a fundamental piece of information in various domains where indexing and querying these point clouds efficiently is crucial for tasks such as object recognition, autonomous navigation, and environmental modeling. In this paper, we present a novel data structure, cheesemap, designed for fast neighbor search in 3D LiDAR point clouds. Points are indexed using a grid of voxels, which can be organized in three different ways, originating three flavors of the cheesemap: dense, sparse, and mixed. The lookup of the voxels is theoretically ensured to be performed in constant or amortized constant time, speeding up the search for neighboring points. Experimental results show that cheesemap can outperform, in terms of performance and memory footprint, other state-of-the-art data structures both in region-based and k-NN queries throughout different types of point clouds, particularly for Airborne Laser Scanning (ALS) point clouds
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

Dual-Window Superpixel Data Augmentation for Hyperspectral Image Classification

  • Acción Montes, Álvaro
  • Argüello Pedreira, Francisco
  • Blanco Heras, Dora
Deep learning (DL) has been shown to obtain superior results for classification tasks in the field of remote sensing hyperspectral imaging. Superpixel-based techniques can be applied to DL, significantly decreasing training and prediction times, but the results are usually far from satisfactory due to overfitting. Data augmentation techniques alleviate the problem by synthetically generating new samples from an existing dataset in order to improve the generalization capabilities of the classification model. In this paper we propose a novel data augmentation framework in the context of superpixel-based DL called dual-window superpixel (DWS). With DWS, data augmentation is performed over patches centered on the superpixels obtained by the application of simple linear iterative clustering (SLIC) superpixel segmentation. DWS is based on dividing the input patches extracted from the superpixels into two regions and independently applying transformations over them. As a result, four different data augmentation techniques are proposed that can be applied to a superpixel-based CNN classification scheme. An extensive comparison in terms of classification accuracy with other data augmentation techniques from the literature using two datasets is also shown. One of the datasets consists of small hyperspectral small scenes commonly found in the literature. The other consists of large multispectral vegetation scenes of river basins. The experimental results show that the proposed approach increases the overall classification accuracy for the selected datasets. In particular, two of the data augmentation techniques introduced, namely, dual-flip and dual-rotate, obtained the best results
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

Inqasm: InQuIR compiler to NetQASM

  • Vázquez Pérez, Jorge
  • Cardama Santiago, Francisco Javier
  • Piñeiro Pomar, César Alfredo
  • Pichel Campos, Juan Carlos
  • Fernández Pena, Anselmo Tomás
  • Gómez, Andrés
Quantum computing is a rapidly evolving field, with almost every aspect open to change or improvement. This includes moving from using a single quantum processing unit to interconnecting multiple quantum processing units (or several of them), establishing a new paradigm called distributed quantum computing and increasing the overall computing capability. Some research is already underway in this area to prepare the ground for an eventual architecture with these characteristics. This is the case of InQuIR (Nishio and Wakizaka in arXiv:2302.00267 2023) and NetQASM (Dahlberg et al in QST 7:035023 2022), two languages developed for distributed quantum computing. This paper presents the development of the InQASM compiler with the aim of translating code from the InQuIR language to NetQASM, establishing a compilation stack for the new distributed paradigm. An example of this compilation and a simulation of the compiled code are shown to showcase it.
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Characterizing zebra crossing zones using LiDAR data

  • Esmorís Pena, Alberto Manuel
  • López Vilariño, David
  • Fernández-Arango, David
  • Varela-García, Francisco-Alberto
  • Cabaleiro, José Carlos
  • Rivera, Francisco F.
[Abstract:] Light detection and ranging (LiDAR) scanning in urban environments leads to accurate and dense three-dimensional point clouds where the different elements in the scene can be precisely characterized. In this paper, two LiDAR-based algorithms that complement each other are proposed. The first one is a novel profiling method robust to noise and obstacles. It accurately characterizes the curvature, the slope, the height of the sidewalks, obstacles, and defects such as potholes. It was effective for 48 of 49 detected zebra crossings, even in the presence of pedestrians or vehicles in the crossing zone. The second one is a detailed quantitative summary of the state of the zebra crossing. It contains information about the location, the geometry, and the road marking. Coarse grain statistics are more prone to obstacle-related errors and are only fully reliable for 18 zebra crossings free from significant obstacles. However, all the anomalous statistics can be analyzed by looking at the associated profiles. The results can help in the maintenance of urban roads. More specifically, they can be used to improve the quality and safety of pedestrian routes., This work has received financial support from the Consellería de Cultura, Educación e Ordenación Universitaria (accreditation 2019-2022 ED431G-2019/04, reference competitive group 2019-2021, ED431C 2018/19 and the predoctoral grant of Alberto Esmorís Ref. ED481A-2020/231) and the European Regional Development Fund (ERDF), which acknowledges the CiTIUS-Research Center in Intelligent Technologies of the University of Santiago de Compostela as a Research Center of the Galician University System. This work was also supported by the Ministry of Economy and Competitiveness, Government of Spain (Grant Number PID2019-104834GB-I00) and the National Department of Traffic (DGT) through the project Analysis of Indicators Big-Geodata on Urban Roads for the Dynamic Design of Safe School Roads (Grant Number SPIP2017-02340)., Xunta de Galicia; ED431G-2019/04, Xunta de Galicia; ED431C-2018/19, Xunta de Galicia; ED481A-2020/231, Dirección General de Tráfico (DGT); SPIP2017-02340
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

A Highly Optimized Skeleton for Unbalanced and Deep Divide-And-Conquer Algorithms on Multi-Core Clusters

  • Álvarez Martínez, Millán
  • Fraguela, Basilio B.
  • Cabaleiro, José Carlos
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG , [Abstract] Efficiently implementing the divide-and-conquer pattern of parallelism in distributed memory systems is very relevant, given its ubiquity, and difficult, given its recursive nature and the need to exchange tasks and data among the processors. This task is noticeably further complicated in the presence of multi-core systems, where hybrid parallelism must be exploited to attain the best performance, and when unbalanced and deep workloads are considered, as additional measures must be taken to load balance and avoid deep recursion problems. In this manuscript a parallel skeleton that fulfills all these requirements while providing high levels of usability is presented. In fact, the evaluation shows that our proposal is on average 415.32% faster than MPI codes and 229.18% faster than MPI + OpenMP benchmarks, while offering an average improvement in the programmability metrics of 131.04% over MPI alternatives and 155.18% over MPI + OpenMP solutions., This research was supported by the Ministry of Science and Innovation of Spain (PID2019-104184RB-I00 and PID2019-104834GB-I00, AEI/FEDER/EU, 10.13039/501100011033) and the predoctoral Grant of Millán Álvarez Ref. BES-2017-081320), and by the Xunta de Galicia co-founded by the European Regional Development Fund (ERDF) under the Consolidation Programme of Competitive Reference Groups (ED431C 2018/19 and ED431C 2021/30). We acknowledge also the support from the Centro Singular de Investigación de Galicia “CITIC” and the Centro Singular de Investigación en Tecnoloxías Intelixentes “CiTIUS”, funded by Xunta de Galicia and the European Union (European Regional Development Fund- Galicia 2014-2020 Program), by Grants ED431G 2019/01 and ED431G 2019/04. We also acknowledge the Centro de Supercomputación de Galicia (CESGA). Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature, Xunta de Galicia; ED431C 2018/19, Xunta de Galicia; ED431C 2021/30, Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; ED431G 2019/04
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

A new thread-level speculative automatic parallelization model and library based on duplicate code execution

  • Álvarez Martínez, Millán
  • Fraguela, Basilio B.
  • Cabaleiro, José Carlos
  • Rivera, Francisco F.
Funding for open access charge: Universidade da Coruña/CISUG, Loop-efficient automatic parallelization has become increasingly relevant due to the growing number of cores in current processors and the programming effort needed to parallelize codes in these systems efficiently. However, automatic tools fail to extract all the available parallelism in irregular loops with indirections, race conditions or potential data dependency violations, among many other possible causes. One of the successful ways to automatically parallelize these loops is the use of speculative parallelization techniques. This paper presents a new model and the corresponding C++ library that supports the speculative automatic parallelization of loops in shared memory systems, seeking competitive performance and scalability while keeping user effort to a minimum. The primary speculative strategy consists of redundantly executing chunks of loop iterations in a duplicate fashion. Namely, each chunk is executed speculatively in parallel to obtain results as soon as possible and sequentially in a different thread to validate the speculative results. The implementation uses C++11 threads and it makes intensive use of templates and advanced multithreading techniques. An evaluation based on various benchmarks confirms that our proposal provides a competitive level of performance and scalability., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. This research was supported by Grants PID2019-104184RB-I00, PID2019-104834GB-I00, PID2022-141623NB-I00, and PID2022-136435NB-I00, funded by MCIN/AEI/ 10.13039/501100011033, PID2022 also funded by "ERDF A way of making Europe", EU, and the predoctoral Grant of Millán Álvarez Ref. BES-2017-081320, and by the Xunta de Galicia co-founded by the European Regional Development Fund (ERDF) under the Consolidation Programme of Competitive Reference Groups (ED431C 2021/30 and ED431C 2022/16). Funding for open access charge: Universidade da Coruña/CISUG. We also acknowledge the support from the Centro Singular de Investigación de Galicia "CITIC" and the Centro Singular de Investigación en Tecnoloxías Intelixentes "CiTIUS", funded by Xunta de Galicia and the European Union (European Regional Development Fund- Galicia 2014-2020 Program), by grants ED431G 2019/01 and ED431G 2019/04. We also acknowledge the Centro de Supercomputación de Galicia (CESGA)., Xunta de Galicia; ED431C 2021/30, Xunta de Galicia; ED431C 2022/16, Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; ED431G 2019/04
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Implementation of a motion estimation algorithm for Intel FPGAs using OpenCL

  • Castro, Manuel de
  • Osorio, Roberto
  • López Vilariño, David
  • González-Escribano, Arturo
  • Llanos, Diego R.
Financiado para publicación en acceso aberto: CRUE-CSIC, [Abstract]: Motion Estimation is one of the main tasks behind any video encoder. It is a computationally costly task; therefore, it is usually delegated to specific or reconfigurable hardware, such as FPGAs. Over the years, multiple FPGA implementations have been developed, mainly using hardware description languages such as Verilog or VHDL. Since programming using hardware description languages is a complex task, it is desirable to use higher-level languages to develop FPGA applications.The aim of this work is to evaluate OpenCL, in terms of expressiveness, as a tool for developing this kind of FPGA applications. To do so, we present and evaluate a parallel implementation of the Block Matching Motion Estimation process using OpenCL for Intel FPGAs, usable and tested on an Intel Stratix 10 FPGA. The implementation efficiently processes Full HD frames completely inside the FPGA. In this work, we show the resource utilization when synthesizing the code on an Intel Stratix 10 FPGA, as well as a performance comparison with multiple CPU implementations with varying levels of optimization and vectorization capabilities. We also compare the proposed OpenCL implementation, in terms of resource utilization and performance, with estimations obtained from an equivalent VHDL implementation., Junta de Castilla y León; VA226P20, Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; ED431C 2021/30, This work has been funded by the Consejería de Educación of Junta de Castilla y León, Project PROPHET-2 (VA226P20), and Ministerio de Economía, Industria y Competitividad of Spain, European Regional Development Fund (ERDF) program: Project PCAS (TIN2017-88614-R). David L. Vilariño is funded by Ministerio de Economía, Industria y Competitividad of Spain (PID2019-104834 GB-I00). Roberto R. Osorio is funded by the Ministry of Science and Innovation of Spain (PID2019-104184RB-I00 / AEI / 10.13039/501100011033), and by Xunta de Galicia and FEDER funds of the EU (Centro de Investigacion de Galicia accreditation 2019-2022, ref. ED431G 2019/01; Consolidation Program of Competitive Reference Groups, ref. ED431C 2021/30). This work was also supported in part by grant TED2021-130367B-I00 funded by MCIN/AEI/10.13039/501100011033 and by “European Union NextGenerationEU/PRTR”.
RUC. Repositorio da Universidade da Coruña
Publication Contribución de congreso (ConferenceOutput)

Clasificación y caracterización de elementos de recorrido peatonal en un entorno urbano mediando datos LIDAR

  • Varela-García, Francisco-Alberto
  • Rivera, Francisco F.
  • Esmorís Pena, Alberto Manuel
  • Fernández-Arango, David
  • López Vilariño, David
  • Cabaleiro, José Carlos
Traballo presentado en: R-Evolucionando el transporte, XIV Congreso de Ingeniería del Transporte (CIT 2021), realizado en modalidade online os días 6, 7 e 8 de xullo de 2021, organizado pola Universidad de Burgos., [Resumen:] La seguridad y calidad de la movilidad de los peatones en un ámbito urbano donde conviven con otros modos de desplazamiento debe ser una de las prioridades para cualquier gestor público. Para ello es fundamental disponer de una caracterización precisa de los recorridos peatonales y de los elementos urbanos que forman parte de estos recorridos, como pueden ser los pasos de cebra o los bordillos de separación entre diferentes espacios de movilidad, por ejemplo. El presente trabajo presenta los avances en la clasificación y caracterización de algunos de estos elementos gracias al análisis de los datos obtenidos mediante un escaneado terrestre realizado por un Mobile LiDAR Scanner (MLS) en las calles cercanas a un colegio de la ciudad de A Coruña. Estos análisis se enmarcan dentro de las actividades desarrolladas en el proyecto BIG-GEOMOVE para el análisis de indicadores BIG GeoDATA sobre viarios urbanos para el diseño dinámico de caminos escolares seguros, y que fue financiado en 2017 por la Dirección General de Tráfico. En este texto se muestran los procesos de tratamiento realizados sobre los datos LiDAR y los diferentes algoritmos desarrollados para clasificar la nube de puntos y diferenciar elementos urbanos importantes en los recorridos peatonales, en especial pasos de cebra y bordillos. Además, se presentan los procesos de identificación, cálculo y análisis estadísticos de las caracterizaciones geométricas de los pasos de cebra reconocidos mediante los datos LiDAR. También se avanza en nuevas líneas de trabajo para analizar la calidad y el estado del firme de los recorridos. Los resultados alcanzados muestran un extraordinario potencial para definir con rapidez el estado de los elementos en los recorridos peatonales e identificar lugares y puntos donde es necesario realizar una actuación o mejora en comparación con el resto de elementos caracterizados., Debemos agradecer la financiación conseguida en la convocatoria de subvenciones a proyectos de investigación 2017 de la DGT con el proyecto de referencia SPIP2017-02340 con el título de “Análisis de indicadores big geo-data sobre viarios urbanos para el diseño dinámico de caminos escolares seguros (BIG-GEOMOVE)” que ha servido de base para gran parte de los análisis mostrados en esta comunicación. Además, parte de este trabajo ha recibido el soporte de la Consellería de Educación, Universidade e Formación Profesional de Galicia a través de la acreditación ED431G- 2019/04 y del grupo competitivo ED431C-2018, y por el Ministerio de Economía y Competitividad con el proyecto PID2019-104834GB-I00 y fondos FEDER., Dirección General de Tráfico, DGT; SPIP2017-02340, Xunta de Galicia; ED431G- 2019/04, Xunta de Galicia; ED431C-2018
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Methodology for the simulation of the variability of MOSFETs with polycrystalline high-k dielectrics using CAFM input data

  • Ruiz Flores, Ana|||0000-0002-2475-7353
  • Couso, Carlos|||0000-0003-4757-2439
  • Seoane, Natalia|||0000-0003-0973-461X
  • Porti i Pujal, Marc|||0000-0001-7438-3823
  • Garcia-Loureiro, Antonio|||0000-0003-0574-1513
  • Nafria, Montserrat|||0000-0002-9549-2890
In this work, a simulation methodology, whose inputs are Conductive Atomic Force Microscope (CAFM) experimental data, is proposed to evaluate the impact of nanoscale variability sources related to the polycrystallization of high-k dielectrics (i.e., oxide thickness, tox, and charge density, ρox, fluctuations in the nanometer range) on the Metal-Oxide-Semiconductor Field Effect Transistor (MOSFET) variability. To simulate this variability, a Thickness And Charge MAp Generator (TACMAG) has been developed and used in combination with an in-house-built 3D device simulator (VENDES). From CAFM experimental data (topography and current) obtained on a small area of a given polycrystalline dielectric, the TACMAG generates a high amount of tox and ρox configurations of the gate dielectric, with identical statistical characteristics to those experimentally measured. These dielectrics are then introduced into the device simulator, with which the impact of the tox and ρox fluctuations in the dielectric on the variability of MOSFETs (i.e., threshold voltage) is analyzed. Finally, the impact of different nanoscale parameters, such as the Grain size and Grain Boundaries depth (of polycrystalline dielectrics) on such variability has been evaluated.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Multilevel 3-D Device Simulation Approach Applied to Deeply Scaled Nanowire Field Effect Transistors

  • Seoane, Natalia|||0000-0003-0973-461X
  • Kalna, Karol|||0000-0002-6333-9189
  • Cartoixà, Xavier|||0000-0003-1905-5979
  • Garcia-Loureiro, Antonio|||0000-0003-0574-1513
Three silicon nanowire (SiNW) field effect transistors (FETs) with 15-, 12.5- and 10.6-nm gate lengths are simulated using hierarchical multilevel quantum and semiclassical models verified against experimental ID - VG characteristics. The tight-binding (TB) formalism is employed to obtain the band structure in k-space of ellipsoidal NWs to extract electron effective masses. The masses are transferred into quantum-corrected 3-D finite element (FE) drift-diffusion (DD) and ensemble Monte Carlo (MC) simulations, which accurately capture the quantum-mechanical confinement of the ellipsoidal NW cross sections. We demonstrate that the accurate parameterization of the bandstructure and the quantum-mechanical confinement has a profound impact on the computed ID - VG characteristics of nanoscaled devices. Finally, we devise a step-by-step technology computer-aided design (TCAD) methodology of simple parameterization for efficient DD device simulations.