2012
DOI: 10.5815/ijigsp.2012.05.01
|View full text |Cite
|
Sign up to set email alerts
|

A Review on Graph Based Segmentation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
23
0
3

Year Published

2014
2014
2024
2024

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 54 publications
(26 citation statements)
references
References 115 publications
0
23
0
3
Order By: Relevance
“…Graph based model [5] Min-cut/max-flow, Normalized cut, Grab cut, Random Walk Here we present a framework for transforming scale-space features constructed on color planes to generate a nucleus probability image such that gray level value of a pixel is proportionate to the probability that the pixel belongs to nuclear region. This probability plane enhances speed and robustness of the nucleus localization and segmentation stages as it transforms the non-linear features at multiple scales into prediction of presence of nucleus at particular pixel.…”
Section: Category Subcategorymentioning
confidence: 99%
“…Graph based model [5] Min-cut/max-flow, Normalized cut, Grab cut, Random Walk Here we present a framework for transforming scale-space features constructed on color planes to generate a nucleus probability image such that gray level value of a pixel is proportionate to the probability that the pixel belongs to nuclear region. This probability plane enhances speed and robustness of the nucleus localization and segmentation stages as it transforms the non-linear features at multiple scales into prediction of presence of nucleus at particular pixel.…”
Section: Category Subcategorymentioning
confidence: 99%
“…District developing is a way to deal with an image segmentation in which neighboring pixels are analyzed and joined to a locale class of no edges are identified. Area developing methodology is the inverse of the split and unions approach [20]: a) An underlying arrangement of little territories is interactively converged by similitude requirements. b) Start by picking a self-assertive seed pixel and contrast it and neighboring pixels.…”
Section: Region Growingmentioning
confidence: 99%
“…Within this context, computational methods that make use of graphs as a basic element of study have played a key role in getting innovative solutions in various fields of knowledge, in particular in problem areas of computer vision and information visualization. Recent examples of applications that employ graph analysis in their processing pipelines are easily found in the literature such as: segmentation and classification of images via large-scale graphs [1,2], rearrangement and removal of overlaps in visual layouts, visualization and high-dimensional data clustering [3,4], among others. Thus, the modern theory of graphs is seen today as an indispensable tool to explore, analyze, and process large volumes of information, especially when it comes to digital images and high-dimensional data visualization, in view of its strong theoretical and mathematical support [5].…”
Section: Introductionmentioning
confidence: 99%