Abstract: With the help of a computer to rejoin a large number of regular document image fragments,which can greatly improve the efficiency of work and reduce the labor costs.Therefore,it has been paid more and more attention by the academic community.At present,there are three main problems in the matching of English fragments with shape rules,one is the difficulty of fragment feature extraction,the other is the low efficiency of splicing,and the third is the low accuracy of splicing.For the first problem,a series of data statistics is adopted to eliminate the interference factors of the high and low English letters in this paper.For the second problem,ensuring that the number of each type of debris is the same,this paper establishes optimization model and uses Ant Colony algorithm to horizontal fast clustering.For the third problem,this paper sets up the distance function for two pieces by counting character pixel gray values of 8 neighborhoods,and then the ant colony algorithm is used for matching and accurate clustering.Finally,we take the 2013 National higher Education Cup mathematical modeling B as an example to verify the feasibility and effectiveness of the Ant Colony Algorithm.

Key words: Ant colony algorithm, Distance function, English fragments, Feature vector, Optimization model