Image Segmentation Random Walker Algorithm
Jump to navigation
Jump to search
An Image Segmentation Random Walker Algorithm is an Image Segmentation Algorithm that is based on a graph-based random walk algorithm.
- AKA: Random Walker Algorithm.
- Context:
- It was first proposed in Grady & Funka-lea (2004) and described by Grady (2006).
- …
- Example(s):
- Counter-Example(s):
- a Random Walk NLP Algorithm,
- a ...
- See: Image Segmentation, Graph-based Random Walk Algorithm.
References
2021
- (Wikipedia, 2021) ⇒ https://en.wikipedia.org/wiki/Random_walker_algorithm Retrieved:2021-8-14.
- The random walker algorithm is an algorithm for image segmentation. In the first description of the algorithm,[1] a user interactively labels a small number of pixels with known labels (called seeds), e.g., "object" and "background". The unlabeled pixels are each imagined to release a random walker, and the probability is computed that each pixel's random walker first arrives at a seed bearing each label, i.e., if a user places K seeds, each with a different label, then it is necessary to compute, for each pixel, the probability that a random walker leaving the pixel will first arrive at each seed. These probabilities may be determined analytically by solving a system of linear equations. After computing these probabilities for each pixel, the pixel is assigned to the label for which it is most likely to send a random walker. The image is modeled as a graph, in which each pixel corresponds to a node which is connected to neighboring pixels by edges, and the edges are weighted to reflect the similarity between the pixels. Therefore, the random walk occurs on the weighted graph (see Doyle and Snell for an introduction to random walks on graphs [2] ). Although the initial algorithm was formulated as an interactive method for image segmentation, it has been extended to be a fully automatic algorithm, given a data fidelity term (e.g., an intensity prior).[3] It has also been extended to other applications. The algorithm was initially published by Leo Grady as a conference paper [4] and later as a journal paper.
- ↑ Grady, L.: "Random walks for image segmentation". PAMI, 2006
- ↑ P. Doyle, J. L. Snell: Random Walks and Electric Networks, Mathematical Association of America, 1984
- ↑ Leo Grady: "Multilabel Random Walker Image Segmentation Using Prior Models", Proc. of CVPR, Vol. 1, pp. 763–770, 2005.
- ↑ Leo Grady, Gareth Funka-Lea: Multi-Label Image Segmentation for Medical Applications Based on Graph-Theoretic Electrical Potentials, Proc. of the 8th ECCV Workshop on Computer Vision Approaches to Medical Image Analysis and Mathematical Methods in Biomedical Image Analysis, pp. 230–245, 2004.