Abstract:

In order to calculate contour similarity with high speed and less data transfer in network application,this paper proposes a fast non-discrete algorithm in which lines and arcs are used to represent a contour.During the investigation,the image is normalized first,and the contour to be matched is then rotated continuously with a fixed step length.The contour to be matched and the target contour are respectively set as the template in turn to calculate the average square distance between the ve~exes of the template and the expected ve~exes of the matched contour.Finally,the minimum sum of the average square distances in all rotation angles is defined as the matching degree of the two contours.This algorithm can be used for both the convex and the concave contours.As compared with the traditional discrete algorithms,the proposed algorithm is of less data transfer,but of higher calculation speed and good identification and matching accuracy.

Key words: stamped pans, contour similarity, contour matching, case-based reasoning