Geometric Hashing

• Canonical “basis”

  • 2D affine basis = 3 “interest points”
  • 3D rigid motion: 3 points

• Properties

  + Deals with occlusion
  
  + Highly parallel
  • Large table (memory requirements) O(mn4)

Previous slide

Back to first slide

View graphic version