Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,818,411 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Graph (discrete mathematics)
List of algorithms
Precomputation
Voltage source
Expand
Broader (1)
Image segmentation
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Segmentation of Ground Glass Opacity Pulmonary Nodules Based on a Modified Random Walker Approach
Xiang-Xia Li
,
Bin Li
,
Lianfang Tian
,
Li Zhang
,
Guang-Ming Peng
,
Li-Fei Wang
2017
Corpus ID: 57412306
2016
2016
3D Vessel Segmentation Using Random Walker with Oriented Flux Analysis and Direction Coherence
Qing Zhang
,
Albert C. S. Chung
Medical Imaging and Augmented Reality
2016
Corpus ID: 185980
Accurate 3D vessel segmentation remains challenging due to varying intensity contrast, high noise level, topological complexity…
Expand
2014
2014
Optimal Spread in Network Consensus Models
F. Hunt
arXiv.org
2014
Corpus ID: 2554046
In a model of network communication based on a random walk in an undirected graph, what subset of nodes (subject to constraints…
Expand
2010
2010
Rediscovery of an enigmatic Euro-Mediterranean Pliocene nassariid species: Nassarius crassiusculus Bellardi, 1882 (Gastropoda: Nassariidae)
G. Manganelli
,
V. Spadini
,
I. Martini
,
G. Manganelli
2010
Corpus ID: 86907900
Nassarius crassiusculus is an enigmatic Euro-Mediterranean Pliocene nassariid. Since its description, it had not been found until…
Expand
2007
2007
Random Walks with Decreasing Steps
Kent E. Morrison
2007
Corpus ID: 18903426
We consider a one-dimensional random walk beginning at the origin and moving ± cn at time n. If ∑ cn < ∞ then with probability…
Expand
2007
2007
The narrow escape problem revisited
O. Bénichou
,
R. Voituriez
2007
Corpus ID: 15844534
The time needed for a particle to exit a confining domain through a small window, called the narrow escape time (NET), is a…
Expand
2005
2005
Untersuchungen zur Strukturbildung in P2P-Netzen durch "Random Walker"
M. Wulff
2005
Corpus ID: 43865401
1999
1999
Calculating the diffusion coefficient of a random walker among immobile obstacles: New numerically exact theory and applications.
J. Mercier
1999
Corpus ID: 116890853
1987
1987
Biased diffusion in percolation systems: indication of multifractal behaviour
A. Bunde
,
H. Harder
,
S. Havlin
,
H. Roman
1987
Corpus ID: 56004609
The authors study diffusion in percolation systems at criticality in the presence of a constant bias field E. Using the exact…
Expand
1983
1983
Spiral self-avoiding walks
V. Privman
1983
Corpus ID: 123404790
Self-avoiding walks with a 'spiral' constraint, on the square lattice, are enumerated up to 40 steps. Numerical evidence suggests…
Expand