2019 Conference on Design and Architectures for Signal and Image Processing (DASIP) 2019
DOI: 10.1109/dasip48288.2019.9049184
|View full text |Cite
|
Sign up to set email alerts
|

SparseCCL: Connected Components Labeling and Analysis for sparse images

Abstract: Connected components labeling and analysis for dense images have been extensively studied on a wide range of architectures. Some applications, like particles detectors in High Energy Physics, need to analyse many small and sparse images at high throughput. Because they process all pixels of the image, classic algorithms for dense images are inefficient on sparse data. We address this inefficiency by introducing a new algorithm specifically designed for sparse images. We show that we can further improve this sp… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 16 publications
(28 reference statements)
0
5
0
Order By: Relevance
“…In this paper, the segmentation and ground plane line extraction algorithm proposed in [11] is applied to remove the ground points, and residual obstacle points are clustered into many clusters with a seed-filling connected components labeling algorithm [44]. Moreover, we search a wide range of the following values and select those that yield the best estimation.…”
Section: Implementation Details and Compared Methodsmentioning
confidence: 99%
“…In this paper, the segmentation and ground plane line extraction algorithm proposed in [11] is applied to remove the ground points, and residual obstacle points are clustered into many clusters with a seed-filling connected components labeling algorithm [44]. Moreover, we search a wide range of the following values and select those that yield the best estimation.…”
Section: Implementation Details and Compared Methodsmentioning
confidence: 99%
“…However, this greater simplicity comes with a "frame rate" requirement (30 MHz) that is orders of magnitude larger than typical image processing rates (<1 kHz). In fact, a CPU implementation exists of the same VELO clustering task discussed in this that was inspired by some algorithms in use in image processing problems, appropriately revisited to exploit the smallness of the size of the components and their sparseness [20].…”
Section: Further Considerationsmentioning
confidence: 99%
“…However, this greater simplicity comes with a 'frame rate' requirement (30 MHz) that is orders of magnitude larger than typical image processing rates (<1 kHz). In fact, a CPU implementation exists of the same VELO clustering task discussed in this paper that was inspired by some algorithms in use in image processing problems, appropriately revisited to exploit the smallness of the size of the components and their sparseness [20].…”
Section: Fpga Resource Usage and Throughputmentioning
confidence: 99%