|
Constantine Macías A., T. P. A., Realpe Miguel, Suárez Moncada Jenifer, Páez Rosas Diego & Jarrín Enrique Peláez. (2024). Leveraging Deep Learning Techniques for Marine and Coastal Wildlife Using Instance Segmentation: A Study on Galápagos Sea Lions. In 8th Ecuador Technical Chapters Meeting (ETCM 2024) Cuenca, October 15 – October 18, 2024, .
|
|
Dennys Paillacho Chiluiza & Steven Silva Mendoza. (2024). Exploring the Perceptions and Challenges of Social Robot Navigation: Two Case Studies in Different Socio-Technical Contexts. In In 36th Australian Conference on Human-Computer Interaction.
|
Dennys Paillacho, Cecilio Angulo, & Marta Díaz. (2015). An Exploratory Study of Group-Robot Social Interactions in a Cultural Center. In IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2015, International Conference on, Hamburg, Germany, 2015.
Abstract: This article describes an exploratory study of social human-robot interaction with the experimental robotic platform MASHI. The experiences were carried out in La B`obila Cultural Center in Barcelona, Spain to study the visitor preferences, characterize the groups and their spatial relationships in this open and unstructured environment. Results showed that visitors prefers to play and dialogue with the robot. Children have the highest interest in interacting with the robot, more than young and adult visitors. Most of the groups consisted of more than 3 visitors, however the size of the groups during interactions was continuously changed. In static situations, the observed spatial relationships denotes a social cohesion in the human-robot interactions.
|
|
Leo Thomas Ramos & Angel D. Sappa. (2025). Dual-branch ConvNeXt-based Network with Attentional Fusion Decoding for Land Cover Classification Using Multispectral Imagery. In IEEE SoutheastCon 2025.
|
|
Leo Ramos & Angel D. Sappa. (2024). Multispectral Semantic Segmentation for Land Cover Classification: An Overview (Vol. Vol. 17).
|
Cristhian A. Aguilera, Angel D. Sappa, & R. Toledo. (2015). LGHD: A feature descriptor for matching across non-linear intensity variations. In IEEE International Conference on, Quebec City, QC, 2015 (pp. 178–181). Quebec City, QC, Canada: IEEE.
Abstract: This paper presents a new feature descriptor suitable to the task of matching features points between images with nonlinear intensity variations. This includes image pairs with significant illuminations changes, multi-modal image pairs and multi-spectral image pairs. The proposed method describes the neighbourhood of feature points combining frequency and spatial information using multi-scale and multi-oriented Log- Gabor filters. Experimental results show the validity of the proposed approach and also the improvements with respect to the state of the art.
|
|
Steven Silva, N. V., Dennys Paillacho, Samuel Millan-Norman & Juan David Hernandez. (2023). Online Social Robot Navigation in Indoor, Large and Crowded Environments. In IEEE International Conference on Robotics and Automation (ICRA 2023) Londres, 29 may 2023 – 2 jun 2023 (Vol. 2023-May, pp. 9749–9756).
|
Patricia L. Suárez, A. D. S., Boris X. Vintimilla. (2021). Cycle generative adversarial network: towards a low-cost vegetation index estimation. In IEEE International Conference on Image Processing (ICIP 2021) (Vol. 2021-September, pp. 2783–2787).
Abstract: This paper presents a novel unsupervised approach to estimate the Normalized Difference Vegetation Index (NDVI).The NDVI is obtained as the ratio between information from the visible and near infrared spectral bands; in the current work, the NDVI is estimated just from an image of the visible spectrum through a Cyclic Generative Adversarial Network (CyclicGAN). This unsupervised architecture learns to estimate the NDVI index by means of an image translation between the red channel of a given RGB image and the NDVI unpaired index’s image. The translation is obtained by means of a ResNET architecture and a multiple loss function. Experimental results obtained with this unsupervised scheme show the validity of the implemented model. Additionally, comparisons with the state of the art approaches are provided showing improvements with the proposed approach.
|
Cristhian A. Aguilera, Francisco J. Aguilera, Angel D. Sappa, & Ricardo Toledo. (2016). Learning crossspectral similarity measures with deep convolutional neural networks. In IEEE International Conference on Computer Vision and Pattern Recognition (CVPR) Workshops (pp. 267–275).
Abstract: The simultaneous use of images from different spectra can be helpful to improve the performance of many com- puter vision tasks. The core idea behind the usage of cross- spectral approaches is to take advantage of the strengths of each spectral band providing a richer representation of a scene, which cannot be obtained with just images from one spectral band. In this work we tackle the cross-spectral image similarity problem by using Convolutional Neural Networks (CNNs). We explore three different CNN archi- tectures to compare the similarity of cross-spectral image patches. Specifically, we train each network with images from the visible and the near-infrared spectrum, and then test the result with two public cross-spectral datasets. Ex- perimental results show that CNN approaches outperform the current state-of-art on both cross-spectral datasets. Ad- ditionally, our experiments show that some CNN architec- tures are capable of generalizing between different cross- spectral domains.
|
Cristina L. Abad, Yi Lu, & Roy H. Campbell. (2011). DARE: Adaptive Data Replication for Efficient Cluster Scheduling. In IEEE International Conference on Cluster Computing, 2011 (pp. 159–168).
Abstract: Placing data as close as possible to computation is a common practice of data intensive systems, commonly referred to as the data locality problem. By analyzing existing production systems, we confirm the benefit of data locality and find that data have different popularity and varying correlation of accesses. We propose DARE, a distributed adaptive data replication algorithm that aids the scheduler to achieve better data locality. DARE solves two problems, how many replicas to allocate for each file and where to place them, using probabilistic sampling and a competitive aging algorithm independently at each node. It takes advantage of existing remote data accesses in the system and incurs no extra network usage. Using two mixed workload traces from Facebook, we show that DARE improves data locality by more than 7 times with the FIFO scheduler in Hadoop and achieves more than 85% data locality for the FAIR scheduler with delay scheduling. Turnaround time and job slowdown are reduced by 19% and 25%, respectively.
|
