David Rügamer
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
David Rügamer has a total of 126 co-authors. Here are the top co-authors by number of shared publications:
- Bernd Bischl
LMU Munich
20 shared publications - Andreas Bender
Department of Statistics, LMU Munich, Munich, Germany
7 shared publications - Michael Ingrisch
Department of Radiology, University Hospital, LMU Munich, 81377 Munich, Germany
7 shared publications - Tobias Weber
LMU Munich
7 shared publications - Christopher Mutschler
Localization and Networking Division, Fraunhofer Institute for Integrated Circuits IIS, Nrnberg, Germany
5 shared publications - Felix Ott
Fraunhofer Institute for Integrated Circuits IIS 90411 Nürnberg Germany
4 shared publications
Latest Publications
- Open Access
- 3 August 2026
- Published by The Open Journal in Journal of Open Source Software
- Vol. 11 (124) , 10653
bde: A Python Package for Bayesian Deep Ensembles via MILE
- 3 August 2026
- Published by The Open Journal in Journal of Open Source Software
- Vol. 11 (124) , 10653
Open Accessbde: A Python Package for Bayesian Deep Ensembles via MILE
- Open Access
- 2 April 2026
- Published by Springer Nature in Machine Learning
- Vol. 115 (4) , 87
Smoothing the Edges: Smooth Optimization for Sparse Regularization Using Hadamard Overparametrization
In recent years, overparametrization has received considerable attention in various fields, shown to accelerate training and promote simplicity. However, few works study the induced sparse regularization of the original parameters that is caused by combining overparametrization with explicit smooth regularization. Here, we present a unifying framework for smooth optimization of explicitly regularized objectives for (structured) sparsity. These non-smooth and possibly non-convex problems typically rely on solvers tailored to specific models or regularizers and have not been widely adopted in deep learning. In contrast, our method promises fully differentiable and approximation-free optimization for sparse regularizers and is thus compatible with the ubiquitous gradient descent paradigm. The proposed optimization transfer comprises overparameterization of selected parameters and a change of penalties. We prove that the surrogate objective is equivalent in the sense of identical global and local minima, thereby avoiding the introduction of spurious solutions. We comprehensively review sparsity-inducing parametrizations across different fields and combine them in our explicit surrogate regularization framework. We further extend their scope, point out improvements and present novel parametrizations. Numerical experiments further demonstrate the correctness and effectiveness of our approach on several sparse learning problems from high-dimensional regression to sparse neural network training.
- 2 April 2026
- Published by Springer Nature in Machine Learning
- Vol. 115 (4) , 87
Open AccessSmoothing the Edges: Smooth Optimization for Sparse Regularization Using Hadamard Overparametrization
In recent years, overparametrization has received considerable attention in various fields, shown to accelerate training and promote simplicity. However, few works study the induced sparse regularization of the original parameters that is caused by combining overparametrization with explicit smooth regularization. Here, we present a unifying framework for smooth optimization of explicitly regularized objectives for (structured) sparsity. These non-smooth and possibly non-convex problems typically rely on solvers tailored to specific models or regularizers and have not been widely adopted in deep learning. In contrast, our method promises fully differentiable and approximation-free optimization for sparse regularizers and is thus compatible with the ubiquitous gradient descent paradigm. The proposed optimization transfer comprises overparameterization of selected parameters and a change of penalties. We prove that the surrogate objective is equivalent in the sense of identical global and local minima, thereby avoiding the introduction of spurious solutions. We comprehensively review sparsity-inducing parametrizations across different fields and combine them in our explicit surrogate regularization framework. We further extend their scope, point out improvements and present novel parametrizations. Numerical experiments further demonstrate the correctness and effectiveness of our approach on several sparse learning problems from high-dimensional regression to sparse neural network training.
- Open Access
Semantically Conditioned Diffusion Models for Cerebral DSA Synthesis
Digital subtraction angiography (DSA) plays a central role in the diagnosis and treatment of cerebrovascular disease, yet its invasive nature and high acquisition cost severely limit large-scale data collection and public data sharing. Therefore, we developed a semantically conditioned latent diffusion model (LDM) that synthesizes arterial-phase cerebral DSA frames under explicit control of anatomical circulation (anterior vs.\ posterior) and canonical C-arm positions. We curated a large single-centre DSA dataset of 99,349 frames and trained a conditional LDM using text embeddings that encoded anatomy and acquisition geometry. To assess clinical realism, four medical experts, including two neuroradiologists, one neurosurgeon, and one internal medicine expert, systematically rated 400 synthetic DSA images using a 5-grade Likert scale for evaluating proximal large, medium, and small peripheral vessels. The generated images achieved image-wise overall Likert scores ranging from 3.1 to 3.3, with high inter-rater reliability (ICC(2,k) = 0.80--0.87). Distributional similarity to real DSA frames was supported by a low median Fréchet inception distance (FID) of 15.27. Our results indicate that semantically controlled LDMs can produce realistic synthetic DSAs suitable for downstream algorithm development, research, and training.
Open AccessSemantically Conditioned Diffusion Models for Cerebral DSA Synthesis
Digital subtraction angiography (DSA) plays a central role in the diagnosis and treatment of cerebrovascular disease, yet its invasive nature and high acquisition cost severely limit large-scale data collection and public data sharing. Therefore, we developed a semantically conditioned latent diffusion model (LDM) that synthesizes arterial-phase cerebral DSA frames under explicit control of anatomical circulation (anterior vs.\ posterior) and canonical C-arm positions. We curated a large single-centre DSA dataset of 99,349 frames and trained a conditional LDM using text embeddings that encoded anatomy and acquisition geometry. To assess clinical realism, four medical experts, including two neuroradiologists, one neurosurgeon, and one internal medicine expert, systematically rated 400 synthetic DSA images using a 5-grade Likert scale for evaluating proximal large, medium, and small peripheral vessels. The generated images achieved image-wise overall Likert scores ranging from 3.1 to 3.3, with high inter-rater reliability (ICC(2,k) = 0.80--0.87). Distributional similarity to real DSA frames was supported by a low median Fréchet inception distance (FID) of 15.27. Our results indicate that semantically controlled LDMs can produce realistic synthetic DSAs suitable for downstream algorithm development, research, and training.
- Open Access
- 18 January 2026
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 59 (2) , 77
Deep generative models in digital subtraction angiography (DSA) and X-ray angiography: a systematic review
Deep generative models, such as generative adversarial networks (GANs), variational autoencoders (VAEs), and diffusion models, have demonstrated remarkable success in static medical imaging tasks, including image synthesis, domain translation, and data augmentation. However, their application to dynamic vascular modalities such as digital subtraction angiography (DSA) and X-ray angiography (XA) has received comparatively limited attention. This systematic review synthesizes 20 peer-reviewed studies published between January 2018 and July 2025, offering a comprehensive analysis of generative model usage in angiographic imaging. We categorize methods by model type, learning paradigm, and application focus, covering tasks such as image generation, vessel segmentation, and stenosis detection. GANs dominate the field, while diffusion models show emerging promise. Key limitations include the scarcity of public datasets, inconsistent evaluation metrics, and limited code availability, which hinder reproducibility and benchmarking. We conclude by outlining methodological trends and highlighting future directions, including the development of anatomically conditioned generative models and the need for large-scale, open-access datasets to support robust evaluation and clinical translation.
- 18 January 2026
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 59 (2) , 77
Open AccessDeep generative models in digital subtraction angiography (DSA) and X-ray angiography: a systematic review
Deep generative models, such as generative adversarial networks (GANs), variational autoencoders (VAEs), and diffusion models, have demonstrated remarkable success in static medical imaging tasks, including image synthesis, domain translation, and data augmentation. However, their application to dynamic vascular modalities such as digital subtraction angiography (DSA) and X-ray angiography (XA) has received comparatively limited attention. This systematic review synthesizes 20 peer-reviewed studies published between January 2018 and July 2025, offering a comprehensive analysis of generative model usage in angiographic imaging. We categorize methods by model type, learning paradigm, and application focus, covering tasks such as image generation, vessel segmentation, and stenosis detection. GANs dominate the field, while diffusion models show emerging promise. Key limitations include the scarcity of public datasets, inconsistent evaluation metrics, and limited code availability, which hinder reproducibility and benchmarking. We conclude by outlining methodological trends and highlighting future directions, including the development of anatomically conditioned generative models and the need for large-scale, open-access datasets to support robust evaluation and clinical translation.
- Open Access
Enhancing Heavy Rain Nowcasting with Multimodal Data: Integrating Radar and Satellite Observations
The increasing frequency of heavy rainfall events, which are a major cause of urban flooding, underscores the urgent need for accurate precipitation forecasting - particularly in urban areas where localized events often go undetected by ground-based sensors. In Germany, only 17.3% of hourly heavy rain events between 2001 and 2018 were recorded by rain gauges, highlighting the limitations of traditional monitoring systems. Radar data are another source that effectively tracks ongoing precipitation; however, forecasting the development of heavy rain using radar alone remains challenging due to the brief and unpredictable nature of such events. Our focus is on evaluating the effectiveness of fusing satellite and radar data for nowcasting. We develop a multimodal nowcasting model that combines both radar and satellite imagery for predicting precipitation at lead times of 5, 15, and 30 minutes. We demonstrate that this multimodal strategy significantly outperforms radar-only approaches. Experimental results show that integrating satellite data improves prediction accuracy, particularly for intense precipitation. The proposed model increases the Critical Success Index for heavy rain by 4% and for violent rain by 3% at a 5-minute lead time. Moreover, it maintains higher predictive skill at longer lead times, where radar-only performance declines. A qualitative analysis of the severe flooding event in the state of North Rhine-Westphalia, Germany in 2021 further illustrates the superior performance of the multimodal model. Unlike the radar-only model, which captures general precipitation patterns, the multimodal model yields more detailed and accurate forecasts for regions affected by heavy rain. This improved precision enables timely, reliable, life-saving warnings. Implementation available at https://github.com/RamaKassoumeh/Multimodal_heavy_rain
Open AccessEnhancing Heavy Rain Nowcasting with Multimodal Data: Integrating Radar and Satellite Observations
The increasing frequency of heavy rainfall events, which are a major cause of urban flooding, underscores the urgent need for accurate precipitation forecasting - particularly in urban areas where localized events often go undetected by ground-based sensors. In Germany, only 17.3% of hourly heavy rain events between 2001 and 2018 were recorded by rain gauges, highlighting the limitations of traditional monitoring systems. Radar data are another source that effectively tracks ongoing precipitation; however, forecasting the development of heavy rain using radar alone remains challenging due to the brief and unpredictable nature of such events. Our focus is on evaluating the effectiveness of fusing satellite and radar data for nowcasting. We develop a multimodal nowcasting model that combines both radar and satellite imagery for predicting precipitation at lead times of 5, 15, and 30 minutes. We demonstrate that this multimodal strategy significantly outperforms radar-only approaches. Experimental results show that integrating satellite data improves prediction accuracy, particularly for intense precipitation. The proposed model increases the Critical Success Index for heavy rain by 4% and for violent rain by 3% at a 5-minute lead time. Moreover, it maintains higher predictive skill at longer lead times, where radar-only performance declines. A qualitative analysis of the severe flooding event in the state of North Rhine-Westphalia, Germany in 2021 further illustrates the superior performance of the multimodal model. Unlike the radar-only model, which captures general precipitation patterns, the multimodal model yields more detailed and accurate forecasts for regions affected by heavy rain. This improved precision enables timely, reliable, life-saving warnings. Implementation available at https://github.com/RamaKassoumeh/Multimodal_heavy_rain
- Open Access
- 1 October 2025
- Published by Copernicus GmbH in The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences
- Vol. XLVIII-M-9, 821-826
Semi-automated LiDAR Vegetation Classification for Mediterranean Archaeology: Designing a Pipeline Leveraging a Multi-Layer Stacked Ensemble Approach
Dense Mediterranean vegetation often conceals archaeological features in LiDAR data, posing a significant challenge for archaeological analysis. This paper presents a novel machine learning pipeline for semi-automated vegetation classification in drone-based archaeological LiDAR point clouds, which were captured to survey the Mediterranean landscape of Sicily, Italy. Our approach integrates an extensive feature engineering stage with a multi-layer stacked ensemble classifier and a RandLA-Net deep learning model. The pipeline was trained on a semantically annotated drone-based LiDAR dataset from the site of Kamarina. It achieved high accuracy in distinguishing vegetation from ground points (0.99 overall accuracy, weighted macro F1 ≈ 0.93). To evaluate generalizability, we tested the model on a secondary site (Heloros) with different vegetation characteristics, obtaining an F1 of ~0.70. Qualitative inspection of results confirms that our model effectively removes vegetation while preserving archaeological structures. Our results demonstrate the potential of ensemble learning and 3D deep neural networks in archaeological remote sensing, enabling more efficient visualization and mapping of hidden archaeological features.
- 1 October 2025
- Published by Copernicus GmbH in The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences
- Vol. XLVIII-M-9, 821-826
Open AccessSemi-automated LiDAR Vegetation Classification for Mediterranean Archaeology: Designing a Pipeline Leveraging a Multi-Layer Stacked Ensemble Approach
Dense Mediterranean vegetation often conceals archaeological features in LiDAR data, posing a significant challenge for archaeological analysis. This paper presents a novel machine learning pipeline for semi-automated vegetation classification in drone-based archaeological LiDAR point clouds, which were captured to survey the Mediterranean landscape of Sicily, Italy. Our approach integrates an extensive feature engineering stage with a multi-layer stacked ensemble classifier and a RandLA-Net deep learning model. The pipeline was trained on a semantically annotated drone-based LiDAR dataset from the site of Kamarina. It achieved high accuracy in distinguishing vegetation from ground points (0.99 overall accuracy, weighted macro F1 ≈ 0.93). To evaluate generalizability, we tested the model on a secondary site (Heloros) with different vegetation characteristics, obtaining an F1 of ~0.70. Qualitative inspection of results confirms that our model effectively removes vegetation while preserving archaeological structures. Our results demonstrate the potential of ensemble learning and 3D deep neural networks in archaeological remote sensing, enabling more efficient visualization and mapping of hidden archaeological features.
- 1 October 2025
- Published by Springer Nature
- p. 74-91
On Training Survival Models with Scoring Rules
- 20 June 2025
- Published by Springer Nature
- p. 103-114
Preventing Sensitive Information Leakage via Post-hoc Orthogonalization with Application to Chest Radiograph Embeddings
- 20 June 2025
- Published by Springer Nature
- p. 103-114
Preventing Sensitive Information Leakage via Post-hoc Orthogonalization with Application to Chest Radiograph Embeddings
- Open Access
Semi-Implicit Variational Inference via Kernelized Path Gradient Descent
Semi-implicit variational inference (SIVI) is a powerful framework for approximating complex posterior distributions, but training with the Kullback-Leibler (KL) divergence can be challenging due to high variance and bias in high-dimensional settings. While current state-of-the-art semi-implicit variational inference methods, particularly Kernel Semi-Implicit Variational Inference (KSIVI), have been shown to work in high dimensions, training remains moderately expensive. In this work, we propose a kernelized KL divergence estimator that stabilizes training through nonparametric smoothing. To further reduce the bias, we introduce an importance sampling correction. We provide a theoretical connection to the amortized version of the Stein variational gradient descent, which estimates the score gradient via Stein's identity, showing that both methods minimize the same objective, but our semi-implicit approach achieves lower gradient variance. In addition, our method's bias in function space is benign, leading to more stable and efficient optimization. Empirical results demonstrate that our method outperforms or matches state-of-the-art SIVI methods in both performance and training efficiency.
Open AccessSemi-Implicit Variational Inference via Kernelized Path Gradient Descent
Semi-implicit variational inference (SIVI) is a powerful framework for approximating complex posterior distributions, but training with the Kullback-Leibler (KL) divergence can be challenging due to high variance and bias in high-dimensional settings. While current state-of-the-art semi-implicit variational inference methods, particularly Kernel Semi-Implicit Variational Inference (KSIVI), have been shown to work in high dimensions, training remains moderately expensive. In this work, we propose a kernelized KL divergence estimator that stabilizes training through nonparametric smoothing. To further reduce the bias, we introduce an importance sampling correction. We provide a theoretical connection to the amortized version of the Stein variational gradient descent, which estimates the score gradient via Stein's identity, showing that both methods minimize the same objective, but our semi-implicit approach achieves lower gradient variance. In addition, our method's bias in function space is benign, leading to more stable and efficient optimization. Empirical results demonstrate that our method outperforms or matches state-of-the-art SIVI methods in both performance and training efficiency.
- Open Access
How To Make Your Cell Tracker Say "I dunno!"
Cell tracking is a key computational task in live-cell microscopy, but fully automated analysis of high-throughput imaging requires reliable and, thus, uncertainty-aware data analysis tools, as the amount of data recorded within a single experiment exceeds what humans are able to overlook. We here propose and benchmark various methods to reason about and quantify uncertainty in linear assignment-based cell tracking algorithms. Our methods take inspiration from statistics and machine learning, leveraging two perspectives on the cell tracking problem explored throughout this work: Considering it as a Bayesian inference problem and as a classification problem. Our methods admit a framework-like character in that they equip any frame-to-frame tracking method with uncertainty quantification. We demonstrate this by applying it to various existing tracking algorithms including the recently presented Transformer-based trackers. We demonstrate empirically that our methods yield useful and well-calibrated tracking uncertainties.
Open AccessHow To Make Your Cell Tracker Say "I dunno!"
Cell tracking is a key computational task in live-cell microscopy, but fully automated analysis of high-throughput imaging requires reliable and, thus, uncertainty-aware data analysis tools, as the amount of data recorded within a single experiment exceeds what humans are able to overlook. We here propose and benchmark various methods to reason about and quantify uncertainty in linear assignment-based cell tracking algorithms. Our methods take inspiration from statistics and machine learning, leveraging two perspectives on the cell tracking problem explored throughout this work: Considering it as a Bayesian inference problem and as a classification problem. Our methods admit a framework-like character in that they equip any frame-to-frame tracking method with uncertainty quantification. We demonstrate this by applying it to various existing tracking algorithms including the recently presented Transformer-based trackers. We demonstrate empirically that our methods yield useful and well-calibrated tracking uncertainties.