The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
On aligning curves
Abstract
We present a novel approach to finding a correspondence (alignment) between two curves. The correspondence is based on a notion of an alignment curve which treats both curves symmetrically. We then define a similarity metric based on the alignment curve using two intrinsic properties of the curve, namely, length and curvature. The optimal correspondence is found by an efficient dynamic-programming method both for aligning pairs of curve segments and pairs of closed curves, and is effective in the presence of a variety of transformations of the curve. Finally, the correspondence is shown in application to handwritten character recognition, prototype formation, and object recognition, and is potentially useful in other applications such as registration and tracking.
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
A method for registration of 3-D shapes
Besl, P. J., & McKay, N. D. (1992) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.121791 · Cited by 18,103
Kass, M., Witkin, A., & Terzopoulos, D. (1988) · International Journal of Computer Vision · doi:10.1007/bf00133570 · Cited by 17,070
Visual pattern recognition by moment invariants
Hu, M.-K. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057692 · Cited by 7,546
Tversky, A. (1977) · Psychological Review · doi:10.1037/0033-295x.84.4.327 · Cited by 7,414
Dynamic Programming Algorithm Optimization for Spoken Word Recognition
Sakoe, H., & Chiba, S. (1978) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1978.1163055 · Cited by 6,727
Least-Squares Fitting of Two 3-D Point Sets
Arun, K. S., Huang, T. S., & Blostein, S. D. (1987) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1987.4767965 · Cited by 3,952
The String-to-String Correction Problem
Wagner, R. A., & Fischer, M. J. (1974) · Journal of the ACM · doi:10.1145/321796.321811 · Cited by 3,032
Freimer, M., Bellman, R. E., & Dreyfus, S. E. (1964) · Journal of the American Statistical Association · doi:10.2307/2282884 · Cited by 2,153
Bellman, R. E., & Dreyfus, S. E. (1962) · Princeton University Press eBooks · doi:10.1515/9781400874651 · Cited by 1,971
(1993) · doi:10.5555/313559.313789 · Cited by 998
Cited by
Shape Classification Using the Inner-Distance
Ling, H., & Jacobs, D. W. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.41 · Cited by 1,069
Esling, P., & Agon, C. (2012) · ACM Computing Surveys · doi:10.1145/2379776.2379788 · Cited by 997
Recognition of shapes by editing their shock graphs
Sebastian, T. B., Klein, P. N., & Kimia, B. B. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1273924 · Cited by 727
Self-citationShape Analysis of Elastic Curves in Euclidean Spaces
Srivastava, A., Klassen, E., Joshi, S. H., & Jermyn, I. H. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.184 · Cited by 638
Analysis of planar shapes using geodesic paths on shape spaces
Klassen, E., Srivastava, A., Mio, W., & Joshi, S. H. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1262333 · Cited by 479
Design and perceptual validation of performance measures for salient object segmentation
Movahedi, V., & Elder, J. H. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Workshops · doi:10.1109/cvprw.2010.5543739 · Cited by 469
An Efficient Earth Mover's Distance Algorithm for Robust Histogram Comparison
Ling, H., & Okada, K. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1058 · Cited by 414
Path Similarity Skeleton Graph Matching
Bai, X., & Latecki, L. J. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.70769 · Cited by 343
Robust point matching for nonrigid shapes by preserving local neighborhood structures
Zheng, Y., & Doermann, D. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.81 · Cited by 296
Learning Context-Sensitive Shape Similarity by Graph Transduction
Bai, X., Yang, X., Latecki, L. J., Liu, W., & Tu, Z. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.85 · Cited by 280
Shape retrieval using triangle-area representation and dynamic space warping
Alajlan, N., El Rube, I., Kamel, M. S., & Freeman, G. (2007) · Pattern Recognition · doi:10.1016/j.patcog.2006.12.005 · Cited by 279
Combining white matter diffusion and geometry for tract-specific alignment and variability analysis
Benou, I., Veksler, R., Friedman, A., & Raviv, T. R. (2019) · NeuroImage · doi:10.1016/j.neuroimage.2019.05.003 · Cited by 12
Metadata
- Authors
- Sebastian, T. B., Klein, P. N., & Kimia, B. B.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2003-01
- Volume
- 25
- Issue
- 1
- Pages
- 116-125
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2131529365
- Cited by
- 374
- References
- 28
- FWCI
- 25.86
- 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.