双向切割单 双面英文碎纸片拼接复原算法设计.pdfVIP

Advances in Applied Mathematics 应用数学进展, 2016, 5(2), 159-165 Published Online May 2016 in Hans. /journal/aam /10.12677/aam.2016.52021 Algorithm Design of Restoring Two-Way Single/Double-Sized Shredded Documents Chen Zhang, Shiyun Wang Science Department, Shenyang Aerospace University, Shenyang Liaoning th nd th Received: Apr. 14 , 2016; accepted: May 2 , 2016; published: May 5 , 2016 Copyright © 2016 by authors and Hans Publishers Inc. This work is licensed under the Creative Commons Attribution International License (CC BY). /licenses/by/4.0/ Abstract This paper designs an algorithm to restore English shredded documents no matter they are single- sized or double-sized text files which are cut both vertically and horizontally. Firstly, we cluster the fragments which were located in the same line in original text files according to the structural features of English letters and the row spacing. Then, using l1 norm difference model, we attach the fragments in the same class. By this way, the scraps of paper in the same line can be restored as a whole crosscutting shredded document. Finally, we should splice the crosscutting shredded doc- uments into a complete image. In the numerical test part, taking the 2013 national mathematics model contest problem as examples, our algorithm restores 209 pieces of English shredded doc- uments. Numerical results show that the correct rate of clustering is over 93% which demon- strates the efficiency of the algorithm. Keywords Peak Weight, Row Spacing Weight, Clustering Credibility, Jffreys Matusita Distance, l1 Norm 双向切割单/双面英文碎纸片拼接复原算法设计 张 晨，王诗云 沈阳航空航天大学理学院，辽宁 沈阳 收稿日期：2016年4月14 日；录用日期：2016年5月2 日；发布日期：2016年5月5 日 文章引用: 张晨