Skip to main content
Springer Nature Link
Log in

Shape Matching by Random Sampling

  • Conference paper
WALCOM: Algorithms and Computation (WALCOM 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5431))

Included in the following conference series:

  • 935 Accesses

Abstract

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.

This research was supported by the European Union under contract No. IST-511572-2, Project PROFI, and by the Priority Programme 1307 “Algorithm Engineering” of Deutsche Forschungsgemeinschaft (DFG).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Aguado, A.S., Montiel, E., Nixon, M.S.: Invariant characterisation of the Hough transform for pose estimation of arbitrary shapes. Pattern Recognition 35, 1083–1097 (2002)

    Article  MATH  Google Scholar 

  2. Alt, H., Behrends, B., Blömer, J.: Approximate matching of polygonal shapes. Annals of Mathematics and Artificial Intelligence 13, 251–265 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  3. Alt, H., Godau, M.: Computing the Fréchet distance between two polygonal curves. Internat. J. Comput. Geom. Appl. 5, 75–91 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  4. Alt, H., Guibas, L.J.: Discrete geometric shapes: Matching, interpolation, and approximation. In: Handbook of computational geometry. Elsevier, Amsterdam (1999)

    Google Scholar 

  5. Alt, H., Rote, G., Wenk, C., Efrat, A.: Matching planar maps. J. of Algorithms, 262–283 (2003)

    Google Scholar 

  6. Alt, H., Scharf, L., Scholz, S.: Probabilistic matching and resemblance evaluation of shapes in trademark images. In: Proc. of the 6th ACM International Conference on Image and Video Retrieval, pp. 533–540 (2007)

    Google Scholar 

  7. Arkin, E.M., Chew, L.P., Huttenlocher, D.P., Kedem, K., Mitchell, J.S.B.: An efficiently computable metric for comparing polygonal shapes. IEEE Trans. Pattern Anal. Mach. Intell. 13(3), 209–216 (1991)

    Article  MATH  Google Scholar 

  8. Aronov, B., Har-Peled, S.: On approximating the depth and related problems. In: Proc. 16th ACM-SIAM Symposium on Discrete Algorithms, pp. 886–894 (2005)

    Google Scholar 

  9. Basu, S., Pollack, R., Roy, M.-F.: Computing roadmaps of semi-algebraic sets. In: Proc. 28th ACM Symposium on Theory of Computing, pp. 168–173 (1996)

    Google Scholar 

  10. Cheong, O., Efrat, A., Har-Peled, S.: On finding a guard that sees most and a shop that sells most. In: Proc. 15th ACM-SIAM Symposium on Discrete Algorithms, pp. 1091–1100 (2004)

    Google Scholar 

  11. Edelsbrunner, H., O’Rourke, J., Seidel, R.: Constructing arrangements of lines and hyperplanes with applications. SIAM J. Comput. 15(2), 341–363 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  12. Efrat, A., Fan, Q., Venkatasubramanian, S.: Curve Matching, Time Warping, and Light Fields: New Algorithms for Computing Similarity between Curves. J. Math. Imaging Vis. 27(3), 203–216 (2007)

    Article  MathSciNet  Google Scholar 

  13. Fischler, M.A., Bolles, R.C.: Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Commun. ACM 24(6), 381–395 (1981)

    Article  MathSciNet  Google Scholar 

  14. Hagedoorn, M., Overmars, M., Veltkamp, R.: A new visibility partition for affine pattern matching. In: Nyström, I., Sanniti di Baja, G., Borgefors, G. (eds.) DGCI 2000. LNCS, vol. 1953, pp. 358–370. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  15. Latecki, L.J., Veltkamp, R.C.: Properties and performances of shape similarity measures. In: Proc. of Int. Conf. on Data Science and Classification (2006)

    Google Scholar 

  16. Mitra, N.J., Guibas, L.J., Pauly, M.: Partial and approximate symmetry detection for 3d geometry. ACM Trans. Graph. 25(3), 560–568 (2006)

    Article  Google Scholar 

  17. Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)

    Book  MATH  Google Scholar 

  18. Stockman, G.: Object recognition and localization via pose clustering. Computer Vision, Graphics, and Image Processing 40, 361–387 (1987)

    Article  Google Scholar 

  19. Tanase, M., Veltkamp, R.C., Haverkort, H.: Multiple polyline to polygon matching. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 60–70. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  20. Toft, P.: The Radon Transform - Theory and Implementation. PhD thesis, Department of Mathematical Modelling, Technical University of Denmark (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Freie Universität Berlin, Germany

    Helmut Alt & Ludmila Scharf

Authors
  1. Helmut Alt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ludmila Scharf
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Indian Statistical Institute, 700 108, Kolkata, India

    Sandip Das

  2. Japan Advanced Institute of Science and Technology, 923-1292, Ishikawa, Japan

    Ryuhei Uehara

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alt, H., Scharf, L. (2009). Shape Matching by Random Sampling . In: Das, S., Uehara, R. (eds) WALCOM: Algorithms and Computation. WALCOM 2009. Lecture Notes in Computer Science, vol 5431. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00202-1_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00202-1_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00201-4

  • Online ISBN: 978-3-642-00202-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics