A characterization of parallel thinning algorithms
From MaRDI portal
Cited in
(21)- A topological characterization of thinning
- Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images
- A general scheme for constructing skeleton models
- Tests for connectivity preservation for parallel reduction operators
- 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
- Strong thinning and polyhedric approximation of the surface of a voxel object
- A Jordan curve theorem for 2-dimensional tilings
- Powerful parallel and symmetric 3D thinning schemes based on critical kernels
- A 3D 6-subiteration curve thinning algorithm based on \(P\)-simple points
- Prototyping structural description using an inductive learning program
- A 3D sequential thinning scheme based on critical kernels
- Skeletonizing digital images with cellular automata
- K3M: A universal algorithm for image skeletonization and a review of thinning techniques
- scientific article; zbMATH DE number 7714764 (Why is no real title available?)
- Similarity of 2D thinning algorithms and their k-attempt versions
- An order-independent 2D parallel 4-subiteration thinning algorithm
- Minimal non-deletable sets and minimal non-codeletable sets in binary images
- Thinning on cell complexes from polygonal tilings
- On parallel thinning algorithms: minimal non-simple sets, P-simple points and critical kernels
- Topological properties of thinning in 2-D pseudomanifolds
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)
