Probabilistic Watershed: Sampling all spanning forests for seeded segmentation and semi-supervised learning

NeurIPS 2019 Enrique Fita SanmartinSebastian DamrichFred A. Hamprecht

The seeded Watershed algorithm / minimax semi-supervised learning on a graph computes a minimum spanning forest which connects every pixel / unlabeled node to a seed / labeled node. We propose instead to consider all possible spanning forests and calculate, for every node, the probability of sampling a forest connecting a certain seed with that node... (read more)

PDF Abstract NeurIPS 2019 PDF NeurIPS 2019 Abstract

Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods used in the Paper

🤖 No Methods Found Help the community by adding them if they're not listed; e.g. Deep Residual Learning for Image Recognition uses ResNet