Earticle

초록

영어

In this paper, we conduct a novel research on assembling paper fragments with kernel sparse representation and regular edge geometry analysis using the traditional example of rectangular pieces. At the initial stage, we adopt the methodology of image sparse presentation technique to overcome the influence of noise. During the process of assembling, we make good use of MATLAB and C++ to extract the core visual information from the fragments’ digitally to capture the matrix in the grey value scale. Edge characteristics are derived and regarded as the basic unit to find out fragments which belong in the first column. According to the similarity characteristic, adjacent rows are found and matched accordingly, annealing algorithm is used to gather the fragments. From the perspective of practical use, we find out the robustness and effectiveness of our proposed approach. Compare with some state-of-the-art algorithms, our methodology shows the better accuracy, it’s of great importance to the community of fragment assembly.

목차

Abstract
 1. Introduction
 2. Digitalizing the Fragments
 3. Image Sparse Presentation
  3.1. Preliminaries of Sparse Presentation
  3.2. Orthogonal Matching Pursuit (OMP)
 4. Assembling Algorithm
  4.1. An Overview of the Algorithm
  4.2. Determining Edge Fragments of the Original Document by Row
  4.3. Search Process for Fragment Rows
  4.4. Fragment Assembly by Row
  4.5. Fragment Assembly by Column
 5. Conclusion and Summary
 Acknowledgment
 References

키워드

저자

• Ting Wang [ School of Electronics & Information Engineering, LanZhou Jiaotong University ]
• Jiansheng Wang [ School of Electronics & Information Engineering, LanZhou Jiaotong University ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Hybrid Information Technology

• 간기

  격월간

• pISSN

  1738-9968

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605