关键词: 动态聚类, 碎纸拼接, 匹配度矩阵, 碎纸片特征向量

Abstract: This paper proposes an automatic documents fragment re-assembly algorithm based on dynamic clustering. It defines the matching matrix and calculates two fragments most reasonable splicing. It designs a dynamic line clustering algorithm based on eigenvector of torn pieces for a preliminary clustering. According to the text characteristic line and spacing, it adjusts the results of preliminary clustering, which can determine the final line classification and order. It matches the recovery results according to dynamic four adjacent matching algorithm. Experiment results show that this method is simple, and success rate is high, and can get stitching recovery results quickly.

Key words: dynamic clustering, stitching of torn pieces, matching matrix, eigenvector of torn pieces