A new algorithmic framework for basic problems on binary images
DOI10.1016/J.DAM.2016.02.025zbMATH Open1370.68308OpenAlexW2332785190MaRDI QIDQ528334FDOQ528334
Lilian Buzer, Tetsuo Asano, Sergey Bereg
Publication date: 12 May 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.02.025
computational complexityalgorithmconnected componentconnectivitygrid graphbinary imageconnected components labelingconstant workspace algorithmsmall workspace algorithm
Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A general approach to connected-component labeling for arbitrary image representations
- Sequential Operations in Digital Picture Processing
- Connectivity in Digital Pictures
- Implicit data structures for fast search and update
- Connected component labeling on coarse grain parallel computers: An experimental study
- On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology
- Finding Nearest Larger Neighbors
- Connected Component Labeling Using Quadtrees
- Linear-time connected-component labeling based on sequential local operations
- AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE
- In-place algorithm for erasing a connected component in a binary image
Cited In (5)
This page was built for publication: A new algorithmic framework for basic problems on binary images
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q528334)
