Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Geometric_hashing> ?p ?o. }
Showing items 1 to 31 of
31
with 100 items per page.
- Geometric_hashing abstract "In computer science, geometric hashing is originally a method for efficiently finding two-dimensional objects represented by discrete points that have undergone an affine transformation (example below is based on similarity transformation), though extensions exist to some other object representations and transformations. In an off-line step, the objects are encoded by treating each pairs 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.[citation needed]".
- Geometric_hashing wikiPageExternalLink wr-ghao-97.pdf.
- Geometric_hashing wikiPageID "474939".
- Geometric_hashing wikiPageRevisionID "604717951".
- Geometric_hashing hasPhotoCollection Geometric_hashing.
- Geometric_hashing subject Category:Computer_vision.
- Geometric_hashing subject Category:Geometric_data_structures.
- Geometric_hashing subject Category:Search_algorithms.
- Geometric_hashing type Abstraction100002137.
- Geometric_hashing type Act100030358.
- Geometric_hashing type Activity100407535.
- Geometric_hashing type Algorithm105847438.
- Geometric_hashing type Arrangement105726596.
- Geometric_hashing type Cognition100023271.
- Geometric_hashing type DataStructure105728493.
- Geometric_hashing type Event100029378.
- Geometric_hashing type GeometricDataStructures.
- Geometric_hashing type Procedure101023820.
- Geometric_hashing type PsychologicalFeature100023100.
- Geometric_hashing type Rule105846932.
- Geometric_hashing type SearchAlgorithms.
- Geometric_hashing type Structure105726345.
- Geometric_hashing type YagoPermanentlyLocatedEntity.
- Geometric_hashing comment "In computer science, geometric hashing is originally a method for efficiently finding two-dimensional objects represented by discrete points that have undergone an affine transformation (example below is based on similarity transformation), though extensions exist to some other object representations and transformations. In an off-line step, the objects are encoded by treating each pairs of points as a geometric basis.".
- Geometric_hashing label "Geometric hashing".
- Geometric_hashing sameAs m.02dz6c.
- Geometric_hashing sameAs Q5535489.
- Geometric_hashing sameAs Q5535489.
- Geometric_hashing sameAs Geometric_hashing.
- Geometric_hashing wasDerivedFrom Geometric_hashing?oldid=604717951.
- Geometric_hashing isPrimaryTopicOf Geometric_hashing.