Skip to main content
Conference ProceedingsOPEN ACCESS

Two More Strategies to Speed Up Connected Components Labeling Algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2017) 10485 LNCS 48-58
DOI: 10.1007/978-3-319-68548-9_5
N/ACitations
Citations of this article
22Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents two strategies that can be used to improve the speed of Connected Components Labeling algorithms. The first one operates on optimal decision trees considering image patterns occurrences, while the second one articulates how two scan algorithms can be parallelized using multi-threading. Experimental results demonstrate that the proposed methodologies reduce the total execution time of state-of-the-art two scan algorithms.

Author supplied keywords

Cite

CITATION STYLE

APA

Bolelli, F., Cancilla, M., & Grana, C. (2017). Two More Strategies to Speed Up Connected Components Labeling Algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10485 LNCS, pp. 48–58). Springer Verlag. https://doi.org/10.1007/978-3-319-68548-9_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free