Comparative study and proof of single-pass connected components algorithms

DOI10.1007/s10851-019-00891-2zbMath1468.68274OpenAlexW2955963291MaRDI QIDQ2331087

Sven Simon, Michael J. Klaiber, Donald G. Bailey

Publication date: 25 October 2019

Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10851-019-00891-2

zbMATH Keywords

feature extractionFPGAunion-findstream processingconnected component labellingconnected component analysishardware architecture

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computing methodologies for image processing (68U10) Online algorithms; streaming algorithms (68W27)

Uses Software

• BSDS
• SIPI Image Database

Cites Work

• Unnamed Item
• Two linear time Union--Find strategies for image processing
• Fast connected-component labeling
• Worst-case Analysis of Set Union Algorithms
• Efficiency of a Good But Not Linear Set Union Algorithm
• A general approach to connected-component labeling for arbitrary image representations
• A Very Fast Algorithm for Simultaneously Performing Connected-Component Labeling and Euler Number Computing
• Linear-time connected-component labeling based on sequential local operations
• Optimized Block-Based Connected Components Labeling With Decision Trees
• Fast and Memory Efficient 2-D Connected Components Using Linked Lists of Line Segments
• Sequential Operations in Digital Picture Processing
• Set Merging Algorithms
• Algorithms and Data Structures

This page was built for publication: Comparative study and proof of single-pass connected components algorithms