Linear-time connected-component labeling based on sequential local operations
From MaRDI portal
Recommendations
- Fast connected-component labeling
- A general approach to connected-component labeling for arbitrary image representations
- scientific article; zbMATH DE number 2044092
- A new framework for connected components labeling of binary images
- An algorithm for connected-component labeling, hole labeling and Euler number computing
Cited in
(22)- A new framework for connected components labeling of binary images
- Informed component label algorithm for robust identification of connected components with volume-of-fluid method
- An algorithm for connected-component labeling, hole labeling and Euler number computing
- Computing the component-labeling and the adjacency tree of a binary digital image in near logarithmic-time
- scientific article; zbMATH DE number 1759533 (Why is no real title available?)
- scientific article; zbMATH DE number 2044092 (Why is no real title available?)
- Optimization and application of connected component labeling algorithm based on run-length encoding
- On the performance of connected components grouping
- Efficient boundary extraction from orthogonal pseudo-polytopes: an approach based on the \(n\)D-EVM
- Low-latency connected component labeling using an FPGA
- A connected component labeling algorithm for implicitly defined domains
- A Very Fast Algorithm for Simultaneously Performing Connected-Component Labeling and Euler Number Computing
- An automatic cognitive graph-based segmentation for detection of blood vessels in retinal images
- Analysing emergent dynamics of evolving computation in 2D cellular automata
- Fast connected-component labeling
- scientific article; zbMATH DE number 1744991 (Why is no real title available?)
- Linear time algorithms for an image labelling machine
- Topological fidelity and image thresholding: a persistent homology approach
- A multi-plane approach for text segmentation of complex document images
- A new algorithmic framework for basic problems on binary images
- Comparative study and proof of single-pass connected components algorithms
- Small work space algorithms for some basic problems on binary images
This page was built for publication: Linear-time connected-component labeling based on sequential local operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4808398)