WebDec 1, 1994 · The parallel thinning algorithm runs very fast and can be implemented in real time. Several English and Chinese characters and the difficult patterns often illustrated in the literature are also experimented to show the efficiency and consistency of our algorithm. References (22) A. Rosenfeld A characterization of parallel thinning … WebJan 29, 2008 · We prove simple local characterizations, which allow us to express thinning algorithms by way of sets of masks. We propose several new parallel algorithms, which are both fast and simple to implement, that yield symmetrical or non-symmetrical skeletons of 2D objects in 2D or 3D grids.
RESEARCH CONTRIBUTIONS A Fast Parallel Algorithm for …
WebA Fast Parallel Algorithm for Thinning Digital Patterns T. Y. ZHANG and C. Y. SUEN ABSTRACT: A fast parallel thinning algorithm is proposed in this paper. It consists of two subiterations: one aimed at deleting the south-east boundary points and the north-west corner points while the other one is aimed at deleting the ... WebA Fast Parallel Algorithm for Thinning Digital Patterns T. Y. ZHANG and C. Y. SUEN ABSTRACT: A fast parallel thinning algorithm is proposed in this paper. It consists of … dps oklahoma wrecker rules
A fast parallel algorithm for thinning digital patterns
WebSkeletonization is usually considered as a pre-processing step in pattern recognition algorithms, but its study is also interesting by itself for the analysis of line-based images such as texts, line drawings, human fingerprints classification or cartography. WebA fast parallel thinning algorithm is proposed in this paper. It consists of two subiterations: one aimed at deleting the south-east boundary points and the north-west corner points … WebDec 18, 1993 · A fast parallel thinning algorithm for digital patterns is presented. This algorithm is an improved version of the algorithms introduced by Zhang and Suen [5] … dps on chimney rock