The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Geometric hashing: an overview
Abstract
Geometric hashing, a technique originally developed in computer vision for matching geometric features against a database of such features, finds use in a number of other areas. Matching is possible even when the recognizable database objects have undergone transformations or when only partial information is present. The technique is highly efficient and of low polynomial complexity.
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
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
Self-citationInvariant descriptors for 3D object recognition and pose
Forsyth, D. A., Mundy, J. L., Zisserman, A., Coelho, C., Heller, A., & Rothwell, C. A. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.99233 · Cited by 400
Affine invariant model-based object recognition
Lamdan, Y., Schwartz, J. T., & Wolfson, H. J. (1990) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.62047 · Cited by 311
Self-citationNussinov, R., & Wolfson, H. J. (1991) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.88.23.10495 · Cited by 288
Self-citationObject recognition by affine invariant matching
Lamdan, Y., Schwartz, J. T., & Wolfson, H. J. (2003) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.1988.196257 · Cited by 275
Self-citationSchwartz, J. T., & Sharir, M. (1987) · The International Journal of Robotics Research · doi:10.1177/027836498700600203 · Cited by 230
A geometry-based suite of moleculardocking processes
Fischer, D., Lin, S. L., Wolfson, H. L., & Nussinov, R. (1995) · Journal of Molecular Biology · doi:10.1016/s0022-2836(95)80063-8 · Cited by 188
Self-citationTwo-Dimensional, Model-Based, Boundary Matching Using Footprints
Kalvin, A. D., Schonberg, E., Schwartz, J. T., & Sharir, M. (1986) · The International Journal of Robotics Research · doi:10.1177/027836498600500403 · Cited by 166
3D object recognition using invariant feature indexing of interpretation tables
Flynn, P. J., & Jain, A. K. (1992) · CVGIP Image Understanding · doi:10.1016/1049-9660(92)90012-r · Cited by 85
A Bayesian Approach to Model Matching with Geometric Hashing
Rigoutsos, I., & Hummel, R. A. (1995) · Computer Vision and Image Understanding · doi:10.1006/cviu.1995.1038 · Cited by 63
Self-citationSandak, B., Nussinov, R., & Wolfson, H. J. (1995) · Computer applications in the biosciences · doi:10.1093/bioinformatics/11.1.87 · Cited by 46
Self-citation3-D substructure matching in protein Molecules
Fischer, D., Nussinov, R., & Wolfson, H. J. (1992) · Lecture notes in computer science · doi:10.1007/3-540-56024-6_11 · Cited by 28
Self-citationGeneralizing the generalized hough transform
Wolfson, H. J. (1991) · Pattern Recognition Letters · doi:10.1016/0167-8655(91)90157-h · Cited by 26
Self-citation
Cited by
Content-based image retrieval at the end of the early years
Smeulders, A. W. M., Worring, M., Santini, S., Gupta, A., & Jain, R. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.895972 · Cited by 6,056
Image retrieval: Ideas, influences, and trends of the new age
Datta, R., Joshi, D., Li, J., & Wang, J. Z. (2008) · ACM Computing Surveys · doi:10.1145/1348246.1348248 · Cited by 3,040
ASTROMETRY.NET: BLIND ASTROMETRIC CALIBRATION OF ARBITRARY ASTRONOMICAL IMAGES
Lang, D., Hogg, D. W., Mierle, K., Blanton, M., & Roweis, S. (2010) · The Astronomical Journal · doi:10.1088/0004-6256/139/5/1782 · Cited by 1,062
Efficient Unbound Docking of Rigid Molecules
Duhovny, D., Nussinov, R., & Wolfson, H. J. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45784-4_14 · Cited by 711
Self-citation4-points congruent sets for robust pairwise surface registration
Aiger, D., Mitra, N. J., & Cohen-Or, D. (2008) · ACM Transactions on Graphics · doi:10.1145/1360612.1360684 · Cited by 677
Metadata
- Authors
- Wolfson, H. J., & Rigoutsos, I.
- Venue
- IEEE Computational Science and Engineering
- Published
- 1997
- Volume
- 4
- Issue
- 4
- Pages
- 10-21
- ISSN
- 1070-9924 (ISSN-L)
- OpenAlex
- W2144071905
- Cited by
- 557
- References
- 13
- FWCI
- 2.43
- 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.