Random Walks for Image Segmentation

@article{Grady2006RandomWF,
  title={Random Walks for Image Segmentation},
  author={Leo J. Grady},
  journal={IEEE Transactions on Pattern Analysis and Machine Intelligence},
  year={2006},
  volume={28},
  pages={1768-1783}
}
  • L. Grady
  • Published 2006
  • Mathematics, Medicine, Computer Science
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with user-defined (or predefined) labels, one can analytically and quickly determine the probability that a random walker starting at each unlabeled pixel will first reach one of the prelabeled pixels. By assigning each pixel to the label for which the greatest probability is calculated, a high-quality image segmentation may be obtained. Theoretical properties of this algorithm… Expand
Random walker watersheds: A new image segmentation approach
TLDR
This work proposes a new graph-based approach for performing a multilabel, interactive image segmentation using the principle of random walks, and presents quantitative and qualitative results, comparing the new algorithm with the original random walker image segmentsation algorithm. Expand
Efficient label propagation for interactive image segmentation
  • Fei Wang, X. Wang, Tao Li
  • Computer Science
  • Sixth International Conference on Machine Learning and Applications (ICMLA 2007)
  • 2007
TLDR
A novel algorithm for interactive multilabel image/video segmentation that can automatically propagate those labels to the remaining unlabeled pixels through an iterative procedure is proposed. Expand
Efficient label propagation for interactive image segmentation
TLDR
A novel algorithm for interactive multilabel image/video segmentation that can automatically propagate those labels to the remaining unlabeled pixels through an iterative procedure is proposed. Expand
An Improved Random Walk Algorithm for Interactive Image Segmentation
TLDR
The random walk algorithm is improved in two aspects: (1) label prior is taken into account when computing edge weights between adjacent pixels; (2) each unseeded pixel is assigned with the same label as the seed with maximum first arrival probability to reduce the bias effect of seed size. Expand
Random walks in directed hypergraphs and application to semi-supervised image segmentation
TLDR
A formulation of a random walk in a directed hypergraph that serves as a basis to a semi-supervised image segmentation procedure that is configured as a machine learning problem, where a few sample pixels are used to estimate the labels of the unlabeled ones. Expand
Random Walk and Front Propagation on Watershed Adjacency Graphs for Multilabel Image Segmentation
TLDR
This paper proposes new solutions to the watershed partition of an image by applying two interactive multilabel partitioning techniques to the adjacency graph of the watershed regions, based on existing segmentation techniques previously implemented on image lattices. Expand
A Seeded Image Segmentation Framework Unifying Graph Cuts And Random Walker Which Yields A New Algorithm
  • A. Sinop, L. Grady
  • Mathematics, Computer Science
  • 2007 IEEE 11th International Conference on Computer Vision
  • 2007
TLDR
This work explores the segmentation algorithm defined by an linfin norm, provides a method for the optimization and shows that the resulting algorithm produces an accurate segmentation that demonstrates greater stability with respect to the number of seeds employed than either the graph cuts or random walker methods. Expand
Interactive image segmentation using probabilistic hypergraphs
TLDR
A novel interactive framework for segmenting images using probabilistic hypergraphs which model the spatial and appearance relations among image pixels and a front-to-end image segmentation system based on the proposed method, which is shown to achieve promising quantitative and qualitative results. Expand
Spatial Sampling for Image Segmentation
TLDR
A novel framework for image segmentation based on the maximum likelihood estimator, which allows for efficient segmentation methods able to deal with textured images and is naturally extended for combining different features. Expand
Enhancing a diffusion algorithm for 4D image segmentation using local information
TLDR
An interactively adjusted active contours slice by slice method considering local information, where one starts with one manually labeled slice and moves forward in any direction, which is superior with respect to accuracy towards the diffusion algorithm but inferior in the amount of tedious manual processing steps. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 114 REFERENCES
Multilabel random walker image segmentation using prior models
  • L. Grady
  • Mathematics, Computer Science
  • 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05)
  • 2005
TLDR
It is shown that incorporation of a nonparametric probability density model allows for an extended random walkers algorithm that can locate disconnected objects and does not require user-specified labels. Expand
Multi-label Image Segmentation for Medical Applications Based on Graph-Theoretic Electrical Potentials
TLDR
A novel method is proposed for performing multi-label, semi-automated image segmentation using combinatorial analogues of standard operators and principles from continuous potential theory, allowing it to be applied in arbitrary dimension. Expand
A Seeded Image Segmentation Framework Unifying Graph Cuts And Random Walker Which Yields A New Algorithm
  • A. Sinop, L. Grady
  • Mathematics, Computer Science
  • 2007 IEEE 11th International Conference on Computer Vision
  • 2007
TLDR
This work explores the segmentation algorithm defined by an linfin norm, provides a method for the optimization and shows that the resulting algorithm produces an accurate segmentation that demonstrates greater stability with respect to the number of seeds employed than either the graph cuts or random walker methods. Expand
A New Algorithm for Energy Minimization with Discontinuities
TLDR
This paper considers a natural class of energy functions that permits discontinuities, and develops a new approximation algorithm based on graph cuts that produces a local minimum with respect to a certain move space. Expand
Random Walks for Image Segmentation
A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with user-defined (or predefined) labels, one can analytically and quickly deter...
Interactive Graph Cuts for Optimal Boundary and Region Segmentation of Objects in N-D Images
TLDR
A new technique for general purpose interactive segmentation of N-dimensional images where the user marks certain pixels as “object” or “background” to provide hard constraints for segmentation. Expand
Interactive Image Segmentation Using an Adaptive GMMRF Model
TLDR
Estimation is performed by solving a graph cut problem for which very efficient algorithms have recently been developed, however the model depends on parameters which must be set by hand and the aim of this work is for those constants to be learned from image data. Expand
"GrabCut": interactive foreground extraction using iterated graph cuts
TLDR
A more powerful, iterative version of the optimisation of the graph-cut approach is developed and the power of the iterative algorithm is used to simplify substantially the user interaction needed for a given quality of result. Expand
"GrabCut": interactive foreground extraction using iterated graph cuts
TLDR
A more powerful, iterative version of the optimisation of the graph-cut approach is developed and the power of the iterative algorithm is used to simplify substantially the user interaction needed for a given quality of result. Expand
Fast Approximate Energy Minimization via Graph Cuts
TLDR
This work presents two algorithms based on graph cuts that efficiently find a local minimum with respect to two types of large moves, namely expansion moves and swap moves that allow important cases of discontinuity preserving energies. Expand
...
1
2
3
4
5
...