Holger Kohr
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
Holger Kohr has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
- Tim Dahmen
German Research Center for Artificial Intelligence (DFKI), Saarbrücken, Germany
3 shared publications - Felix Lucka
Computational Imaging, Centrum Wiskunde and Informatica, Amsterdam, Netherlands
2 shared publications - Hermen Jan Hupkes
Mathematisch Instituut Universiteit Leiden P.O. Box 9512 2300 RA Leiden The Netherlands
2 shared publications - Jan-Willem Buurlage
Centrum Wiskunde & Informatica, Amsterdam, The Netherlands.
2 shared publications - Kees Joost Batenburg
Leiden University
2 shared publications Niels de Jonge
INM – Leibniz Institute for New Materials, 66123 Saarbrücken, Germany
2 shared publications
Latest Publications
- 28 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Imaging
- Vol. 8 (25730436) , 651-665
SparseAlign: A Grid-Free Algorithm for Automatic Marker Localization and Deformation Estimation in Cryo-Electron Tomography
Tilt-series alignment is crucial to obtaining high-resolution reconstructions in cryo-electron tomography. Beam-induced local deformation of the sample is hard to estimate from the low-contrast sample alone, and often requires fiducial gold bead markers. The state-of-the-art approach for deformation estimation uses (semi-)manually labelled marker locations in projection data to fit the parameters of a polynomial deformation model. Manually-labelled marker locations are difficult to obtain when data are noisy or markers overlap in projection data. We propose an alternative mathematical approach for simultaneous marker localization and deformation estimation by extending a grid-free algorithm first proposed in the context of super-resolution single-molecule localization microscopy. Our approach does not require labelled marker locations; instead, we use an image-based loss where we compare the forward projection of markers with the observed data. We equip this marker localization scheme with an additional deformation estimation component and solve for a reduced number of deformation parameters. Using extensive numerical studies on marker-only samples, we show that our approach automatically finds markers and reliably estimates sample deformation without labelled marker data. We further demonstrate the applicability of our approach for a broad range of model mismatch scenarios, including experimental electron tomography data of gold markers on ice.
- 28 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Imaging
- Vol. 8 (25730436) , 651-665
SparseAlign: A Grid-Free Algorithm for Automatic Marker Localization and Deformation Estimation in Cryo-Electron Tomography
Tilt-series alignment is crucial to obtaining high-resolution reconstructions in cryo-electron tomography. Beam-induced local deformation of the sample is hard to estimate from the low-contrast sample alone, and often requires fiducial gold bead markers. The state-of-the-art approach for deformation estimation uses (semi-)manually labelled marker locations in projection data to fit the parameters of a polynomial deformation model. Manually-labelled marker locations are difficult to obtain when data are noisy or markers overlap in projection data. We propose an alternative mathematical approach for simultaneous marker localization and deformation estimation by extending a grid-free algorithm first proposed in the context of super-resolution single-molecule localization microscopy. Our approach does not require labelled marker locations; instead, we use an image-based loss where we compare the forward projection of markers with the observed data. We equip this marker localization scheme with an additional deformation estimation component and solve for a reduced number of deformation parameters. Using extensive numerical studies on marker-only samples, we show that our approach automatically finds markers and reliably estimates sample deformation without labelled marker data. We further demonstrate the applicability of our approach for a broad range of model mismatch scenarios, including experimental electron tomography data of gold markers on ice.
- Open Access
SparseAlign: A Super-Resolution Algorithm for Automatic Marker Localization and Deformation Estimation in Cryo-Electron Tomography
Tilt-series alignment is crucial to obtaining high-resolution reconstructions in cryo-electron tomography. Beam-induced local deformation of the sample is hard to estimate from the low-contrast sample alone, and often requires fiducial gold bead markers. The state-of-the-art approach for deformation estimation uses (semi-)manually labelled marker locations in projection data to fit the parameters of a polynomial deformation model. Manually-labelled marker locations are difficult to obtain when data are noisy or markers overlap in projection data. We propose an alternative mathematical approach for simultaneous marker localization and deformation estimation by extending a grid-free super-resolution algorithm first proposed in the context of single-molecule localization microscopy. Our approach does not require labelled marker locations; instead, we use an image-based loss where we compare the forward projection of markers with the observed data. We equip this marker localization scheme with an additional deformation estimation component and solve for a reduced number of deformation parameters. Using extensive numerical studies on marker-only samples, we show that our approach automatically finds markers and reliably estimates sample deformation without labelled marker data. We further demonstrate the applicability of our approach for a broad range of model mismatch scenarios, including experimental electron tomography data of gold markers on ice.
Open AccessSparseAlign: A Super-Resolution Algorithm for Automatic Marker Localization and Deformation Estimation in Cryo-Electron Tomography
Tilt-series alignment is crucial to obtaining high-resolution reconstructions in cryo-electron tomography. Beam-induced local deformation of the sample is hard to estimate from the low-contrast sample alone, and often requires fiducial gold bead markers. The state-of-the-art approach for deformation estimation uses (semi-)manually labelled marker locations in projection data to fit the parameters of a polynomial deformation model. Manually-labelled marker locations are difficult to obtain when data are noisy or markers overlap in projection data. We propose an alternative mathematical approach for simultaneous marker localization and deformation estimation by extending a grid-free super-resolution algorithm first proposed in the context of single-molecule localization microscopy. Our approach does not require labelled marker locations; instead, we use an image-based loss where we compare the forward projection of markers with the observed data. We equip this marker localization scheme with an additional deformation estimation component and solve for a reduced number of deformation parameters. Using extensive numerical studies on marker-only samples, we show that our approach automatically finds markers and reliably estimates sample deformation without labelled marker data. We further demonstrate the applicability of our approach for a broad range of model mismatch scenarios, including experimental electron tomography data of gold markers on ice.
- 17 October 2019
- Published by IOP Publishing in Semiconductor Science and Technology
- Vol. 34 (11) , 114002
Combined STEM-EDS tomography of nanowire structures
The 3D spatial resolution, the material contrast and the evolution of the noise are analyzed in the reconstructed volume of a combined scanning transmission electron microscopy (HAADF-STEM) and energy dispersive x-ray spectroscopy (EDS) tomography experiment. Standard simultaneous iterative reconstruction technique and HAADF-EDS bimodal tomographic reconstruction are considered for the +/−90° tomography series of a pillar shaped sample embedding a full nanowire device. With a high number of iterations, a spatial resolution for both HAADF and EDS down to 5 nanometer can be reached for this volume. Best material’s contrast and minimum noise are obtained for medium number of iterations. Improvement of the signal-to-noise and contrast can be obtained by filtering the EDS data while the spatial resolution is not impacted. A fast and reliable preparation methodology for rectangularly shaped pillar samples for tomography analysis is discussed.
- 17 October 2019
- Published by IOP Publishing in Semiconductor Science and Technology
- Vol. 34 (11) , 114002
Combined STEM-EDS tomography of nanowire structures
The 3D spatial resolution, the material contrast and the evolution of the noise are analyzed in the reconstructed volume of a combined scanning transmission electron microscopy (HAADF-STEM) and energy dispersive x-ray spectroscopy (EDS) tomography experiment. Standard simultaneous iterative reconstruction technique and HAADF-EDS bimodal tomographic reconstruction are considered for the +/−90° tomography series of a pillar shaped sample embedding a full nanowire device. With a high number of iterations, a spatial resolution for both HAADF and EDS down to 5 nanometer can be reached for this volume. Best material’s contrast and minimum noise are obtained for medium number of iterations. Improvement of the signal-to-noise and contrast can be obtained by filtering the EDS data while the spatial resolution is not impacted. A fast and reliable preparation methodology for rectangularly shaped pillar samples for tomography analysis is discussed.
- 18 September 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Radiation and Plasma Medical Sciences
- Vol. 4 (3) , 300-310
Multigrid Reconstruction in Tomographic Imaging
In this work, we present an efficient methodology for multigrid tomographic image reconstruction from non-truncated projection data. By partitioning the reconstruction domain and adapting the forward and backward operators, an image can be reconstructed accurately within multiple domains of varying discretisation or regularisation. We demonstrate the efficacy of the multigrid reconstruction principle using simulated data for quantitative assessment and experimental measurements from a μ-CT scanner for a clinically relevant use case scenario. A major advantage of using multiple reconstruction grids is the possibility to drastically reduce the number of unknowns in the inverse problem, and thereby the associated computational cost. This cost reduction helps to enlarge the class of available algorithms in applications with strict limitations on computation time or resources, and it enables full system resolution reconstruction of subregions that would otherwise be infeasible for the full field of view. The numerical experiments, along with a brief error analysis, show that the expected artefacts from coarse discretisation outside the region of interest become noticeable only for large differences in discretisation between subregions.
- 18 September 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Radiation and Plasma Medical Sciences
- Vol. 4 (3) , 300-310
Multigrid Reconstruction in Tomographic Imaging
In this work, we present an efficient methodology for multigrid tomographic image reconstruction from non-truncated projection data. By partitioning the reconstruction domain and adapting the forward and backward operators, an image can be reconstructed accurately within multiple domains of varying discretisation or regularisation. We demonstrate the efficacy of the multigrid reconstruction principle using simulated data for quantitative assessment and experimental measurements from a μ-CT scanner for a clinically relevant use case scenario. A major advantage of using multiple reconstruction grids is the possibility to drastically reduce the number of unknowns in the inverse problem, and thereby the associated computational cost. This cost reduction helps to enlarge the class of available algorithms in applications with strict limitations on computation time or resources, and it enables full system resolution reconstruction of subregions that would otherwise be infeasible for the full field of view. The numerical experiments, along with a brief error analysis, show that the expected artefacts from coarse discretisation outside the region of interest become noticeable only for large differences in discretisation between subregions.
- 30 April 2018
- Published by IOP Publishing in Measurement Science and Technology
- Vol. 29 (6) , 064005
Real-time quasi-3D tomographic reconstruction
Developments in acquisition technology and a growing need for time-resolved experiments pose great computational challenges in tomography. In addition, access to reconstructions in real time is a highly demanded feature but has so far been out of reach. We show that by exploiting the mathematical properties of filtered backprojection-type methods, having access to real-time reconstructions of arbitrarily oriented slices becomes feasible. Furthermore, we present , software for visualization and on-demand reconstruction of slices. A user of can interactively shift and rotate slices in a GUI, while the software updates the slice in real time. For certain use cases, the possibility to study arbitrarily oriented slices in real time directly from the measured data provides sufficient visual and quantitative insight. Two such applications are discussed in this article.
- 30 April 2018
- Published by IOP Publishing in Measurement Science and Technology
- Vol. 29 (6) , 064005
Real-time quasi-3D tomographic reconstruction
Developments in acquisition technology and a growing need for time-resolved experiments pose great computational challenges in tomography. In addition, access to reconstructions in real time is a highly demanded feature but has so far been out of reach. We show that by exploiting the mathematical properties of filtered backprojection-type methods, having access to real-time reconstructions of arbitrarily oriented slices becomes feasible. Furthermore, we present , software for visualization and on-demand reconstruction of slices. A user of can interactively shift and rotate slices in a GUI, while the software updates the slice in real time. For certain use cases, the possibility to study arbitrarily oriented slices in real time directly from the measured data provides sufficient visual and quantitative insight. Two such applications are discussed in this article.
- 13 June 2016
- Published by Springer Nature in Journal of Mathematical Biology
- Vol. 74 (3) , 533-565
Numerical rate function determination in partial differential equations modeling cell population dynamics
This paper introduces a method to solve the inverse problem of determining an unknown rate function in a partial differential equation (PDE) based on discrete measurements of the modeled quantity. The focus is put on a size-structured population balance equation (PBE) predicting the evolution of the number distribution of a single cell population as a function of the size variable. Since the inverse problem at hand is ill-posed, an adequate regularization scheme is required to avoid amplification of measurement errors in the solution method. The technique developed in this work to determine a rate function in a PBE is based on the approximate inverse method, a pointwise regularization scheme, which employs two key ideas. Firstly, the mollification in the directions of time and size variables are separated. Secondly, instable numerical data derivatives are circumvented by shifting the differentiation to an analytically given function. To examine the performance of the introduced scheme, adapted test scenarios have been designed with different levels of data disturbance simulating the model and measurement errors in practice. The success of the method is substantiated by visualizing the results of these numerical experiments.
- 13 June 2016
- Published by Springer Nature in Journal of Mathematical Biology
- Vol. 74 (3) , 533-565
Numerical rate function determination in partial differential equations modeling cell population dynamics
This paper introduces a method to solve the inverse problem of determining an unknown rate function in a partial differential equation (PDE) based on discrete measurements of the modeled quantity. The focus is put on a size-structured population balance equation (PBE) predicting the evolution of the number distribution of a single cell population as a function of the size variable. Since the inverse problem at hand is ill-posed, an adequate regularization scheme is required to avoid amplification of measurement errors in the solution method. The technique developed in this work to determine a rate function in a PBE is based on the approximate inverse method, a pointwise regularization scheme, which employs two key ideas. Firstly, the mollification in the directions of time and size variables are separated. Secondly, instable numerical data derivatives are circumvented by shifting the differentiation to an analytically given function. To examine the performance of the introduced scheme, adapted test scenarios have been designed with different levels of data disturbance simulating the model and measurement errors in practice. The success of the method is substantiated by visualizing the results of these numerical experiments.
- 1 March 2016
- Published by Oxford University Press (OUP) in Microscopy Today
- Vol. 24 (3) , 26-31
Combined Tilt- and Focal-Series Tomography for HAADF-STEM
- 1 March 2016
- Published by Oxford University Press (OUP) in Microscopy Today
- Vol. 24 (3) , 26-31
Combined Tilt- and Focal-Series Tomography for HAADF-STEM
- 1 August 2015
- Published by Cambridge University Press (CUP) in Microscopy and Microanalysis
- Vol. 21 (S3) , 2337-2338
Reconstruction Strategies for Combined Tilt- and Focal Series Scanning Transmission Electron Microscopy
- 1 August 2015
- Published by Cambridge University Press (CUP) in Microscopy and Microanalysis
- Vol. 21 (S3) , 2337-2338
Reconstruction Strategies for Combined Tilt- and Focal Series Scanning Transmission Electron Microscopy
- 5 June 2015
- Published by Oxford University Press (OUP) in Microscopy and Microanalysis
- Vol. 21 (3) , 725-738
Matched Backprojection Operator for Combined Scanning Transmission Electron Microscopy Tilt- and Focal Series
Combined tilt- and focal series scanning transmission electron microscopy is a recently developed method to obtain nanoscale three-dimensional (3D) information of thin specimens. In this study, we formulate the forward projection in this acquisition scheme as a linear operator and prove that it is a generalization of the Ray transform for parallel illumination. We analytically derive the corresponding backprojection operator as the adjoint of the forward projection. We further demonstrate that the matched backprojection operator drastically improves the convergence rate of iterative 3D reconstruction compared to the case where a backprojection based on heuristic weighting is used. In addition, we show that the 3D reconstruction is of better quality.
- 5 June 2015
- Published by Oxford University Press (OUP) in Microscopy and Microanalysis
- Vol. 21 (3) , 725-738
Matched Backprojection Operator for Combined Scanning Transmission Electron Microscopy Tilt- and Focal Series
Combined tilt- and focal series scanning transmission electron microscopy is a recently developed method to obtain nanoscale three-dimensional (3D) information of thin specimens. In this study, we formulate the forward projection in this acquisition scheme as a linear operator and prove that it is a generalization of the Ray transform for parallel illumination. We analytically derive the corresponding backprojection operator as the adjoint of the forward projection. We further demonstrate that the matched backprojection operator drastically improves the convergence rate of iterative 3D reconstruction compared to the case where a backprojection based on heuristic weighting is used. In addition, we show that the 3D reconstruction is of better quality.
- 20 May 2013
- Published by IOP Publishing in Inverse Problems
- Vol. 29 (6) , 065015
A linear regularization scheme for inverse problems with unbounded linear operators on Banach spaces
This paper extends the linear regularization scheme known as the approximate inverse to unbounded linear operators on Banach spaces. The principle of feature reconstruction is adapted from bounded operators to the unbounded scenario and, in addition, a new situation is examined where the data need to be pre-processed to fit into the mathematical model. In all these cases, invariance and regularization properties are surveyed and established for the example of fractional differentiation. Numerical results confirm the derived characteristics of the presented methods.
- 20 May 2013
- Published by IOP Publishing in Inverse Problems
- Vol. 29 (6) , 065015
A linear regularization scheme for inverse problems with unbounded linear operators on Banach spaces
This paper extends the linear regularization scheme known as the approximate inverse to unbounded linear operators on Banach spaces. The principle of feature reconstruction is adapted from bounded operators to the unbounded scenario and, in addition, a new situation is examined where the data need to be pre-processed to fit into the mathematical model. In all these cases, invariance and regularization properties are surveyed and established for the example of fractional differentiation. Numerical results confirm the derived characteristics of the presented methods.