Matching Algorithm of Two-dimensional Irregular Fragments

Yi Liu · Jisuanji gongcheng · 2007

This paper proposes an approach to the problem of object reconstruction from broken fragments of two-dimensional objects.Feature points on the contour are detected based on the curvature of every point.The feature point and its neighborhood points constitute a feature segment.Thus the contour matching task is reduced into similarity measure and feasibility verification of feature segments.The matchable contours are rotated and translated to fulfill fragments reassembly.Then the detection is carried out automatically,for checking whether there are overlaps between the two contours under this transformation.The contours without overlap are formed to a new contour,and the matching process is continued until the reconstruction is fulfilled.The experimental results demonstrate the algorithm is efficient and robust.

Read the paper · More papers on PaperTik