Skip to search formSkip to main contentSkip to account menu

Random walker algorithm

Known as: Random Walker (computer vision) 
The random walker algorithm is an algorithm for image segmentation. In the first description of the algorithm, a user interactively labels a small… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
Graph (discrete mathematics)List of algorithmsPrecomputationVoltage source

Broader (1)

Image segmentation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Unifying the random walker algorithm and the SIR model for graph clustering and image segmentation
In this paper, we explore the image segmentation task using a graph clustering approach. We formulate this clustering as a… 
2014
2014
Screened Poisson Hyperfields for Shape Coding
We present a novel perspective on shape characterization using the screened Poisson equation. We discuss that the effect of the… 
2010
2010
Improved random walker algorithm for image segmentation
General purpose image segmentation is one of the important and challenging problems in image processing. Objective of image… 
2010
2010
Rediscovery of an enigmatic Euro-Mediterranean Pliocene nassariid species: Nassarius crassiusculus Bellardi, 1882 (Gastropoda: Nassariidae)
Nassarius crassiusculus is an enigmatic Euro-Mediterranean Pliocene nassariid. Since its description, it had not been found until… 
2009
2009
MIMO-AR System Identification and Blind Source Separation for GMM-Distributed Sources
The problem of blind source separation (BSS) and system identification for multiple-input multiple-output (MIMO) auto-regressive… 
2008
2008
Automatic Liver Segmentation Using the Random Walker Algorithm
In this paper we present a new method for fully automatic liver segmentation in computed tomography images. First, an initial set… 
1999
1999
On bare carbon chain anions as possible carriers of the diffuse interstellar features
The recent hypothesis that some of the diffuse interstellar bands originate in bare carbon chains such as and is tested using… 
1985
1985
Probability densities for the displacement of random walks on percolation clusters
The probability density of the displacement or end-to-end distance of a random walk on the incipient infinite percolation cluster… 
1983
1983
Spiral self-avoiding walks
Self-avoiding walks with a 'spiral' constraint, on the square lattice, are enumerated up to 40 steps. Numerical evidence suggests… 
Review
1980
Review
1980
On the interpretability of ordination diagrams
In my review of multivariate methods in phytosociology (van der Maarel 1979) I briefly commented on the interpretability of Type… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)