mlsanityData to 13 Oct 2026

End-to-End Learned Random Walker for Seeded Image Segmentation

arXiv 1905.09045 ↗First posted 22 May 2019cs.CV cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

We present an end-to-end learned algorithm for seeded segmentation. Our method is based on the Random Walker algorithm, where we predict the edge weights of the underlying graph using a convolutional neural network. This can be interpreted as learning context-dependent diffusivities for a linear diffusion process. Besides calculating the exact gradient for optimizing these diffusivities, we also propose simplifications that sparsely sample the gradient and still yield competitive results. The proposed method achieves the currently best results on a seeded version of the CREMI neuron segmentation challenge.

Key facts. Cited by 4 papers in the map (data through 13 Oct 2026). First posted on arXiv 22 May 2019.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 2; 2023: 1.

4 papers.