End-to-End Learned Random Walker for Seeded Image Segmentation
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.
Code (1)
Tasks
Image SegmentationInstance SegmentationSegmentationSimilar Papers 제목 키워드 기반
Extensions of Karger's Algorithm: Why They Fail in Theory and How They Are Useful in Practice
The minimum graph cut and minimum $s$-$t$-cut problems are important primitives in the modeling of combinatorial problems in computer science, including in computer vision and machine learning. Some of the most efficient…
Gaussian ProcessesImage SegmentationSemantic SegmentationProbabilistic Watershed: Sampling all spanning forests for seeded segmentation and semi-supervised learning
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 pos…
AllPathological Pulmonary Lobe Segmentation from CT Images using Progressive Holistically Nested Neural Networks and Random Walker
Automatic pathological pulmonary lobe segmentation(PPLS) enables regional analyses of lung disease, a clinically important capability. Due to often incomplete lobe boundaries, PPLS is difficult even for experts, and most…
Hierarchical Random Walker Segmentation for Large Volumetric Biomedical Images
The random walker method for image segmentation is a popular tool for semi-automatic image segmentation, especially in the biomedical field. However, its linear asymptotic run time and memory requirements make applicatio…
Image SegmentationInteractive SegmentationSegmentationSemantic SegmentationMultiple Random Walkers and Their Application to Image Cosegmentation
A graph-based system to simulate the movements and interactions of multiple random walkers (MRW) is proposed in this work. In the MRW system, multiple agents traverse a single graph simultaneously. To achieve desired int…
Clustering