In-place algorithm for erasing a connected component in a binary image

DOI10.1007/S00224-011-9335-6zbMATH Open1253.68344OpenAlexW2028366103MaRDI QIDQ692939FDOQ692939

Authors: Tetsuo Asano 

Publication date: 6 December 2012

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-011-9335-6

Recommendations

• A new algorithmic framework for basic problems on binary images
• Small work space algorithms for some basic problems on binary images
• A new framework for connected components labeling of binary images
• scientific article; zbMATH DE number 1261131
• Hypercube and shuffle-exchange algorithms for image component labeling

zbMATH Keywords

componentconnectivitybinary imageconstant work space

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Computing methodologies for image processing (68U10)

Cites Work

• Title not available (Why is that?)
• Connectivity in Digital Pictures
• Towards in-place geometric algorithms and data structures
• On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology
• Finding Nearest Larger Neighbors
• AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE
• In-Place Algorithm for Image Rotation

Cited In (2)

• Small work space algorithms for some basic problems on binary images
• A new algorithmic framework for basic problems on binary images

This page was built for publication: In-place algorithm for erasing a connected component in a binary image

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