关键词: 0 1规划, 规则图形碎片拼接, 匹配度, 遗传算法

Abstract:

By preprocessing the regular picture fragments,extracting the boundary pixel feature of picture fragments,setting reassembly target of the overall maximum compatibility,the regular picture fragments recuperative model is built based on 01 programming.Considering the complexity of the model and the applicability of the solution to the complicated model,the genetic algorithm (GA) can be used to solve the 01 programming reassembly model.The results show that the regular picture fragments reassembly model based on 01 programming can accurately describe the recuperative procedure with a mathematical language,and GA can be used to reassemble the fragments.

Key words: 01 programming;regular picture fragments reassembly;compatibility;genetic algorithm