Elsevier

Pattern Recognition

Volume 27, Issue 2, February 1994, Pages 247-260
Pattern Recognition

A method for representing shape based on an equivalence relation on polygons

https://doi.org/10.1016/0031-3203(94)90057-4Get rights and content

Abstract

It is proved that there is a correspondence between deformations of polygons and a grammar. This gives rise to an O(n logn) algorithm to match regions whose connectivity has been changed, based on boundary contours. This has application to problems in handwriting recognition. It is then shown that deformations of polygons can be decomposed into canonical types. This gives rise to new types of features, to measure symmetry, handedness, rigidity, bending and stretching.

References (27)

  • W.H Tsai et al.

    Attributed string matching with merging for shape recognition

    IEEE Trans. Pattern Analysis Mach. Intell. PAMI-7

    (1985)
  • T.I Fan

    Optimal matching of deformed patterns with positional influence

    Inf. Sci.

    (1987)
  • K Deguchi et al.

    Regularized polygonal approximation for analysis and interpretation of planar contour figures

  • Cited by (0)

    View full text