An asynchronous thinning algorithm

DOI10.1016/0146-664X(82)90041-7MaRDI QIDQ3315036zbMATH OpenOpenAlexFDO

Authors Theo Pavlidis

Publication date 1982

Published in Computer Graphics and Image Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0146-664x(82)90041-7

zbMATH Keywords

bilevel imageimage processingpictorial information processingtransformation of a bilevel (two-color) image into a line drawing

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Recommendations

• A parallel thinning algorithm with fine grain subtasking
• A flexible thinning algorithm allowing parallel, sequential, and distributed application
• A noniterative thinning algorithm
• Fast fully parallel thinning algorithms
• 1-attempt parallel thinning

Cited in

(12)

• Parallel and sequential transformations on digital images
• A parallel thinning algorithm with fine grain subtasking
• An efficient distributed thinning algorithm
• Skeletonisation: An electrostatic field-based approach
• K3M: A universal algorithm for image skeletonization and a review of thinning techniques
• Line connectivity algorithms for an asynchronous pyramid computer
• A noniterative thinning algorithm
• A flexible thinning algorithm allowing parallel, sequential, and distributed application
• Strip line detection and thinning by RPCL-based local PCA
• scientific article; zbMATH DE number 1833448 (Why is no real title available?)
• scientific article; zbMATH DE number 2090187 (Why is no real title available?)
• Voronoi diagrams of polygons: a framework for shape representation.

This page was built for publication: An asynchronous thinning algorithm

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