2D Fragments Matching And Digitization

Reassembling unknowing broken objects from a large collection of irregular fragments arises in several contexts such as archaeology, failure analysis, paleontology, conservation(mural painting), and so on. It was impossible if there were no computers to assist in reassembling these tens of thousands of randomly shaped and featureless fragments. 2D fragment matching is deeply investigated in this thesis. In brief, the followings are the primary contents:Sample point data are obtained from fragment images. Sample point data are filtered and predigested. B-Spline curve fitting and curvature analysis are discussed in detail. Matching point sequences are obtained on the basis of curvature analysis by using the dynamic programming algorithm.This text draws lessons from further research according to many characteristics match very much the meaning.