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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1982-2018
010203019822018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Active learning (AL) and semisupervised learning (SSL) are both promising solutions to hyperspectral image classification. Given… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 7
Is this relevant?
2015
2015
This paper introduces a novel spectral-spatial classification method for hyperspectral images based on extended random walkers… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2014
2014
The aim of this work is to present a modification of the Random Walker algorithm for the segmentation of occlusal caries from… (More)
  • table I
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2010
2010
General purpose image segmentation is one of the important and challenging problems in image processing. Objective of image… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2009
Highly Cited
2009
In this work, we extend a common framework for seeded image segmentation that includes the graph cuts, random walker, and… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
2008
2008
In this paper we present a new method for fully automatic liver segmentation in computed tomography images. First, an initial set… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
Is this relevant?
2008
2008
Interactive segmentation is often performed on images that have been stored on disk (e.g., a medical image server) for some time… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
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… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2005
Highly Cited
2005
  • Leo Grady
  • 2005 IEEE Computer Society Conference on Computer…
  • 2005
The recently introduced random walker segmentation algorithm by Grady and Funka-Lea (2004) has been shown to have desirable… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1982
Highly Cited
1982
In seeking rational models of time series, the concept of approximating second-order statistical relationships (i.e., the Yule… (More)
  • figure 1
  • table I
  • figure 3
  • figure 5
  • table I
Is this relevant?