2015
DOI: 10.1016/j.procs.2015.03.153
|View full text |Cite
|
Sign up to set email alerts
|

Color Image Segmentation Using Adaptive GrowCut Method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(6 citation statements)
references
References 7 publications
0
6
0
Order By: Relevance
“…The number of pixels associated to each region adjacency graph (RAG) are represented as node, which indicates the size of initial over segmented regions and they must be same as the reference node. RAGbased segmentation approach is hierarchical and the number of final regions are controlled manually according to the segmentation requirements [13][14][15][16][17][18][19][20]. In graph partition problem, objects which are extracted not necessarily connected and the set of edge weights reflects the similarity between each pair of related regions or nodes vi and vj.…”
Section: Proposed Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…The number of pixels associated to each region adjacency graph (RAG) are represented as node, which indicates the size of initial over segmented regions and they must be same as the reference node. RAGbased segmentation approach is hierarchical and the number of final regions are controlled manually according to the segmentation requirements [13][14][15][16][17][18][19][20]. In graph partition problem, objects which are extracted not necessarily connected and the set of edge weights reflects the similarity between each pair of related regions or nodes vi and vj.…”
Section: Proposed Methodsmentioning
confidence: 99%
“…In the past few decades, a variety of methods, such as statistical region merging (SRM), dynamic region merging (DRM), split and merge, similarity based merging, hierarchical merging, boundary based merging etc., have been developed to eliminate the segmentation errors [10][11][12][13][14][15].Here, image regions can be described in terms of shape, size, color, texture etc., and utilization of these kinds of parameters in region based merging techniques will enhance the efficiency of the method and improve the segmentation patterns [17][18][19][20], which are purely based on probabilistic and some logical criteria. In case, to determine the similarity between the two regions depends on pixel mean, variance and gray level, also which is based on Euclidean distance and log-likelihood ratio are wellknown statistics for region evaluation.…”
Section: Segmentation and Region Mergingmentioning
confidence: 99%
See 1 more Smart Citation
“…Nevertheless, minimum cut constantly tries to cut small collection of isolated nodes as the cut which is shown in (3) does not contain any information of intragroup [7]. [7].…”
Section: International Journal Of Computer Applications (0975 -8887) mentioning
confidence: 99%
“…The algorithm stops when all the pixels, which have predefined similarity with seed points, have been marked. An adaptive grow cut [10] method was later proposed as an improved algorithm for 2D general image segmentation which uses the output of GrowCut as the input of a k-means clustering.…”
Section: Introductionmentioning
confidence: 99%