Fast fully parallel thinning algorithms
From MaRDI portal
Publication:3136064
Recommendations
- A parallel thinning algorithm with fine grain subtasking
- A flexible thinning algorithm allowing parallel, sequential, and distributed application
- A 3D fully parallel surface-thinning algorithm
- Fully parallel 3D thinning algorithms based on sufficient conditions for topology preservation
- A noniterative thinning algorithm
Cited in
(22)- scientific article; zbMATH DE number 4051044 (Why is no real title available?)
- Strip line detection and thinning by RPCL-based local PCA
- Parallel Thinning with Complex Objects and Actors
- scientific article; zbMATH DE number 3986663 (Why is no real title available?)
- Skeletonizing digital images with cellular automata
- A new improved OPTA thinning algorithm
- A parallel thinning algorithm for grayscale images
- Modelling a fast parallel thinning algorithm for shared memory SIMD computers
- An efficient distributed thinning algorithm
- Equivalent 2D sequential and parallel thinning algorithms
- K3M: A universal algorithm for image skeletonization and a review of thinning techniques
- A parallel thinning algorithm with fine grain subtasking
- Thinning algorithms based on quadtree and octree representations
- An asynchronous thinning algorithm
- Parallel thinning algorithms on multicomputers: Experimental study on load balancing
- Vision-Based Robotic Comanipulation for Deforming Cables
- Metrical properties of a collection of 2D parallel thinning algorithms
- Tests for connectivity preservation for parallel reduction operators
- Implementation and comparison of binary thinning algorithms on GPU
- Skeletonisation: An electrostatic field-based approach
- A flexible thinning algorithm allowing parallel, sequential, and distributed application
- A noniterative thinning algorithm
This page was built for publication: Fast fully parallel thinning algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3136064)
