关键词: Freeman链码, 差别累加值, 链码差, 曲线匹配

Abstract: According to the shortage of common curve matching algorithms which can’t process rotation and scaling, a curve matching method of Freeman Chain Code（FCC） is proposed. An inflection point detection algorithm based on the accumulative of FCC and chain code difference is designed. Calculating the start point and the direction of the curves, the inflection point sequence which doesn’t change with rotation and scaling is obtained. The curves are matched by the length and the angle of the inflection point sequence. This method isn’t suffered with rotation and scaling, it has small computation and is easy to realize. The simulation experimental results show that the algorithm is effective and reasonable.

Key words: Freeman chain code, accumulative of difference, chain code difference, curve matching