The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Shape matching: similarity measures and algorithms
Open accessAbstract
Shape matching is an important ingredient in shape retrieval, recognition and classification, alignment and registration, and approximation and simplification. This paper treats various aspects that are needed to solve shape matching problems: choosing the precise problem, selecting the properties of the similarity measure that are needed for the problem, choosing the specific similarity measure, and constructing the algorithm to compute the similarity. The focus is on methods that lie close to the field of computational geometry.
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
Tversky, A. (1977) · Psychological Review · doi:10.1037/0033-295x.84.4.327 · Cited by 7,414
Ballard, D. H., & Brown, C. M. (1982) · Cited by 5,303
Comparing images using the Hausdorff distance
Huttenlocher, D. P., Klanderman, G. A., & Rucklidge, W. J. (1993) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.232073 · Cited by 4,545
Invariant image recognition by Zernike moments
Khotanzad, A., & Hong, Y. H. (1990) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.55109 · Cited by 1,914
A metric for distributions with applications to image databases
Rubner, Y., Tomasi, C., & Guibas, L. J. (2002) · Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271) · doi:10.1109/iccv.1998.710701 · Cited by 1,726
COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
ALT, H., & GODAU, M. (1995) · International Journal of Computational Geometry & Applications · doi:10.1142/s0218195995000064 · Cited by 1,039
A survey of shape analysis techniques
Loncaric, S. (1998) · Pattern Recognition · doi:10.1016/s0031-2023(97)00122-2 · Cited by 950
Geometric Hashing: A General And Efficient Model-based Recognition Scheme
Lamdan, Y., & Wolfson, H. J. (2005) · [1988 Proceedings] Second International Conference on Computer Vision · doi:10.1109/ccv.1988.589995 · Cited by 775
Fast multiresolution image querying
Jacobs, C. E., Finkelstein, A., & Salesin, D. H. (1995) · Proceedings of the 22nd annual conference on Computer graphics and interactive techniques - SIGGRAPH '95 · doi:10.1145/218380.218454 · Cited by 679
An efficiently computable metric for comparing polygonal shapes
Arkin, E. M., Chew, L. P., Huttenlocher, D. P., Kedem, K., & Mitchell, J. S. B. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.75509 · Cited by 628
Matching 3D models with shape distributions
Osada, R., Funkhouser, T., Chazelle, B., & Dobkin, D. (2002) · Proceedings International Conference on Shape Modeling and Applications · doi:10.1109/sma.2001.923386 · Cited by 591
Geometric hashing: an overview
Wolfson, H. J., & Rigoutsos, I. (1997) · IEEE Computational Science and Engineering · doi:10.1109/99.641604 · Cited by 557
Survey of Polygonal Surface Simplification Algorithms
Heckbert, P. S., & Garland, M. (1997) · Cited by 486
Modal matching for correspondence and recognition
Sclaroff, S., & Pentland, A. P. (1995) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.387502 · Cited by 458
High-Level Vision: Object Recognition and Visual Cognition
Ullman, S. (1996) · The MIT Press eBooks · doi:10.7551/mitpress/3496.001.0001 · Cited by 436
Efficient and Robust Retrieval by Shape Content through Curvature Scale Space
Mokhtarian, F., Abbasi, S., & Kittler, J. (1998) · Series on Software Engineering and Knowledge Engineering · doi:10.1142/9789812797988_0005 · Cited by 364
The Monge–Kantorovich Mass Transference Problem and Its Stochastic Applications
Rachev, S. T. (1985) · Theory of Probability and Its Applications · doi:10.1137/1129093 · Cited by 295
Point pattern matching by relaxation
Ranade, S., & Rosenfeld, A. (1980) · Pattern Recognition · doi:10.1016/0031-3203(80)90067-9 · Cited by 262
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
Object recognition and localization via pose clustering
Stockman, G. (1987) · Computer Vision, Graphics, and Image Processing · doi:10.1016/s0734-189x(87)80147-0 · Cited by 231
Relaxing the Triangle Inequality in Pattern Matching
Fagin, R., & Stockmeyer, L. J. (1998) · International Journal of Computer Vision · doi:10.1023/a:1008023416823 · Cited by 95
Huttenlocher, D. P., Kedem, K., & Kleinberg, J. M. (1992) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/142675.142700 · Cited by 92
Partial matching of planar polylines under similarity transformations
Cohen, S. D., & Guibas, L. J. (1997) · doi:10.5555/314161.314445 · Cited by 48
Cited by
Shilane, P., Min, P., Kazhdan, M., & Funkhouser, T. (2004) · Proceedings Shape Modeling Applications, 2004. · doi:10.1109/smi.2004.1314504 · Cited by 1,419
Funkhouser, T., Min, P., Kazhdan, M., Chen, J., Halderman, A., Dobkin, D., & Jacobs, D. (2003) · ACM Transactions on Graphics · doi:10.1145/588272.588279 · Cited by 935
Gromov–Wasserstein Distances and the Metric Approach to Object Matching
Mémoli, F. (2011) · Foundations of Computational Mathematics · doi:10.1007/s10208-011-9093-5 · Cited by 515
Content-based image retrieval in radiology: current status and future directions
Akgül, C. B., Rubin, D. L., Napel, S., Beaulieu, C. F., Greenspan, H., & Acar, B. (2011) · Journal of Digital Imaging · doi:10.1007/s10278-010-9290-9 · Cited by 388
Sketch-based modeling: A survey
Olsen, L., Samavati, F. F., Sousa, M. C., & Jorge, J. A. (2009) · Computers & Graphics · doi:10.1016/j.cag.2008.09.013 · Cited by 381
Metadata
- Authors
- Veltkamp, R. C.
- Venue
- Proceedings International Conference on Shape Modeling and Applications
- Publisher
- IEEE Computer Society
- Published
- 2002-11-13
- Pages
- 188-197
- OpenAlex
- W2113530345
- Cited by
- 434
- References
- 23
- FWCI
- 16.44
- Type
- conference paper
- Language
- en
- Open access
- green
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.