We are very excited to join forces with MLCommons and OctoML.ai! Contact Grigori Fursin for more details!

A Probabilistic U-Net for Segmentation of Ambiguous Images

lib:33b272434b9e8171 (v1.0.0)

Vote to reproduce this paper and share portable workflows   1 
Authors: Simon A. A. Kohl,Bernardino Romera-Paredes,Clemens Meyer,Jeffrey De Fauw,Joseph R. Ledsam,Klaus H. Maier-Hein,S. M. Ali Eslami,Danilo Jimenez Rezende,Olaf Ronneberger
Where published: NeurIPS 2018 12
ArXiv: 1806.05034
Document:  PDF  DOI 
Artifact development version: GitHub
Abstract URL: http://arxiv.org/abs/1806.05034v4


Many real-world vision problems suffer from inherent ambiguities. In clinical applications for example, it might not be clear from a CT scan alone which particular region is cancer tissue. Therefore a group of graders typically produces a set of diverse but plausible segmentations. We consider the task of learning a distribution over segmentations given an input. To this end we propose a generative segmentation model based on a combination of a U-Net with a conditional variational autoencoder that is capable of efficiently producing an unlimited number of plausible hypotheses. We show on a lung abnormalities segmentation task and on a Cityscapes segmentation task that our model reproduces the possible segmentation variants as well as the frequencies with which they occur, doing so significantly better than published approaches. These models could have a high impact in real-world applications, such as being used as clinical decision-making algorithms accounting for multiple plausible semantic segmentation hypotheses to provide possible diagnoses and recommend further actions to resolve the present ambiguities.

Relevant initiatives  

Related knowledge about this paper Reproduced results (crowd-benchmarking and competitions) Artifact and reproducibility checklists Common formats for research projects and shared artifacts Reproducibility initiatives

Comments  

Please log in to add your comments!
If you notice any inapropriate content that should not be here, please report us as soon as possible and we will try to remove it within 48 hours!