On Parallel Thinning Algorithms: Minimal Non-simple Sets, P-simple Points and Critical Kernels
JOURNAL OF MATHEMATICAL IMAGING AND VISION ; 35 , 1 ; 23-35
2009-01-01
13 pages
Article (Journal)
English
DDC: | 510 |
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Two-Dimensional Parallel Thinning Algorithms Based on Critical Kernels
British Library Online Contents | 2008
|Powerful Parallel and Symmetric 3D Thinning Schemes Based on Critical Kernels
British Library Online Contents | 2014
|An Automatic Correction of Ma’s Thinning Algorithm Based on P-simple Points
British Library Online Contents | 2010
|Fast Fully Parallel Thinning Algorithms
British Library Online Contents | 1992
|A Simple and Effective Parallel Algorithm of Binary Image Thinning (PABIT)
British Library Online Contents | 2004
|