Small work space algorithms for some basic problems on binary images

DOI10.1007/978-3-642-34732-0_8MaRDI QIDQ4912427zbMATH OpenOpenAlexFDO

Authors Sergey Bereg, Tetsuo Asano, Lilian Buzer

Publication date 4 April 2013

Published in Combinatorial Image Analaysis (Search for Journal in Brave)

Full work available at URL https://hal-upec-upem.archives-ouvertes.fr/hal-00827181/file/IWCIA_2012.pdf

zbMATH Keywords

connected componentlargest connected componentminimum enclosing rectanglespace-efficient algorithms

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(4)

• A new framework for connected components labeling of binary images
• A new algorithmic framework for basic problems on binary images
• In-place algorithm for erasing a connected component in a binary image
• The boundary and the shape of binary images

This page was built for publication: Small work space algorithms for some basic problems on binary images

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