Comparative study and proof of single-pass connected components algorithms

DOI10.1007/S10851-019-00891-2MaRDI QIDQ2331087zbMATH OpenOpenAlexFDO

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

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

connected component analysisconnected component labellingfeature extractionFPGAhardware architecturestream processingunion-find

Mathematics Subject Classification ID

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

Recommendations

• A linear systolic algorithm for the connected component problem
• An efficient and fast parallel-connected component algorithm
• scientific article; zbMATH DE number 2079387
• An \(O(|V|^2)\) algorithm for single connectedness
• Static and dynamic parallel computation of connected components
• scientific article; zbMATH DE number 1057773
• A space-efficient algorithm for finding strongly connected components
• Determining connected components in linear time by a linear number of processors

Cites work

• 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
• Algorithms and Data Structures
• Efficiency of a Good But Not Linear Set Union Algorithm
• Fast and Memory Efficient 2-D Connected Components Using Linked Lists of Line Segments
• Fast connected-component labeling
• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• Linear-time connected-component labeling based on sequential local operations
• Optimized Block-Based Connected Components Labeling With Decision Trees
• Sequential Operations in Digital Picture Processing
• Set Merging Algorithms
• Two linear time Union--Find strategies for image processing
• Worst-case Analysis of Set Union Algorithms

Cited in

(1)

• Optimization and application of connected component labeling algorithm based on run-length encoding

Describes a project that uses

Uses Software

• SIPI Image Database
• BSDS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2331087)