摘要
为了实现规则中文文件碎片的拼接,研究了规则碎片文件中汉字文本的特征,提出了文件碎片中文本行信息的提取方法,定义了基于L1-norm的碎片边界差异度概念,建立了基于0-1规划的文件碎片拼接模型,并运用聚类分析降低了算法复杂度.与现有同类算法相比,本文的算法无需使用人工干预即可完成正确拼接.
In this thesis, feature of Chinese characters in regular fragments of document is studies and a method of extracting line-information of text is proposed. By defining the concept of L1-norm based differences between adjacent fragments, we develop a reassembly algorithm base on 0-1 programming and reduce the algorithm complexity by using cluster analysis. Compared with existing method, our reassembly method can fulfill the reassemble of given fragmented Chinese text effectively and efficiently without artificial supplementary.
出处
《计算机系统应用》
2015年第4期270-273,共4页
Computer Systems & Applications
基金
陕西省教育科学"十二五"规划项目(SGH13481)
