2011 National Conference on Communications (NCC) 2011
DOI: 10.1109/ncc.2011.5734746
|View full text |Cite
|
Sign up to set email alerts
|

An improved connected component labeling by recursive label propagation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 15 publications
0
2
0
Order By: Relevance
“…LPA and SLPA algorithms are community detecting algorithms that are based on the label propagation (Li et al, 2015). The basic principle of LPA is that according to the connection relationship between nodes in the graph model, the labels of each node are diffused to the whole graph to obtain stable results, and the nodes with the same label are divided into the same community (Ravi Kiran, 2011). Compared with LPA, SLPA is different in that it introduces the strategies of the listener and speaker.…”
Section: Community Detectionmentioning
confidence: 99%
“…LPA and SLPA algorithms are community detecting algorithms that are based on the label propagation (Li et al, 2015). The basic principle of LPA is that according to the connection relationship between nodes in the graph model, the labels of each node are diffused to the whole graph to obtain stable results, and the nodes with the same label are divided into the same community (Ravi Kiran, 2011). Compared with LPA, SLPA is different in that it introduces the strategies of the listener and speaker.…”
Section: Community Detectionmentioning
confidence: 99%
“…Recursive connected component labeling [11,15] are those which are used to find the homogeneous region in binary images. In this method, as the size of the stack memory required which is propositional to the size of the region, gets exhausted quickly.…”
Section: Introductionmentioning
confidence: 99%