Seo Won Chan

The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 4, No. 9, pp. 2412-2420, Sep. 1997
10.3745/KIPSTE.1997.4.9.2412,   PDF Download:

Abstract

An algorithm for detecting dominant points on a digital contour is proposed. The algorithm detects the dominant points from the given contour with the given number of points as a constraint condition, on the basis of the principle of the top-down approach. The dominant points are detected by minimizing the object function that presents the similarity between the given contour and the approximated polygon drawn by connecting the dominant points of candidate. The penalty multiplier method is applied to minimize the augmented Lagrangean function which is made by adding the penalty of the constraint condition to the object function. on the minimization, a local searching method by the partial problem division is considered, and it is clarified that the reasonable solution is obtained by the method. The proposed algorithm has a merit that the dominant points can be detected exactly and stably even for the digital contour composed of multiple-scale features and similar contours, because it detects them on considering the property of a whole figure of the given contour. It is confirmed that the proposed algorithm is more excellent than other previously proposed algorithms by the comparison and the evaluation through the experiment on using typical digital curves.

Statistics
Cite this article