Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
In this paper, a novel SuperPixel-based Extended Random Walker (SPERW) classification method for hyperspectral images is proposed… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2017
2017
Active learning (AL) and semisupervised learning (SSL) are both promising solutions to hyperspectral image classification. Given… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 7
Is this relevant?
2017
2017
Automatic pathological pulmonary lobe segmentation(PPLS) enables regional analyses of lung disease, a clinically important… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2016
2016
This work provides generalized notions and analysis methods for the hitting time of random walks on graphs. The hitting time… Expand
  • figure 4.1
  • figure 4.2
  • table 4.1
  • table 4.2
  • figure 4.4
Is this relevant?
Highly Cited
2015
Highly Cited
2015
This paper introduces a novel spectral-spatial classification method for hyperspectral images based on extended random walkers… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
In this work, we present a common framework for seeded image segmentation algorithms that yields two of the leading methods as… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2005
Highly Cited
2005
  • L. Grady
  • IEEE Computer Society Conference on Computer…
  • 2005
  • Corpus ID: 4501790
The recently introduced random walker segmentation algorithm by Grady and Funka-Lea (2004) has been shown to have desirable… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the… Expand
  • figure 5.1
Is this relevant?
Highly Cited
1984
Highly Cited
1984
The detailed topological or 'connectivity' properties of the clusters formed in diffusion limited aggregation (DLA) and cluster… Expand
  • table I
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Highly Cited
1982
Highly Cited
1982
  • J. Cadzow
  • Proceedings of the IEEE
  • 1982
  • Corpus ID: 2124756
In seeking rational models of time series, the concept of approximating second-order statistical relationships (i.e., the Yule… Expand
  • figure 1
  • table I
  • figure 3
  • figure 5
  • table I
Is this relevant?