摘要
针对规则文本碎片,提出了一种基于扫雷游戏策略和人机交互的碎片复原算法。通过边缘像素匹配距离,基线匹配距离和字母模板匹配距离,对碎片的相邻程度进行量化。由计算机选择最有可能相邻的碎片,必要时交由人工判断,直至完成碎片复原完成。对某文档碎片进行实验,结果表明这种算法是有效性的。
For regular text document fragments, a human -computer interaction algorithm based on minesweeper strategy is proposed. A comprehensive distance for every pair of fragments is measured via border pixel matching degree, baseline matching degree and letter matching degree. pair of fragments that is most likely to be adjacent if needed, human＇s response. An experiment shows our algorithm can In the process of reconstruction, computer provides a and comprehensive distances arc updated based on solve the text fragment reconstruction problem fairly well.
出处
《榆林学院学报》
2016年第2期40-43,共4页
Journal of Yulin University
基金
国家大学生创新实验项目(121301045)
关键词
规则文本碎片
扫雷策略
综合距离
人机交互
regular fragment reconstruction
minesweeper game strategy
comprehensive distance
human -com- puter interaction
