Name
Affiliation
Papers
ULLRICH KOETHE
HCI, University of Heidelberg, Speyerer Str. 6, D-69115 Heidelberg, Germany
39
Collaborators
Citations 
PageRank 
83
249
22.37
Referers 
Referees 
References 
827
826
384
Search Limit
100827
Title
Citations
PageRank
Year
BayesFlow: Learning Complex Stochastic Models With Invertible Neural Networks00.342022
Towards Multimodal Depth Estimation from Light Fields00.342022
OutbreakFlow: Model-based Bayesian inference of disease outbreak dynamics with invertible neural networks and its application to the COVID-19 pandemics in Germany10.362021
Generative Classifiers as a Basis for Trustworthy Image Classification00.342021
Invertible Neural Networks for Uncertainty Quantification in Photoacoustic Imaging00.342021
The Mutex Watershed and its Objective: Efficient, Parameter-Free Graph Partitioning00.342021
Learning Robust Models Using the Principle of Independent Causal Mechanisms.00.342021
Hint: Hierarchical Invertible Neural Transport For Density Estimation And Bayesian Inference00.342021
OutbreakFlow: Model-based Bayesian inference of disease outbreak dynamics with invertible neural networks and its application to the COVID-19 pandemics in Germany10.362021
Disentanglement by Nonlinear ICA with General Incompressible-flow Networks (GIN)00.342020
Training Normalizing Flows with the Information Bottleneck for Competitive Generative Classification00.342020
Out Of Distribution Detection For Intra-Operative Functional Imaging00.342019
Uncertainty-aware performance assessment of optical imaging modalities with invertible neural networks.10.382019
The Mutex Watershed and its Objective: Efficient, Parameter-Free Image Partitioning00.342019
Analyzing Inverse Problems with Invertible Neural Networks.00.342019
Analyzing Inverse Problems with Invertible Neural Networks.20.372018
Neuron Segmentation With High-Level Biological Priors.10.362018
An Efficient Fusion Move Algorithm For The Minimum Cost Lifted Multicut Problem60.472016
Cut, Glue, & Cut: A Fast, Approximate Solver for Multicut Partitioning40.402014
Asymmetric Cuts: Joint Image Labeling And Partitioning00.342014
Learning to segment neurons with non-local quality measures.60.512013
Weakly Supervised Learning of Image Partitioning Using Decision Trees with Structured Split Criteria30.432013
3D segmentation of SBFSEM images of neuropil by a graphical model over supervoxel boundaries.110.652012
Learning to count with regression forest and structured labels.351.222012
Quality Classification of Microscopic Imagery with Weakly Supervised Learning.10.362012
The lazy flipper: efficient depth-limited exhaustive search in discrete graphical models130.562012
Ilastik: Interactive Learning And Segmentation Toolkit1115.522011
Automated Segmentation Of Synapses In 3d Em Data60.702011
Deltr: Digital embryo lineage tree reconstructor60.492011
SIMA: simultaneous multiple alignment of LC/MS peak lists.80.622011
Carving: scalable interactive segmentation of neural volume electron microscopy images70.572011
Runtime-Flexible Multi-dimensional Arrays and Views for C++98 and C++0x10.362010
Computational protein profile similarity screening for quantitative mass spectrometry experiments.30.412010
Geometric Analysis of 3D Electron Microscopy Data.00.342010
Deuteration distribution estimation with improved sequence coverage for HX/MS experiments.20.522010
How to Extract the Geometry and Topology from Very Large 3D Segmentations20.372010
An empirical comparison of inference algorithms for graphical models with higher order factors using openGM160.822010
The Lazy Flipper: MAP Inference in Higher-Order Graphical Models by Depth-limited Exhaustive Search20.462010
Multivariate watershed segmentation of compositional data00.342009