A characterization of parallel thinning algorithms
From MaRDI portal
Publication:4101458
DOI10.1016/S0019-9958(75)90448-9zbMATH Open0334.68054OpenAlexW1979527946MaRDI QIDQ4101458FDOQ4101458
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
Cited In (19)
- Tests for connectivity preservation for parallel reduction operators
- On parallel thinning algorithms: minimal non-simple sets, P-simple points and critical kernels
- Thinning on cell complexes from polygonal tilings
- Topological properties of thinning in 2-D pseudomanifolds
- Recognition of hand-printed Chinese characters using decision trees/machine learning C4. 5 system
- K3M: A universal algorithm for image skeletonization and a review of thinning techniques
- Prototyping structural description using an inductive learning program
- Powerful parallel and symmetric 3D thinning schemes based on critical kernels
- A 3D Sequential Thinning Scheme Based on Critical Kernels
- A topological characterization of thinning
- A general scheme for constructing skeleton models
- A Jordan curve theorem for 2-dimensional tilings
- A 3D 12-subiteration thinning algorithm based on \(P\)-simple points
- Strong thinning and polyhedric approximation of the surface of a voxel object
- Skeletonizing Digital Images with Cellular Automata
- A 3D 6-subiteration curve thinning algorithm based on \(P\)-simple points
- Minimal non-deletable sets and minimal non-codeletable sets in binary images
- Title not available (Why is that?)
- Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images
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)
