A new algorithmic framework for basic problems on binary images

DOI10.1016/j.dam.2016.02.025zbMath1370.68308OpenAlexW2332785190MaRDI QIDQ528334

Sergey Bereg, Lilian Buzer, Tetsuo Asano

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

zbMATH Keywords

algorithmcomputational complexityconnectivitybinary imagegrid graphconnected componentconnected components labelingconstant workspace algorithmsmall workspace algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10)

Cites Work

• In-place algorithm for erasing a connected component in a binary image
• 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
• A general approach to connected-component labeling for arbitrary image representations
• Linear-time connected-component labeling based on sequential local operations
• AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE
• Sequential Operations in Digital Picture Processing
• Connectivity in Digital Pictures
• Unnamed Item
• Unnamed Item