Publication: A Linear Scoring Algorithm for Shredded Paper Reconstruction
dc.contributor.author | Tanasanee Phienthrakul | en_US |
dc.contributor.author | Tewan Santitewagun | en_US |
dc.contributor.author | Narit Hnoohom | en_US |
dc.contributor.other | Mahidol University | en_US |
dc.date.accessioned | 2018-12-11T02:40:10Z | |
dc.date.accessioned | 2019-03-14T08:04:34Z | |
dc.date.available | 2018-12-11T02:40:10Z | |
dc.date.available | 2019-03-14T08:04:34Z | |
dc.date.issued | 2016-02-05 | en_US |
dc.description.abstract | © 2015 IEEE. This paper proposes a method of shredded paper reconstruction using a scoring algorithm. This method consists of four modules, i.e., preprocessing, scoring, searching, and reconstructing. The scoring algorithm is created to predict the location of the next black pixel using the concept of linear regression and linear combination. Three black pixels from three consecutive columns are considered to predict the position of the next black pixel. The experimental results show that the proposed method yields the better performance over directly comparing the edges of two shreds when the suitable threshold is used in the preprocessing step. | en_US |
dc.identifier.citation | Proceedings - 11th International Conference on Signal-Image Technology and Internet-Based Systems, SITIS 2015. (2016), 623-627 | en_US |
dc.identifier.doi | 10.1109/SITIS.2015.13 | en_US |
dc.identifier.other | 2-s2.0-84966392140 | en_US |
dc.identifier.uri | https://repository.li.mahidol.ac.th/handle/20.500.14594/43506 | |
dc.rights | Mahidol University | en_US |
dc.rights.holder | SCOPUS | en_US |
dc.source.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84966392140&origin=inward | en_US |
dc.subject | Computer Science | en_US |
dc.title | A Linear Scoring Algorithm for Shredded Paper Reconstruction | en_US |
dc.type | Conference Paper | en_US |
dspace.entity.type | Publication | |
mu.datasource.scopus | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84966392140&origin=inward | en_US |