A thinning algorithm for discrete binary images

Computer Graphics and Image Processing

Volumn 13, Issue 2, 1980, Pages 142-157

  Pavlidis, Theo ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRASSLAND SIGNATURES; HARDWOOD SIGNATURE; SKELETAL PIXELS; SPECTRAL SEPARABILITY;

PATTERN RECOGNITION SYSTEMS;

EID: 0019229320     PISSN: 0146664X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0146-664X(80)80037-2     Document Type: Article

References (18)

1. On the sequential approach to medial line transformation
2. A transformation for extracting new descriptors of shape
3. Region, extraction using boundary following
4. Linear skeletons from square cupboards
5. Representation of contours and regions for efficient computer search
6. Continuous skeletons from digitized images
7. Chain-link compression of arbitrary black-white images
8. Filling algorithms for raster graphics
9. Computer representation of planar regions by their skeletons
10. Sequential operations in digital picture processing
11. Connectivity in digital pictures
12. A characterization of parallel thinning algorithms
13. Neighborhood coding of binary images for fast contour following and general binary array processing
14. Some parallel thinning algorithms for digital pictures
15. A comparison of line thinning algorithms from digital geometry viewpoint
16. An analysis of topological properties of digitized binary pictures using local features