Applying graphics hardware to achieve extremely fast geometric pattern matching in two and three dimensional transformation space

Authors:
Dror Aiger;Klara Kedem
Affiliations:
Department of Computer Science, Ben Gurion University, Be'er Sheva, Israel and Orbotech LTD, Yavne, Israel;Department of Computer Science, Ben Gurion University, Be'er Sheva, Israel
Venue:
Information Processing Letters
Year:
2008

Citing 6
Cited 0

Model-based image matching using location

Model-based image matching using location
Computing the minimum Hausdorff distance for point sets under translation

SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Getting around a lower bound for the minimum Hausdorff distance

Computational Geometry: Theory and Applications
Fast and simple 2D geometric proximity queries using graphics hardware

I3D '01 Proceedings of the 2001 symposium on Interactive 3D graphics
A Graphics Hardware Implementation of the Generalized Hough Transform for fast Object Recognition, Scale, and 3D Pose Detection

ICIAP '03 Proceedings of the 12th International Conference on Image Analysis and Processing
Combinatorial and Experimental Methods for Approximate Point Pattern Matching

Algorithmica

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present a GPU-based approach to geometric pattern matching. We reduce this problem to finding the depth (maximally covered point) of an arrangement of polytopes in transformation space and describe hardware assisted (GPU) algorithms which exploit the available set of graphics operations to perform a fast rasterized depth computation. We give two alternatives, one is for translation + scale and the other is for rigid transformations, both have 3-parameters transformation space. We give extensive experimental results showing the running time of our method and its dependence on various parameters.