A quick algorithm for planar fragmented objects stitching base on KMP algorithm

This paper mainly describes a quick algorithm for planar fragmented objects based on KMP algorithm. Firstly we have Two-value processing on planar fragmented objects´ image. Secondly through tracking technique of boundary chain code, we can acquire the information of planar fragmented objects´ Contours of Images, and put the Contours in Noise Processing. On base of above, a new stitching algorithm is proposed based on the representation, transforming the problem in two circle arrays matching which is easily to process. At last, we make use of KMP algorithm to optimize the matching problem for implementing the planar fragmented objects quick stitching.