A New Fast Algorithm for Complex Polygons Matching

Shape matching is an important issue in pattern recognition, and polygon-based shape representation is a common method used in shape description. This paper presents a method for quick matching of complex polygons based on tangent space representation. The complex polygon is first evolved into a simplified one using discrete curve evolution, then is divided into a serial of maximum convex/concave arcs. The beginning point of each maximum convex arc is used as the reference point of matching. The experimental results justify that the shape matching method is efficient and is stable with respect to noise distortions.