The TSP Method in the Application of the Scraps of Paper Splicing

Abstract:

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.

• Periodical: Applied Mechanics and Materials (Volumes 513-517)
• Pages: 2668-2671
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.513-517.2668
• Online since: February 2014
• Authors: Xian Xian Chen, Xin Zhong Lu*
• Keywords: Optimization Model, Paper Splicing, TSP Method

References

[1] The introduction of TSPhttp: /rfptemplates. technologyevaluation. com.

[2] Zhicheng Fan. Study of evolutionary algorithms for TSP problem[J]. HunanNormal University, (2007).

[3] HelsgaunK. An effective implementation of the Lin-Kernigh: Lntraveling salesman heuristic. EuroPeanJournal of Operational Researeh, (2000).

[4] KechangYang. The case tutorial of computer algorithms and problem design[M]. Beijing: Tsinghua University Press, (2011).

[5] Problem B in CUMCM-2013 for college students (2013-09-13). http: /www. mcm. edu. cn/ problem/2013/2013. html.