Susana Merino-Caviedes
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Susana Merino-Caviedes has a total of 50 co-authors. Here are the top co-authors by number of shared publications:
- Marcos Martin-Fernandez
Universidad de Valladolid
9 shared publications - Carlos Alberola-López
Universidad de Valladolid
8 shared publications Ana Revilla-Orodea
Hospital Clínico Universitario de Valladolid, CIBER de Enfermedades Cardiovasculares (CIBERCV)
3 shared publicationsLucilio Cordero-Grande
Centre for the Developing Brain and Department of Biomedical Engineering, Division of Imaging Sciences and Biomedical Engineering, King’s College London, London, UK
3 shared publications- Antonio Tristán-Vega
LPI, ETSI Telecomunicacion, Universidad de Valladolid, Valladolid, Spain
2 shared publications - Emmanuel Chibuikem Nnadozie
Image Processing Laboratory, School of Telecommunications Engineering, University of Valladolid, 47011 Valladolid, Spain
2 shared publications
Latest Publications
- Open Access
A multi- b -value test-retest diffusion MRI brain dataset for model validation and reproducibility assessment
Transparent assessment of diffusion magnetic resonance imaging (dMRI) techniques with empirical verification of confounding factors requires adequately designed protocols and collected datasets. Publicly available diffusion-weighted MR datasets often provide limited sampling across b -values, making it difficult to study optimal acquisition protocols or the relationships between different processes occurring in brain tissue. In this work, we introduce a new densely sampled longitudinal test-retest diffusion-weighted MR dataset of the brain. Our dataset was collected from eleven healthy volunteers, each scanned four times: two sessions on consecutive days, which form the test data, followed by two additional sessions completed one week later (retest data). The data were acquired using twenty-two b -values ranging from 10 to 3000 s/mm 2 , along with structural T 1 -weighted scans. Potential applications of the dataset include, but are not limited to, assessing longitudinal reproducibility and reliability of quantitative metrics, evaluating robust and outlier-resistant estimation techniques, investigating experimental factors affecting estimation procedures, and verifying optimal acquisition protocols for different signal models. The dataset is publicly available in raw and fully preprocessed variants.
Open AccessA multi- b -value test-retest diffusion MRI brain dataset for model validation and reproducibility assessment
Transparent assessment of diffusion magnetic resonance imaging (dMRI) techniques with empirical verification of confounding factors requires adequately designed protocols and collected datasets. Publicly available diffusion-weighted MR datasets often provide limited sampling across b -values, making it difficult to study optimal acquisition protocols or the relationships between different processes occurring in brain tissue. In this work, we introduce a new densely sampled longitudinal test-retest diffusion-weighted MR dataset of the brain. Our dataset was collected from eleven healthy volunteers, each scanned four times: two sessions on consecutive days, which form the test data, followed by two additional sessions completed one week later (retest data). The data were acquired using twenty-two b -values ranging from 10 to 3000 s/mm 2 , along with structural T 1 -weighted scans. Potential applications of the dataset include, but are not limited to, assessing longitudinal reproducibility and reliability of quantitative metrics, evaluating robust and outlier-resistant estimation techniques, investigating experimental factors affecting estimation procedures, and verifying optimal acquisition protocols for different signal models. The dataset is publicly available in raw and fully preprocessed variants.
- Open Access
- 2 May 2026
- Published by MDPI AG in Big Data and Cognitive Computing
- Vol. 10 (5) , 142
Towards Improved Clinical Adoption of AI Segmentation Models: Benchmarking High-Performance Models for Resource-Constrained Settings
High-performance medical segmentation models are often benchmarked on high-end GPUs. Such benchmarks do not provide useful performance insights for point-of-care low-end devices. This work, firstly, posits that to achieve improved clinical adoption of AI-powered segmentation models, especially in reduced manpower settings like rural hospitals, we need benchmarks that provide actionable insights on the degree to which high-performance models address five deployment constraints viz: resource-effectiveness for low-end computing devices, clinically acceptable accuracy, clinically compatible execution times, localization of user data, and user-based finetuning. In this work, five state-of-the-art foundation segmentation models and one target-specific model were systematically evaluated on three multi-organ medical datasets. Furthermore, the best-ranking foundation model and target-specific model were benchmarked on three low-end devices. Our findings show that lightweight foundation models provided the best performance trade-off and are easily user-fine-tuned on custom datasets. Target-specific models provide high accuracy out-of-the-box, but may require significant optimisation to deliver comparably fast execution times and user-based finetuning on low-end devices. The methods and results from this research provide actionable insights on high-performance medical segmentation models for low-end computing devices, as a necessary step towards improved adoption in resource-limited clinical settings.
- 2 May 2026
- Published by MDPI AG in Big Data and Cognitive Computing
- Vol. 10 (5) , 142
Open AccessTowards Improved Clinical Adoption of AI Segmentation Models: Benchmarking High-Performance Models for Resource-Constrained Settings
High-performance medical segmentation models are often benchmarked on high-end GPUs. Such benchmarks do not provide useful performance insights for point-of-care low-end devices. This work, firstly, posits that to achieve improved clinical adoption of AI-powered segmentation models, especially in reduced manpower settings like rural hospitals, we need benchmarks that provide actionable insights on the degree to which high-performance models address five deployment constraints viz: resource-effectiveness for low-end computing devices, clinically acceptable accuracy, clinically compatible execution times, localization of user data, and user-based finetuning. In this work, five state-of-the-art foundation segmentation models and one target-specific model were systematically evaluated on three multi-organ medical datasets. Furthermore, the best-ranking foundation model and target-specific model were benchmarked on three low-end devices. Our findings show that lightweight foundation models provided the best performance trade-off and are easily user-fine-tuned on custom datasets. Target-specific models provide high accuracy out-of-the-box, but may require significant optimisation to deliver comparably fast execution times and user-based finetuning on low-end devices. The methods and results from this research provide actionable insights on high-performance medical segmentation models for low-end computing devices, as a necessary step towards improved adoption in resource-limited clinical settings.
- 12 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 28 (4) , 1967-1979
A Second Order Multi-Stencil Fast Marching Method With a Non-Constant Local Cost Model
The Fast Marching method is widely employed in several fields of image processing. Some years ago a Multi-Stencil version (MSFM) was introduced to improve its accuracy by solving the equation for a set of stencils and choosing the best solution at each considered node. The following work proposes a modified numerical scheme for MSFM to take into account the variation of the local cost, which has proven to be second order. The influence of the stencil set choice on the algorithm outcome with respect to stencil orthogonality and axis swapping is also explored, where stencils are taken from neighborhoods of varying radius. The experimental results show that the proposed schemes improve the accuracy of their original counterparts, and that the use of permutation-invariant stencil sets provides robustness against shifted vector coordinates in the stencil set.
- 12 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 28 (4) , 1967-1979
A Second Order Multi-Stencil Fast Marching Method With a Non-Constant Local Cost Model
The Fast Marching method is widely employed in several fields of image processing. Some years ago a Multi-Stencil version (MSFM) was introduced to improve its accuracy by solving the equation for a set of stencils and choosing the best solution at each considered node. The following work proposes a modified numerical scheme for MSFM to take into account the variation of the local cost, which has proven to be second order. The influence of the stencil set choice on the algorithm outcome with respect to stencil orthogonality and axis swapping is also explored, where stencils are taken from neighborhoods of varying radius. The experimental results show that the proposed schemes improve the accuracy of their original counterparts, and that the use of permutation-invariant stencil sets provides robustness against shifted vector coordinates in the stencil set.
- 10 October 2018
- Published by SPIE-Intl Soc Optical Eng
- Vol. 10784, 107840D
Compressed UAV sensing for flood monitoring by solving the continuous travelling salesman problem over hyperspectral maps
Unmanned Aerial Vehicles (UAVs) have shown great capability for disaster management due to their fast speed, automated deployment and low maintenance requirements. In recent years, disasters such as flooding are having increasingly damaging societal and environmental effects. To reduce their impact, real-time and reliable flood monitoring and prevention strategies are required. However, the limited battery life of small lightweight UAVs imposes efficient strategies to subsample the sensing field in this context. This paper proposes a novel solution to maximise the number of inspected flooded surface while keeping the travelled distance bounded. Our proposal solves the so-called continuous Travelling Salesman Problem (TSP), where the costs of travelling from one location to another depend not only on the distance, but also on the presence of water. To determine the optimal path between checkpoints, we employ the fast sweeping algorithm using a cost function defined from hyperspectral satellite maps identifying flooded regions. Preliminary results using MODIS flood maps show that our UAV planning strategy achieves a covered flooded surface approximately 3.33 times greater for the same travelled distance when compared to the conventional TSP solution. These results show new insights on the use of hyperspectral imagery acquired from UAVs to monitor water resources.
- 10 October 2018
- Published by SPIE-Intl Soc Optical Eng
- Vol. 10784, 107840D
Compressed UAV sensing for flood monitoring by solving the continuous travelling salesman problem over hyperspectral maps
Unmanned Aerial Vehicles (UAVs) have shown great capability for disaster management due to their fast speed, automated deployment and low maintenance requirements. In recent years, disasters such as flooding are having increasingly damaging societal and environmental effects. To reduce their impact, real-time and reliable flood monitoring and prevention strategies are required. However, the limited battery life of small lightweight UAVs imposes efficient strategies to subsample the sensing field in this context. This paper proposes a novel solution to maximise the number of inspected flooded surface while keeping the travelled distance bounded. Our proposal solves the so-called continuous Travelling Salesman Problem (TSP), where the costs of travelling from one location to another depend not only on the distance, but also on the presence of water. To determine the optimal path between checkpoints, we employ the fast sweeping algorithm using a cost function defined from hyperspectral satellite maps identifying flooded regions. Preliminary results using MODIS flood maps show that our UAV planning strategy achieves a covered flooded surface approximately 3.33 times greater for the same travelled distance when compared to the conventional TSP solution. These results show new insights on the use of hyperspectral imagery acquired from UAVs to monitor water resources.
- 15 March 2018
- Published by Springer Nature
- p. 51-59
Estimation of Healthy and Fibrotic Tissue Distributions in DE-CMR Incorporating CINE-CMR in an EM Algorithm
- 15 March 2018
- Published by Springer Nature
- p. 51-59
Estimation of Healthy and Fibrotic Tissue Distributions in DE-CMR Incorporating CINE-CMR in an EM Algorithm
- 25 March 2016
- Published by Springer Nature
- p. 184-195
An Automated Tensorial Classification Procedure for Left Ventricular Hypertrophic Cardiomyopathy
- 25 March 2016
- Published by Springer Nature
- p. 184-195
An Automated Tensorial Classification Procedure for Left Ventricular Hypertrophic Cardiomyopathy
- Open Access
- 6 November 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Medical Imaging
- Vol. 33 (1) , 23-37
Multi-Stencil Streamline Fast Marching: A General 3-D Framework to Determine Myocardial Thickness and Transmurality in Late Enhancement Images
We propose a fully 3-D methodology for the computation of myocardial nonviable tissue transmurality in contrast enhanced magnetic resonance images. The outcome is a continuous map defined within the myocardium where not only current state-of-the-art measures of transmurality can be calculated, but also information on the location of nonviable tissue is preserved. The computation is done by means of a partial differential equation framework we have called multi-stencil streamline fast marching. Using it, the myocardial and scarred tissue thickness is simultaneously computed. Experimental results show that the proposed 3-D method allows for the computation of transmurality in myocardial regions where current 2-D methods are not able to as conceived, and it also provides more robust and accurate results in situations where the assumptions on which current 2-D methods are based-i.e., there is a visible endocardial contour and its corresponding epicardial points lie on the same slice-, are not met.
- 6 November 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Medical Imaging
- Vol. 33 (1) , 23-37
Open AccessMulti-Stencil Streamline Fast Marching: A General 3-D Framework to Determine Myocardial Thickness and Transmurality in Late Enhancement Images
We propose a fully 3-D methodology for the computation of myocardial nonviable tissue transmurality in contrast enhanced magnetic resonance images. The outcome is a continuous map defined within the myocardium where not only current state-of-the-art measures of transmurality can be calculated, but also information on the location of nonviable tissue is preserved. The computation is done by means of a partial differential equation framework we have called multi-stencil streamline fast marching. Using it, the myocardial and scarred tissue thickness is simultaneously computed. Experimental results show that the proposed 3-D method allows for the computation of transmurality in myocardial regions where current 2-D methods are not able to as conceived, and it also provides more robust and accurate results in situations where the assumptions on which current 2-D methods are based-i.e., there is a visible endocardial contour and its corresponding epicardial points lie on the same slice-, are not met.
- 15 April 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 35 (11) , 2638-2650
Groupwise Elastic Registration by a New Sparsity-Promoting Metric: Application to the Alignment of Cardiac Magnetic Resonance Perfusion Images
This paper proposes a methodology for the joint alignment of a sequence of images based on a groupwise registration procedure by using a new family of metrics that exploit the expected sparseness of the temporal intensity curves corresponding to the aligned points. Therefore, this methodology is able to tackle the alignment of temporal sequences of images in which the represented phenomenon varies in time. Specifically, we have applied it to the correction of motion in contrast-enhanced first-pass perfusion cardiac magnetic resonance images. The time sequence is elastically registered as a whole by using the aforementioned family of multi-image metrics and jointly optimizing the parameters of the transformations involved. The proposed metrics are able to cope with dynamic changes in the intensity content of corresponding points in the sequence guided by the assumption that these changes allow for a sparse representation in a properly selected frame. Results have shown the statistically significant improvement in the performance of the proposed metric with respect to previous groupwise registration metrics for the problem at hand, which is especially relevant to correct for elastic deformations.
- 15 April 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 35 (11) , 2638-2650
Groupwise Elastic Registration by a New Sparsity-Promoting Metric: Application to the Alignment of Cardiac Magnetic Resonance Perfusion Images
This paper proposes a methodology for the joint alignment of a sequence of images based on a groupwise registration procedure by using a new family of metrics that exploit the expected sparseness of the temporal intensity curves corresponding to the aligned points. Therefore, this methodology is able to tackle the alignment of temporal sequences of images in which the represented phenomenon varies in time. Specifically, we have applied it to the correction of motion in contrast-enhanced first-pass perfusion cardiac magnetic resonance images. The time sequence is elastically registered as a whole by using the aforementioned family of multi-image metrics and jointly optimizing the parameters of the transformations involved. The proposed metrics are able to cope with dynamic changes in the intensity content of corresponding points in the sequence guided by the assumption that these changes allow for a sparse representation in a properly selected frame. Results have shown the statistically significant improvement in the performance of the proposed metric with respect to previous groupwise registration metrics for the problem at hand, which is especially relevant to correct for elastic deformations.