The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
A fast parallel algorithm for thinning digital patterns
Open accessAbstract
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 north-west boundary points and the south-east corner points.End points and pixel connectivity are preserved.Each pattern is thinned down to a "skeleton" of unitary thickness.Experimental results show that this method is very effective.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Linear Skeletons From Square Cupboards
Hilditch, C. J. (1969) · Machine intelligence · Cited by 434
A characterization of parallel thinning algorithms
Rosenfeld, A. (1975) · Information and Control · doi:10.1016/s0019-9958(75)90448-9 · Cited by 194
Cited by
Thinning methodologies-a comprehensive survey
Lam, L., Lee, S.-W., & Suen, C. Y. (1992) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.161346 · Cited by 1,785
Self-citationFeature extraction methods for character recognition-A survey
Due Trier, Ø., Jain, A. K., & Taxt, T. (1996) · Pattern Recognition · doi:10.1016/0031-3203(95)00118-2 · Cited by 1,264
Digital topology: Introduction and survey
Kong, T. Y., & Rosenfeld, A. (1989) · Computer Vision, Graphics, and Image Processing · doi:10.1016/0734-189x(89)90147-3 · Cited by 1,010
Automatic Pixel‐Level Crack Detection and Measurement Using Fully Convolutional Network
Yang, X., Li, H., Yu, Y., Luo, X., Huang, T., & Yang, X. (2018) · Computer-Aided Civil and Infrastructure Engineering · doi:10.1111/mice.12412 · Cited by 852
DeepRoadMapper: Extracting Road Topology from Aerial Images
Mattyus, G., Luo, W., & Urtasun, R. (2017) · 2017 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2017.372 · Cited by 560
Metadata
- Authors
- Zhang, T. Y., & Suen, C. Y.
- Venue
- Communications of the ACM
- Published
- 1984-03
- Volume
- 27
- Issue
- 3
- Pages
- 236-239
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2039367092
- Cited by
- 2,756
- References
- 2
- FWCI
- 7.07
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.