Elena Martín-González

Ms. Elena Martín-González

orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
19 June 2020 in Entropy
Verified
Journal Article
Open access
PDF file
EMElena Martín-González
Elena Martín-González
TSTeresa Sevilla
Teresa Sevilla
ARAna Revilla-Orodea
Ana Revilla-Orodea
PHPablo Casaseca de la Higuera
Pablo Casaseca de la Higuera
CACarlos Alberola-López
Carlos Alberola-López
Groupwise image (GW) registration is customarily used for subsequent processing in medical imaging. However, it is computationally expensive due to repeated calculation of transformations and gradients. In this paper, we propose a deep learning (DL) architecture that achieves GW elastic registration of a 2D dynamic sequence on an affordable average GPU. Our solution, referred to as dGW, is a simplified version of the well-known U-net. In our GW solution, the image that the other images are registered to, referred to in the paper as template image, is iteratively obtained together with the registered images. Design and evaluation have been carried out using 2D cine cardiac MR slices from 2 databases respectively consisting of 89 and 41 subjects. The first database was used for training and validation with 66.6–33.3% split. The second one was used for validation (50%) and testing (50%). Additional network hyperparameters, which are—in essence—those that control the transformation smoothness degree, are obtained by means of a forward selection procedure. Our results show a 9-fold runtime reduction with respect to an optimization-based implementation; in addition, making use of the well-known structural similarity (SSIM) index we have obtained significative differences with dGW with respect to an alternative DL solution based on Voxelmorph.

10 September 2018 in IEEE Journal of Biomedical and Health Informatics
Verified
Journal Article
Closed access
FSFederico Simmross-Wattenberg
Federico Simmross-Wattenberg
MRManuel Rodríguez-Cayetano
Manuel Rodríguez-Cayetano
JRJavier Royuela-Del-Val
Javier Royuela-Del-Val
EMElena Martín-González
Elena Martín-González
EMElisa Moya-Saez
Elisa Moya-Saez
CACarlos Alberola-López
Carlos Alberola-López
Medical image processing is often limited by the computational cost of the involved algorithms. Whereas dedicated computing devices (GPUs in particular) exist and do provide significant efficiency boosts, they have an extra cost of use in terms of housekeeping tasks (device selection and initialization, data streaming, synchronization with the CPU and others), which may hinder developers from using them. This paper describes an OpenCL-based framework that is capable of handling dedicated computing devices seamlessly and that allows the developer to concentrate on image processing tasks. The framework handles automatically device discovery and initialization, data transfers to and from the device and the file system and kernel loading and compiling. Data structures need to be defined only once independently of the computing device; code is unique, consequently, for every device, including the host CPU. Pinned memory/buffer mapping is used to achieve maximum performance in data transfers. Code fragments included in the paper show how the computing device is almost immediately and effortlessly available to the users algorithms, so they can focus on productive work. Code required for device selection and initialization, data loading and streaming and kernel compilation is minimal and systematic. Algorithms can be thought of as mathematical operators (called processes), with input, output and parameters, and they may be chained one after another easily and efficiently. Also for efficiency, processes can have their initialization work split from their core workload, so process chains and loops do not incur in performance penalties. Algorithm code is independent of the device type targeted.

25 September 2021
Verified
Book Chapter
Closed access
PDF file
EMElena Martín-González
Elena Martín-González
EAEbraham Alskaf
Ebraham Alskaf
ACAmedeo Chiribiri
Amedeo Chiribiri
PHPablo Casaseca de la Higuera
Pablo Casaseca de la Higuera
CACarlos Alberola-López
Carlos Alberola-López
TCTeresa Correia
Teresa Correia

1 August 2021 in Computer Methods and Programs in Biomedicine
Verified
Journal Article
Open access
EMElena Martín-González
Elena Martín-González
EMElisa Moya-Sáez
Elisa Moya-Sáez
RMRosa María Menchón-Lara
Rosa María Menchón-Lara
JRJavier Royuela-Del-Val
Javier Royuela-Del-Val
CPCésar Palencia-De-Lara
César Palencia-De-Lara
CACarlos Alberola-López
Carlos Alberola-López
Recent research has reported methods that reconstruct cardiac MR images acquired with acceleration factors as high as 15 in Cartesian coordinates. However, the computational cost of these techniques is quite high, taking about 40 min of CPU time in a typical current machine. This delay between acquisition and final result can completely rule out the use of MRI in clinical environments in favor of other techniques, such as CT. In spite of this, reconstruction methods reported elsewhere can be parallelized to a high degree, a fact that makes them suitable for GPU-type computing devices. This paper contributes a vendor-independent, device-agnostic implementation of such a method to reconstruct 2D motion-compensated, compressed-sensing MRI sequences in clinically viable times. By leveraging our OpenCLIPER framework, the proposed system works in any computing device (CPU, GPU, DSP, FPGA, etc.), as long as an OpenCL implementation is available, and development is significantly simplified versus a pure OpenCL implementation. In OpenCLIPER, the problem is partitioned in independent black boxes which may be connected as needed, while device initialization and maintenance is handled automatically. Parallel implementations of both a groupwise FFD-based registration method, as well as a multicoil extension of the NESTA algorithm have been carried out as processes of OpenCLIPER. Our platform also includes significant development and debugging aids. HIP code and precompiled libraries can be integrated seamlessly as well since OpenCLIPER makes data objects shareable between OpenCL and HIP. This also opens an opportunity to include CUDA source code (via HIP) in prospective developments. The proposed solution can reconstruct a whole 12-14 slice CINE volume acquired in 19-32 coils and 20 phases, with an acceleration factor of ranging 4-8, in a few seconds, with results comparable to another popular platform (BART). If motion compensation is included, reconstruction time is in the order of one minute. We have obtained clinically-viable times in GPUs from different vendors, with delays in some platforms that do not have correspondence with its price in the market. We also contribute a parallel groupwise registration subsystem for motion estimation/compensation and a parallel multicoil NESTA subsystem for l1-l2-norm problem solving.


5 January 2023 in arXiv
Verified
Preprint
Open access
PDF file
EMElena Martín-González
Elena Martín-González
EAEbraham Alskaf
Ebraham Alskaf
ACAmedeo Chiribiri
Amedeo Chiribiri
PCPablo Casaseca-De-La-Higuera
Pablo Casaseca-De-La-Higuera
CACarlos Alberola-López
Carlos Alberola-López
TCTeresa M Correia
Teresa M Correia
First-pass perfusion cardiac magnetic resonance (FPP-CMR) is becoming an essential non-invasive imaging method for detecting deficits of myocardial blood flow, allowing the assessment of coronary heart disease. Nevertheless, acquisitions suffer from relatively low spatial resolution and limited heart coverage. Compressed sensing (CS) methods have been proposed to accelerate FPP-CMR and achieve higher spatial resolution. However, the long reconstruction times have limited the widespread clinical use of CS in FPP-CMR. Deep learning techniques based on supervised learning have emerged as alternatives for speeding up reconstructions. However, these approaches require fully sampled data for training, which is not possible to obtain, particularly high-resolution FPP-CMR images. Here, we propose a physics-informed self-supervised deep learning FPP-CMR reconstruction approach for accelerating FPP-CMR scans and hence facilitate high spatial resolution imaging. The proposed method provides high-quality FPP-CMR images from 10x undersampled data without using fully sampled reference data.