| Popis: |
This paper discusses the regular longitudinalcutting torn scraps of paper splicing. The degree of similarity of two scraps is acquired according to their pixel characteristics. Then this splicing problem can be converted into TSP problem and the Optimization Model can be established. After the leftist torn scrap of paper been found, the remaining paper can be attached one by one according to the pixel characteristics. Finally, the best algorithm of single page Stitching recovery is given by this paper. |
