earticle

논문검색

Auto-reconstruction of Shredded Document based on Matching Models

초록

영어

Shredding auto-reconstruction is a hot research topic in pattern recognition. The research progress can produce certain effect to various fields. The purpose of this paper is to study shredding auto-reconstruction based on regular shredded document from shredders, to obtain a practical and efficient splicing algorithm to auto- reconstruction of strip shaped shredded text documents and block shapedshredded text documents. For strips, this paper uses the pretreatment, the similarity matching model, combined with the optimalHamilton path algorithm, for which we get a good result with 100% correct rate and no human intervention. For blocks, first, this paper pretreats the fragments. And then uses the row cluster model to divide all debris to some rows, and then uses the similarity model with direct reverse matching model to achieve the shredding auto-restore in different rows. At last, we use line spacing matching model to get the result that has a high correct rate reaching to 90% with little human intervention. In this paper, the design of some algorithms is original. Combined with the present feasible algorithm, we get an ideal result.

목차

Abstract
 1. Introduction
 2. Reconstruction of Strip Shaped Shredded Documents
  2.1 Image Preprocessing
  2.2 Model for Strip Shaped Shredded Document
 3. Reconstruction of Block Shaped Shredded Document
  3.1 Summarize
  3.2 Row Cluster Model
  3.3 Similarity Matching Model
  3.4 Inline Debris Restore Model--Comprehensive Pixels matching Model
  3.5 Line-spacing Matching Model
 4. Conclusion
 References

저자정보

  • Mengmeng Yu Zhejiang University City College, Hangzhou, China
  • Pinjie Ye Zhejiang University City College, Hangzhou, China
  • Shuoping Wang Zhejiang University City College, Hangzhou, China
  • Honghao Gao Computing Center, Shanghai University, Shanghai, China

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.