Based on the Hamilton Improved Circle of Scraps Joining Together

Article Preview

Abstract:

By using Hamilton improved circle, transversely and longitudinally cut up paper join together. By scanning image and image extraction techniques, the images of shredded paper are obtained. The process of shredding splicing is mainly divided into two parts, the image preprocessing and edge matching. Then the images conver into grey value matrixes and binarization are implemented on the image with appropriate threshold. The images of shredded paper are classified into nineteen lines. With the shortest Euclidean distance between the edge of shredding and Hamilton improved circle, shredded paper is transversely spliced. The test shows that accuracy is as high as 100%.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

245-248

Citation:

Online since:

April 2014

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Fei Ma, Hailian Lv, Guo Shi. Printed Chinese Character Recognition Based on the Shortest Euclidean Distance Matching. Journal of PingDingShan Institute, 2012, 27 (2); 70-70.

Google Scholar

[2] Haiyan Jia, Liangjia Zhu. A Shredding Automatic Splicing of Shape Matching Method. The Computer Simulation, 2006, 23 (11); 180-180.

Google Scholar

[3] Beibei Zheng. The Improved Genetic Algorithm Applied to Fragments Stitching. Computer and Modern, 2011, (5); 52-56.

Google Scholar

[4] Zhizhong Luo. Based on the Characteristics of Text Document Scraps of Semi-auto Stitching. Computer Engineering and Application, 2012 (5), 13207-207.

Google Scholar

[5] Qian Dong. Image Fragments Stitching Based on OpenCV. Science Technology and Engineering, 2010, (22); 5429-5429.

Google Scholar

[6] Yuhua Zhao, Weimin Ren, Kebai Li. About Hamilton Shortest Path Algorithm. DongFang Review, 2004, 19 (1); 42-46.

Google Scholar