Research On The Planar Fragments Matching

The research of the planar fragments matching is vary important on theoretical and practical significance and has become a very important research topic in pattern recognition, computer vision and other fields. In this paper, on the basis of learning previous theoretical results, the whole process from data acquisition, edge detection, feature analysis, matching to the last splicing are summarized, and some new ideas and algorithms are put forward or improved by use of the knowledge in the fields of digital image processing, graphics, differential study and pattern recognition. The research work mainly includes the following four aspects.1. The methods of the digitization of fragments, pre-processing and edge detection are introduced. The problem of double edges of the planar imager due to the thickness of fragments is discovered, and the differences between the ideal fragments model and the actual fragments model are added. The continuous, closed and zero-width attributes of detected edges are cleared and be used to determine the merits and demerits of the detected edges. In addition, the edge tracking algorithm is improved.2. At the feature analysis and extraction of the edge curve, in view of the computational complexity of discrete points of curvature and the existence of the problem of low accuracy, this paper analyzes a variety of corner detection methods, and presents the new multi-scale corner detection method based on the discontinuity of changes of slope, also presents a new method of feature analysis which vector module is used as the feature invariant of the edge curve.3. According to the invariance of vector module in coordinate transformation, a new matching algorithm based on matrix of module value is presented. The idea of the problem of the longest common sub-sequence and its algorithm based on dynamic programming are applied to the curve matching problem based on the variation of slope.4. On the basis of analyzing the methods of splicing two fragments depending on translation and rotation, this paper gives a new implicit rotating translational splicing methods, applies the idea of breadth-first and depth-first to the splicing problem in many fragments, and presents two splicing strategies on many fragments which are the breadth-first one and the depth-first one.