Scale-Based Description and Recognition of Planar Curves and Two-Dimensional Shapes
The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Abstract
The problem of finding a description, at varying levels of detail, for planar curves and matching two such descriptions is posed and solved in this paper. A number of necessary criteria are imposed on any candidate solution method. Path-based Gaussian smoothing techniques are applied to the curve to find zeros of curvature at varying levels of detail. The result is the ``generalized scale space'' image of a planar curve which is invariant under rotation, uniform scaling and translation of the curve. These properties make the scale space image suitable for matching. The matching algorithm is a modification of the uniform cost algorithm and finds the lowest cost match of contours in the scale space images. It is argued that this is preferable to matching in a so-called stable scale of the curve because no such scale may exist for a given curve. This technique is applied to register a Landsat satellite image of the Strait of Georgia, B.C. (manually corrected for skew) to a map containing the shorelines of an overlapping area.
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
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Use of the hough transformation to detect lines and curves in pictures
Duda, R. O., & Hart, P. E. (1972) · Communications of the ACM · doi:10.1145/361237.361242 · Cited by 6,633
Marr, D., & Hildreth, E. (1980) · Proceedings of the Royal Society of London. Series B. Biological Sciences · doi:10.1098/rspb.1980.0020 · Cited by 6,510
Ballard, D. H., & Brown, C. M. (1982) · Cited by 5,303
Generalizing the Hough transform to detect arbitrary shapes
Ballard, D. H. (1981) · Pattern Recognition · doi:10.1016/0031-3203(81)90009-1 · Cited by 4,371
Pattern classification and scene analysis
Chien, Y. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100577 · Cited by 3,398
Ondracek, G. (1972) · Journal of Nuclear Materials · doi:10.1016/0022-3115(72)90033-5 · Cited by 2,641
Witkin, A. P. (1987) · Readings in Computer Vision · doi:10.1016/b978-0-08-051581-6.50036-2 · Cited by 2,359
Problem-Solving Methods in Artificial Intelligence
Nilsson, N. J. (1971) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,607
Computer Processing of Line-Drawing Images
Freeman, H. (1974) · ACM Computing Surveys · doi:10.1145/356625.356627 · Cited by 1,368
Scale-space filtering: A new approach to multi-scale description
Witkin, A. (2005) · ICASSP '84. IEEE International Conference on Acoustics, Speech, and Signal Processing · doi:10.1109/icassp.1984.1172729 · Cited by 1,086
Structural Pattern Recognition
Pavlidis, T. (1977) · Springer eBooks · doi:10.1007/978-3-642-88304-0 · Cited by 1,055
Principles of Artificial Intelligence
(1981) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1981.4767059 · Cited by 847
Asada, H., & Brady, M. (1986) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1986.4767747 · Cited by 702
Understanding Shape: Angles and Sides
Davis (1977) · IEEE Transactions on Computers · doi:10.1109/tc.1977.1674812 · Cited by 135
Fingerprints theorems for zero crossings
Yuille, A., & Poggio, T. (1985) · Journal of the Optical Society of America A · doi:10.1364/josaa.2.000683 · Cited by 99
Cited by
Review of shape representation and description techniques
Zhang, D., & Lu, G. (2004) · Pattern Recognition · doi:10.1016/j.patcog.2003.07.008 · Cited by 1,867
Evaluation of Interest Point Detectors
Schmid, C., Mohr, R., & Bauckhage, C. (2000) · International Journal of Computer Vision · doi:10.1023/a:1008199403446 · Cited by 1,484
Local Invariant Feature Detectors: A Survey
Tuytelaars, T., & Mikolajczyk, K. (2007) · Foundations and Trends® in Computer Graphics and Vision · doi:10.1561/0600000017 · Cited by 1,186
Axioms and fundamental equations of image processing
Alvarez, L., Guichard, F., Lions, P. L., & Morel, J. M. (1993) · Archive for Rational Mechanics and Analysis · doi:10.1007/bf00375127 · Cited by 994
A survey of shape analysis techniques
Loncaric, S. (1998) · Pattern Recognition · doi:10.1016/s0031-2023(97)00122-2 · Cited by 950
Metadata
- Authors
- Mokhtarian, F., & Mackworth, A.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1986-01
- Volume
- PAMI-8
- Issue
- 1
- Pages
- 34-43
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2052277674
- Cited by
- 844
- References
- 16
- FWCI
- 21.82
- 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.