Pages that link to "Item:Q4101458"
From MaRDI portal
The following pages link to A characterization of parallel thinning algorithms (Q4101458):
Displaying 18 items.
- Minimal non-deletable sets and minimal non-codeletable sets in binary images (Q952465) (← links)
- Thinning on cell complexes from polygonal tilings (Q967401) (← links)
- On parallel thinning algorithms: minimal non-simple sets, P-simple points and critical kernels (Q993540) (← links)
- Topological properties of thinning in 2-D pseudomanifolds (Q993566) (← links)
- A topological characterization of thinning (Q1091154) (← links)
- Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images (Q1115212) (← links)
- A general scheme for constructing skeleton models (Q1168778) (← links)
- Tests for connectivity preservation for parallel reduction operators (Q1205563) (← links)
- Recognition of hand-printed Chinese characters using decision trees/machine learning C4. 5 system (Q1271321) (← links)
- A 3D 12-subiteration thinning algorithm based on \(P\)-simple points (Q1827821) (← links)
- Strong thinning and polyhedric approximation of the surface of a voxel object (Q1861553) (← links)
- A Jordan curve theorem for 2-dimensional tilings (Q2049889) (← links)
- Powerful parallel and symmetric 3D thinning schemes based on critical kernels (Q2251209) (← links)
- A 3D 6-subiteration curve thinning algorithm based on \(P\)-simple points (Q2573247) (← links)
- (Q2783156) (← links)
- A 3D Sequential Thinning Scheme Based on Critical Kernels (Q2946840) (← links)
- Skeletonizing Digital Images with Cellular Automata (Q3454783) (← links)
- K3M: A universal algorithm for image skeletonization and a review of thinning techniques (Q3587063) (← links)