A solution to reconstruct cross-cut shredded text documents based on constrained seed K-means algorithm and ant colony algorithm

Junhua Chen,Miao Tian, Xingming Qi,Wenxing Wang,Youjun Liu

Expert Systems with Applications（2019）

引用 10|浏览11

暂无评分

摘要

•A solution for RCCSTD problems is proposed.•The clustering accuracy is quite high.•A penalty coefficient is used to improve splicing accuracy in row.•It is perhaps the first feasible approach for RCCSTDD problem.

查看译文

关键词

Reconstruction of cross-cut shredded documents (RCCSTD),Constrained seed K-means algorithm,Horizontal projection,Penalty coefficient,Ant colony algorithm

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要