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