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

作者：

Highlights：

• 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.

摘要

•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

论文评审过程：Received 28 January 2018, Revised 29 January 2019, Accepted 28 February 2019, Available online 1 March 2019, Version of Record 7 March 2019.

论文官网地址：https://doi.org/10.1016/j.eswa.2019.02.039