摘要
本文通过使用Euclidean距离来衡量两张碎纸片之间的相似程度来实现碎纸片的拼接还原问题。首先使用贪心模型和TSP模型来分别完成仅纵切的碎纸片的还原问题并相互印证结果。然后又推广使用了TSP模型并完成了同时纵切和横切的碎纸片拼接复原。
In this paper, by using the Euclidean distance to measure the similarity between the two pieces of scraps of paper to realize mosaic scraps of paper reduction problem. First use the reduction problem greedy model and TSP model respectively complete the scraps of paper only longitudinal and corroborated the results. Then use the TSP model and finished at the same time scraps of paper splicing longitudinal and transverse restoration
出处
《电子测试》
2014年第4期46-48,共3页
Electronic Test
