A characterization of parallel thinning algorithms

DOI10.1016/S0019-9958(75)90448-9MaRDI QIDQ4101458zbMATH OpenOpenAlexFDO

Authors Azriel Rosenfeld

Publication date 1975

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(75)90448-9

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Cited in

(19)

• On parallel thinning algorithms: minimal non-simple sets, P-simple points and critical kernels
• Recognition of hand-printed Chinese characters using decision trees/machine learning C4. 5 system
• A 3D sequential thinning scheme based on critical kernels
• Prototyping structural description using an inductive learning program
• Skeletonizing digital images with cellular automata
• scientific article; zbMATH DE number 7714764 (Why is no real title available?)
• K3M: A universal algorithm for image skeletonization and a review of thinning techniques
• A 3D 12-subiteration thinning algorithm based on \(P\)-simple points
• A 3D 6-subiteration curve thinning algorithm based on \(P\)-simple points
• A general scheme for constructing skeleton models
• Thinning on cell complexes from polygonal tilings
• Strong thinning and polyhedric approximation of the surface of a voxel object
• Powerful parallel and symmetric 3D thinning schemes based on critical kernels
• Minimal non-deletable sets and minimal non-codeletable sets in binary images
• A topological characterization of thinning
• Tests for connectivity preservation for parallel reduction operators
• Topological properties of thinning in 2-D pseudomanifolds
• Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images
• A Jordan curve theorem for 2-dimensional tilings

This page was built for publication: A characterization of parallel thinning algorithms

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