Shape matching by random sampling

In order to determine the similarity between two planar shapes, which is an important problem in computer vision and pattern recognition, it is necessary to first match the two shapes as good as possible. As sets of allowed transformation to match shapes we consider translations, rigid motions, and similarities. We present a generic probabilistic algorithm based on random sampling for matching shapes which are modelled by sets of curves. The algorithm is applicable to the three considered classes of transformations. We analyze which similarity measure is optimized by the algorithm and give rigorous bounds on the number of samples necessary to get a prespecified approximation to the optimal match within a prespecified probability.

[1]  P. Toft.  The Radon Transform - Theory and Implementation , 1996 .

[2]  Robert C. Bolles,et al.  Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography , 1981, CACM.

[3]  George C. Stockman,et al.  Object recognition and localization via pose clustering , 1987, Comput. Vis. Graph. Image Process..

[4]  Esther M. Arkin,et al.  An efficiently computable metric for comparing polygonal shapes , 1991, SODA '90.

[5]  Edwin R. Hancock,et al.  Pose clustering with density estimation and structural constraints , 1999, Proceedings. 1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No PR00149).

[6]  Leonidas J. Guibas,et al.  Discrete Geometric Shapes: Matching, Interpolation, and Approximation , 2000, Handbook of Computational Geometry.

[7]  Raimund Seidel,et al.  Constructing arrangements of lines and hyperplanes with applications , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[8]  Remco C. Veltkamp,et al.  Multiple Polyline to Polygon Matching , 2005, ISAAC.

[9]  Helmut Alt,et al.  Approximate matching of polygonal shapes , 1995, SCG '91.

[10]  Mark S. Nixon,et al.  Invariant characterisation of the Hough transform for pose estimation of arbitrary shapes , 2002, Pattern Recognit..

[11]  Remco C. Veltkamp,et al.  State of the Art in Shape Matching , 2001, Principles of Visual Information Retrieval.

[12]  Haim J. Wolfson,et al.  Geometric hashing: an overview , 1997 .

[13]  Cris L. Luengo Hendriks,et al.  The generalized Radon transform: Sampling, accuracy and memory considerations , 2004, Pattern Recognit..

[14]  Remco C. Veltkamp,et al.  Shape matching: similarity measures and algorithms , 2001, Proceedings International Conference on Shape Modeling and Applications.

[15]  Clark F. Olson,et al.  Efficient Pose Clustering Using a Randomized Algorithm , 1997, International Journal of Computer Vision.

[16]  Harald Niederreiter,et al.  Probability and computing: randomized algorithms and probabilistic analysis , 2006, Math. Comput..

[17]  Helmut Alt,et al.  Probabilistic matching and resemblance evaluation of shapes in trademark images , 2007, CIVR '07.

[18]  Günter Rote,et al.  Matching planar maps , 2003, SODA '03.

[19]  Helmut Alt,et al.  Computing the Fréchet distance between two polygonal curves , 1995, Int. J. Comput. Geom. Appl..

[20]  Otfried Cheong,et al.  Finding a Guard that Sees Most and a Shop that Sells Most , 2004, SODA '04.

[21]  Remco C. Veltkamp,et al.  A New Visibility Partition for Affine Pattern Matching , 2000, DGCI.

[22]  Boris Aronov,et al.  On approximating the depth and related problems , 2005, SODA '05.

[23]  Remco C. Veltkamp,et al.  Properties and Performance of Shape Similarity Measures , 2006, Data Science and Classification.

[24]  Suresh Venkatasubramanian,et al.  Curve Matching, Time Warping, and Light Fields: New Algorithms for Computing Similarity between Curves , 2007, Journal of Mathematical Imaging and Vision.

[25]  Saugata Basu,et al.  Computing roadmaps of semi-algebraic sets , 1996 .

[26]  Shimon Ullman,et al.  Recognizing solid objects by alignment with an image , 1990, International Journal of Computer Vision.

[27]  Marie-Françoise Roy,et al.  Computing roadmaps of semi-algebraic sets (extended abstract) , 1996, STOC '96.