Antonio Espinosa

Antonio Espinosa

Auto-generated profile, based on publicly available information

Antonio Espinosa

Universitat Autónoma de Barcelona

Research Focus & Metrics

Academic Career Length

29Years (1998-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2016 in Procedia Computer Science
Verified
Journal Article
Open access
DHD. Hernandez-Juarez
D. Hernandez-Juarez
ACA. Chacón
A. Chacón
AEA. Espinosa
A. Espinosa
DVD. Vázquez
D. Vázquez
JMJ.C. Moure
J.C. Moure
Antonio Manuel LopezAntonio Manuel Lopez
Antonio Manuel Lopez
Dense, robust and real-time computation of depth information from stereo-camera systems is a computationally demanding requirement for robotics, advanced driver assistance systems (ADAS) and autonomous vehicles. Semi-Global Matching (SGM) is a widely used algorithm that propagates consistency constraints along several paths across the image. This work presents a real-time system producing reliable disparity estimation results on the new embedded energy-efficient GPU devices. Our design runs on a Tegra X1 at 42 frames per second (fps) for an image size of 640×480, 128 disparity levels, and using 4 path directions for the SGM method

26 September 2016 in Human Mutation
Verified
Journal Article
Open access
PDF file
SLSteve Laurie
Steve Laurie
MFMarcos Fernandez‐Callejo
Marcos Fernandez‐Callejo
SMSantiago Marco‐Sola
Santiago Marco‐Sola
JTJean‐Remi Trotta
Jean‐Remi Trotta
JCJordi Camps
Jordi Camps
SBSergi Beltran
Sergi Beltran
As whole genome sequencing becomes cheaper and faster, it will progressively substitute targeted next-generation sequencing as standard practice in research and diagnostics. However, computing cost–performance ratio is not advancing at an equivalent rate. Therefore, it is essential to evaluate the robustness of the variant detection process taking into account the computing resources required. We have benchmarked six combinations of state-of-the-art read aligners (BWA-MEM and GEM3) and variant callers (FreeBayes, GATK HaplotypeCaller, SAMtools) on whole genome and whole exome sequencing data from the NA12878 human sample. Results have been compared between them and against the NIST Genome in a Bottle (GIAB) variants reference dataset. We report differences in speed of up to 20 times in some steps of the process and have observed that SNV, and to a lesser extent InDel, detection is highly consistent in 70% of the genome. SNV, and especially InDel, detection is less reliable in 20% of the genome, and almost unfeasible in the remaining 10%. These findings will aid in choosing the appropriate tools bearing in mind objectives, workload, and computing infrastructure available.

1 January 2016 in Procedia Computer Science
Verified
Journal Article
Open access
VCV. Campmany
V. Campmany
SSS. Silva
S. Silva
AEA. Espinosa
A. Espinosa
JMJ.C. Moure
J.C. Moure
DVD. Vázquez
D. Vázquez
Antonio Manuel LopezAntonio Manuel Lopez
Antonio Manuel Lopez
We propose a real-time pedestrian detection system for the embedded Nvidia Tegra X1 GPU-CPU hybrid platform. The detection pipeline is composed by the following state-of-the-art algorithms: features extracted from the input image are Histograms of Local Binary Patterns (LBP) and Histograms of Oriented Gradients (HOG); candidate generation using Pyramidal Sliding Window technique; and classification with Support Vector Machine (SVM). Experimental results show that the Tegra ARM platform is two times more energy efficient than a desktop GPU and at least 8 times faster than a desktop multicore CPU

1 January 2013 in Procedia Computer Science
Verified
Journal Article
Open access
ACAlejandro Chacón
Alejandro Chacón
JMJuan Carlos Moure
Juan Carlos Moure
AEAntonio Espinosa
Antonio Espinosa
PHPorfidio Hernández
Porfidio Hernández
Fast pattern matching is a requirement for many problems, specially for bioinformatics sequence analysis like short read mapping applications. This work presents a variation of the FM-index method, denoted n-step FM-index, that is applied in exact match genome search.We propose an alternative two-dimensional FM-index structure that allows backward-search navigation giving steps of n symbols at a time. The main advantages of this arrangement are the reduction of the computational work, but most importantly, the reduction by n of the chain of dependent data accesses, and the increase in the temporal locality of the data access pattern. This benefit comes at the expense of increasing the total amount of data required for the index.We present an in-depth performance analysis of a multi-core implementation of the algorithm using large references (up to 1.5G). We identify memory latency as the major performance limiter for single-thread execution and memory bandwidth for multi-thread execution. Our proposal provides speedups ranging from 1.4× to 2.4×, when there is no limitation on DRAM capacity.We also analyse the trade-off of compacting the proposed data structure in order to reduce memory capacity requirements, now at the expense of increasing execution time. An extra 33% of DRAM space allows our proposal to improve performance by 1.2×, while doubling DRAM size enables an additional 1.5×.Our proposal of n-step algorithm provides an alternative for pseudo-random memory access algorithms to be redesigned to scale in current and future computer systems

10 June 2014
Verified
Conference Paper
Open access
PDF file
ACAlejandro Chacón
Alejandro Chacón
SMSantiago Marco-Sola
Santiago Marco-Sola
AEAntonio Espinosa
Antonio Espinosa
Paolo RibecaPaolo Ribeca
Paolo Ribeca
JMJuan Carlos Moure
Juan Carlos Moure
Approximate string matching is a very important problem in computational biology; it requires the fast computation of string distance as one of its essential components. Myers’ bit-parallel algorithm improves the classical dynamic programming approach to Levenshtein distance computation, and offers competitive performance on CPUs. The main challenge when designing an efficient GPU implementation is to expose enough SIMD parallelism while at the same time keeping a relatively small working set for each thread. In this work we implement and optimise a CUDA version of Myers’ algorithm suitable to be used as a building block for DNA sequence alignment. We achieve high efficiency by means of a cooperative parallelisation strategy for (1) very-long integer addition and shift operations, and (2) several simultaneous pattern matching tasks. In addition, we explore the performance impact obtained when using features specific to the Kepler architecture. Our results show an overall performance of the order of tera cells updates per second using a single high-end Nvidia GPU, and factor speedups in excess of 20 with respect to a sixteen-core, non-vectorised CPU implementation

4 December 2014 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Open access
ACAlejandro Chacon
Alejandro Chacon
SMSantiago Marco-Sola
Santiago Marco-Sola
AEAntonio Espinosa
Antonio Espinosa
Paolo RibecaPaolo Ribeca
Paolo Ribeca
JMJuan Carlos Moure
Juan Carlos Moure
The recent advent of high-throughput sequencing machines producing big amounts of short reads has boosted the interest in efficient string searching techniques. As of today, many mainstream sequence alignment software tools rely on a special data structure, called the FM-index, which allows for fast exact searches in large genomic references. However, such searches translate into a pseudo-random memory access pattern, thus making memory access the limiting factor of all computation-efficient implementations, both on CPUs and GPUs. Here, we show that several strategies can be put in place to remove the memory bottleneck on the GPU: more compact indexes can be implemented by having more threads work cooperatively on larger memory blocks, and a k-step FM-index can be used to further reduce the number of memory accesses. The combination of those and other optimisations yields an implementation that is able to process about two Gbases of queries per second on our test platform, being about 8× faster than a comparable multi-core CPU version, and about 3× to 5× faster than the FM-index implementation on the GPU provided by the recently announced Nvidia NVBIO bioinformatics library.