A new algorithmic framework for basic problems on binary images

DOI10.1016/J.DAM.2016.02.025MaRDI QIDQ528334zbMATHOpenAlexFDO

Authors Sergey Bereg, Tetsuo Asano, Lilian Buzer

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

computational complexityalgorithmconnected componentconnectivitygrid graphbinary imageconnected components labelingconstant workspace algorithmsmall workspace algorithm

Mathematics Subject Classification ID

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

Recommendations

• A new framework for connected components labeling of binary images
• Small work space algorithms for some basic problems on binary images
• Linear-time connected-component labeling based on sequential local operations
• A general approach to connected-component labeling for arbitrary image representations
• In-place algorithm for erasing a connected component in a binary image

Cites work

• scientific article; zbMATH DE number 2129318 (Why is no real title available?)
• scientific article; zbMATH DE number 3900666 (Why is no real title available?)
• A general approach to connected-component labeling for arbitrary image representations
• AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE
• Connected Component Labeling Using Quadtrees
• Connected component labeling on coarse grain parallel computers: An experimental study
• Connectivity in Digital Pictures
• Finding Nearest Larger Neighbors
• Implicit data structures for fast search and update
• In-place algorithm for erasing a connected component in a binary image
• Linear-time connected-component labeling based on sequential local operations
• On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology
• Sequential Operations in Digital Picture Processing

Cited in

(8)

• A new framework for connected components labeling of binary images
• scientific article; zbMATH DE number 5139590 (Why is no real title available?)
• COMPUTATION OF MINKOWSKI MEASURES ON 2D AND 3D BINARY IMAGES
• Image algebra techniques for binary image component labeling with local operators
• Finding a minimal cover for binary images: An optimal parallel algorithm
• scientific article; zbMATH DE number 5984563 (Why is no real title available?)
• In-place algorithm for erasing a connected component in a binary image
• Small work space algorithms for some basic problems on binary images

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)