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

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.

[1]  Pavel Valtr.  Lines, line-point incidences and crossing families in dense sets , 1996, Comb..

[2]  Klara Kedem,et al.  Getting around a lower bound for the minimum Hausdorff distance , 1998, Comput. Geom..

[3]  Dinesh Manocha,et al.  Fast and simple 2D geometric proximity queries using graphics hardware , 2001, I3D '01.

[4]  Cass W. Everitt,et al.  Interactive Order-Independent Transparency , 2001 .

[5]  Dror Aiger,et al.  Exact and Approximate Geometric Pattern Matching for Point Sets in the Plane under Similarity Transformations , 2007, CCCG.

[6]  Marcus A. Magnor,et al.  A graphics hardware implementation of the generalized Hough transform for fast object recognition, scale, and 3D pose detection , 2003, 12th International Conference on Image Analysis and Processing, 2003.Proceedings..

[7]  Piotr Indyk,et al.  Combinatorial and Experimental Methods for Approximate Point Pattern Matching , 2003, Algorithmica.

[8]  Micha Sharir,et al.  The upper envelope of voronoi surfaces and its applications , 1991, SCG '91.

[9]  Nabil H. Mustafa,et al.  Streaming Geometric Optimization Using Graphics Hardware , 2003, ESA.

[10]  Oswin Aichholzer,et al.  23rd European Workshop on Computational Geometry - Collection of Abstracts , 2007 .

[11]  Daniel P. Huttenlocher,et al.  Computing the minimum Hausdorff distance for point sets under translation , 1990, SCG '90.

[12]  P. Erdös.  On Sets of Distances of n Points , 1946 .

[13]  Jens H. Krüger,et al.  A Survey of General‐Purpose Computation on Graphics Hardware , 2007, Eurographics.

[14]  H. Baird.  Model-Based Image Matching Using Location , 1985 .