The Auto Restoration of Paper Fragments Rules Based on the Traveling Salesman Model
The restoration of regular paper fragments can be solved just as the Traveling Salesman Problem. Paper pretreatment and edge matching are the main steps during the restoration process, which contain binarization, screening between the left and right boundary depending the width of paper margins. For some longer paper fragments, the transverse splicing can be realized with Greed Algorithm. But the algorithm will get a non-ideal restoration for more fine paper fragments. Therefore the noise-suppressed processing before clustering from line to line through projection is essential in order to make sure that the regular English fragments can get the regularity like Chinese characters. The two experiments get an 100% correct rates when using the method combining the improved genetic algorithm for traveling salesman problem.combining the improved genetic algorithm for traveling salesman problem.