K3M: A universal algorithm for image skeletonization and a review of thinning techniques
Open accessThe DOI matches its Crossref record.
Abstract
K3M: A universal algorithm for image skeletonization and a review of thinning techniques: 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.
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
Cited by
Weak Micro-Scratch Detection Based on Deep Convolutional Neural Network
Song, L., Lin, W., Yang, Y.-G., Zhu, X., Guo, Q., & Xi, J. (2019) · IEEE Access · doi:10.1109/access.2019.2894863 · Cited by 61
“In order to obtain the arc length information of the scratches, the scratch skeleton is extracted by the K3M algorithm [18].”
Method
Metadata
- Authors
- Saeed, K., Tabędzki, M., Rybnik, M., & Adamski, M.
- Venue
- International Journal of Applied Mathematics and Computer Science
- Publisher
- University of Zielona Góra, Poland
- Published
- 2010-06-01
- Volume
- 20
- Issue
- 2
- Pages
- 317-335
- ISSN
- 1641-876X (ISSN-L)
- OpenAlex
- W2091806358
- Cited by
- 193
- References
- 0
- FWCI
- 9.58
- Type
- journal article
- Language
- en
- Open access
- gold
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: K3M: A universal algorithm for image skeletonization and a review of thinning techniques. https://app.cochat.ai/papers/10.2478/v10006-010-0024-4
- The paper
- Saeed, K., Tabędzki, M., Rybnik, M., & Adamski, M. (2010). K3M: A universal algorithm for image skeletonization and a review of thinning techniques. International Journal of Applied Mathematics and Computer Science. https://doi.org/10.2478/v10006-010-0024-4
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.