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.
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
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
Shape descriptors for non-rigid shapes with a single closed contour
Latecki, L. J., Lakamper, R., & Eckhardt, T. (2002) · Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662) · doi:10.1109/cvpr.2000.855850 · Cited by 833
Satisfying general proximity / similarity queries with metric trees
Uhlmann, J. K. (1991) · Information Processing Letters · doi:10.1016/0020-0190(91)90074-r · Cited by 690
Near Neighbor Search in Large Metric Spaces
Brin, S. (1995) · Cited by 556
HYPER: A New Approach for the Recognition and Positioning of Two-Dimensional Objects
Ayache, N., & Faugeras, O. D. (1986) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1986.4767751 · Cited by 492
Computable Elastic Distances Between Shapes
Younes, L. (1998) · SIAM Journal on Applied Mathematics · doi:10.1137/s0036139995287685 · Cited by 349
Belongie, S., Malik, J., & Puzicha, J. (2002) · Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001 · doi:10.1109/iccv.2001.937552 · Cited by 346
Computation of normalized edit distance and applications
Marzal, A., & Vidal, E. (1993) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.232078 · Cited by 340
The softassign Procrustes matching algorithm
Rangarajan, A., Chui, H., & Bookstein, F. L. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-63046-5_3 · Cited by 282
Gdalyahu, Y., & Weinshall, D. (1999) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.817410 · Cited by 236
Belongie, & Malik (2000) · 2000 Proceedings Workshop on Content-based Access of Image and Video Libraries · doi:10.1109/ivl.2000.853834 · Cited by 232
Schwartz, J. T., & Sharir, M. (1987) · The International Journal of Robotics Research · doi:10.1177/027836498700600203 · Cited by 230
Determining the similarity of deformable shapes
Basri, R., Costa, L., Geiger, D., & Jacobs, D. (1998) · Vision Research · doi:10.1016/s0042-6989(98)00043-1 · Cited by 217
Classification with nonmetric distances: image retrieval and class representation
Jacobs, D. W., Weinshall, D., & Gdalyahu, Y. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.862197 · Cited by 210
Tracking points on deformable objects using curvature information
Cohen, I., Ayache, N., & Sulger, P. (1992) · Lecture Notes in Computer Science · doi:10.1007/3-540-55426-2_51 · Cited by 195
Cursive Script Recognition by Elastic Matching
Tappert, C. C. (1982) · IBM Journal of Research and Development · doi:10.1147/rd.266.0765 · Cited by 161
On a cyclic string-to-string correction problem
Maes, M. J. (1990) · Information Processing Letters · doi:10.1016/0020-0190(90)90109-b · Cited by 146
Shape-based nonrigid correspondence with application to heart motion analysis
Tagare, H. D. (1999) · IEEE Transactions on Medical Imaging · doi:10.1109/42.790457 · Cited by 85
Learning visual models from shape contours using multiscale convex/concave structure matching
Ueda, N., & Suzuki, S. (1993) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.206954 · Cited by 78
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
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.