Metraipolis › archive › dc_44e07595bbea

Geometric hashing — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Geometric_hashing
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-06T16:44:47.649Z
SHA-256 of the archived text
72df75b0eb99163a2f596d60dbc64f531c0a96f954dd26058b834956910949de
Stable URL of this page
https://metraipolis.com/documento/dc_44e07595bbea

How to cite

Geometric hashing — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Geometric_hashing (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_44e07595bbea (Metraipolis archive dc_44e07595bbea, sha256 72df75b0eb99163a2f596d60dbc64f531c0a96f954dd26058b834956910949de)
BibTeX
@misc{dc44e07595bbea,
  title = {Geometric hashing — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Geometric_hashing},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_44e07595bbea; sha256 72df75b0eb99163a2f596d60dbc64f531c0a96f954dd26058b834956910949de},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Geometric_hashing. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In computer science, geometric hashing is a method for efficiently finding two-dimensional objects represented by discrete points that have undergone an affine transformation, though extensions exist to other object representations and transformations. In an off-line step, the objects are encoded by treating each pair of points as a geometric basis. The remaining points can be represented in an invariant fashion with respect to this basis using two parameters. For each point, its quantized transformed coordinates are stored in the hash table as a key, and indices of the basis points as a value. Then a new pair of basis points is selected, and the process is repeated. In the on-line (recognition) step, randomly selected pairs of data points are considered as candidate bases. For each candidate basis, the remaining data points are encoded according to the basis and possible correspondences from the object are found in the previously constructed table. The candidate basis is accepted if a sufficiently large number of the data points index a consistent object basis. Geometric hashing was originally suggested in computer vision for object recognition in 2D and 3D, but later was applied to different problems such as structural alignment of proteins.

Tema degli esploratori: statistica e scienza dei dati (deposito sistematico; categoria «Computer vision»).
Fonte: Wikipedia in inglese, voce «Geometric hashing» — https://en.wikipedia.org/wiki/Geometric_hashing
Wikidata Q5535489 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q5535489
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Geometric_hashing?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1354406568, consultata il 2026-10-06T15:18:49.060Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 984bc24ca8e5b5b87391616ebb10a3687b8e0d95310a707c9852205ace7c646f