A one-pass thinning algoruthm and its parallel implementation
Computer Vision, Graphics, and Image Processing
A contour characterization for multiply connected figures
Pattern Recognition Letters
A modified fast parallel algorithm for thinning digital patterns
Pattern Recognition Letters
Line thinning by line following
Pattern Recognition Letters
Parallel thinning with two-subiteration algorithms
Communications of the ACM
A One-Pass Two-Operation Process to Detect the Skeletal Pixels on the 4-Distance Transform
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Theory for Multiresolution Signal Decomposition: The Wavelet Representation
IEEE Transactions on Pattern Analysis and Machine Intelligence
A comparison of some one-pass parallel thinnings
Pattern Recognition Letters
Fast fully parallel thinning algorithms
CVGIP: Image Understanding
Thinning Methodologies-A Comprehensive Survey
IEEE Transactions on Pattern Analysis and Machine Intelligence
One-Pass Parallel Thinning: Analysis, Properties, and Quantitative Evaluation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Algorithms for Graphics and Imag
Algorithms for Graphics and Imag
A Rotation Invariant Rule-Based Thinning Algorithm for Character Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Implementation and Advanced Results on the Non-interrupted Skeletonization Algorithm
CAIP '01 Proceedings of the 9th International Conference on Computer Analysis of Images and Patterns
A Parallel Thinning Algorithm with Two-Subiteration that Generates One-Pixel-Wide Skeletons
ICPR '96 Proceedings of the International Conference on Pattern Recognition (ICPR '96) Volume IV-Volume 7472 - Volume 7472
An Improved Parallel Thinning Algorithm
ICDAR '03 Proceedings of the Seventh International Conference on Document Analysis and Recognition - Volume 2
Digital Geometry: Geometric Methods for Digital Picture Analysis
Digital Geometry: Geometric Methods for Digital Picture Analysis
Digital Image Processing (3rd Edition)
Digital Image Processing (3rd Edition)
An Improved Rotation-Invariant Thinning Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
The Use of Hidden Deletable Pixel Detection to Obtain Bias-Reduced Skeletons in Parallel Thinning
ICPR '96 Proceedings of the 13th International Conference on Pattern Recognition - Volume 2
3D discrete skeleton generation by wave propagation on PR-octree for finite element mesh sizing
SM '04 Proceedings of the ninth ACM symposium on Solid modeling and applications
Computing a family of skeletons of volumetric models for shape description
Computer-Aided Design
Programming pattern recognition
AFIPS '55 (Western) Proceedings of the March 1-3, 1955, western joint computer conference
Experiments in processing pictorial information with a digital computer
IRE-ACM-AIEE '57 (Eastern) Papers and discussions presented at the December 9-13, 1957, eastern joint computer conference: Computers with deadlines to meet
Thinning Algorithms for Gray-Scale Pictures
IEEE Transactions on Pattern Analysis and Machine Intelligence
Wavelet-Based Approach to Character Skeleton
IEEE Transactions on Image Processing
Selecting anchor points for 2D skeletonization
ICIAR'11 Proceedings of the 8th international conference on Image analysis and recognition - Volume Part I
Parallel skeletonizing of digital images by using cellular automata
CTIC'12 Proceedings of the 4th international conference on Computational Topology in Image Context
Hi-index | 0.00 |
This paper aims at three aspects closely related to each other: first, it presents the state of the art in the area of thinning methodologies, by giving descriptions of general ideas of the most significant algorithms with a comparison between them. Secondly, it proposes a new thinning algorithm that presents interesting properties in terms of processing quality and algorithm clarity, enriched with examples. Thirdly, the work considers parallelization issues for intrinsically sequential algorithms of thinning. The main advantage of the suggested algorithm is its universality, which makes it useful and versatile for a variety of applications.