2014
DOI: 10.1007/978-3-319-11331-9_60
|View full text |Cite
|
Sign up to set email alerts
|

Accelerated Connected Component Labeling Using CUDA Framework

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2015
2015
2018
2018

Publication Types

Select...
4
2
1

Relationship

2
5

Authors

Journals

citations
Cited by 10 publications
(3 citation statements)
references
References 4 publications
0
3
0
Order By: Relevance
“…Dynamic Parallelism is reported to boost the hierarchical clustering on K20c up to 3.03 times [5]. Accelerated Connected Component Labeling using Hyper-Q outperforms serial version by 26x [25].…”
Section: Related Workmentioning
confidence: 96%
“…Dynamic Parallelism is reported to boost the hierarchical clustering on K20c up to 3.03 times [5]. Accelerated Connected Component Labeling using Hyper-Q outperforms serial version by 26x [25].…”
Section: Related Workmentioning
confidence: 96%
“…Our Accelerated CCL (ACCL) implementation uses two scanning phases [22]. The first phase scans the image in parallel in a row-wise fashion to find contiguous pixels in the same row that can be assigned the same label.…”
Section: Connected Component Labeling (Ccl)mentioning
confidence: 99%
“…The first scan can run in parallel by using shared memory, while the second scan is a sequential operation. ACCL [37] is another parallelization algorithm that decomposes the image into rows. By defining a span as a group of pixels that are located contiguously in a row with the same intensity, it spawns two kernels, find spans and merge spans, to label an input image.…”
Section: Line-based CCL Algorithmmentioning
confidence: 99%