The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Nonparametric segmentation of curves into various representations
Abstract
This paper describes and demonstrates the operation and performance of an algorithm for segmenting connected points into a combination of representations such as lines, circular, elliptical and superelliptical arcs, and polynomials. The algorithm has a number of interesting properties including being scale invariant, nonparametric, general purpose, and efficient.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Robust Regression and Outlier Detection
Rousseeuw, P. J., & Leroy, A. M. (1987) · Wiley Series in Probability and Statistics · doi:10.1002/0471725382 · Cited by 5,609
Fitting conic sections to "very scattered" data: An iterative refinement of the bookstein algorithm
Sampson, P. D. (1982) · Computer Graphics and Image Processing · doi:10.1016/0146-664x(82)90101-0 · Cited by 358
Cited by
Direct least square fitting of ellipses
Fitzgibbon, A., Pilu, M., & Fisher, R. B. (1999) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.765658 · Cited by 2,752
Smallest enclosing disks (balls and ellipsoids)
Welzl, E. (2006) · Lecture Notes in Computer Science · doi:10.1007/bfb0038202 · Cited by 791
Techniques for assessing polygonal approximations of curves
Rosin, P. L. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.601253 · Cited by 262
Self-citationSteger, C. (2017) · Handbook of Machine and Computer Vision · doi:10.1002/9783527413409.ch9 · Cited by 6
Metadata
- Authors
- Rosin, P. L., & West, G. A. W.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1995
- Volume
- 17
- Issue
- 12
- Pages
- 1140-1153
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2151984205
- Cited by
- 205
- References
- 2
- FWCI
- 7.21
- Type
- journal article
- Language
- en
- Open access
- closed
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.