Paper Titles
Fuzzy Attribute Reduction Based on Fuzzy Similarity
p.237
GPR Wave Velocity Estimation Based on the Method of Curves Character and K-Means Clustering
p.242
Simulation Research of Feature Extraction Method Based on Nonlinear Manifold Learning
p.247
Study on Adaptive Hybrid Prediction Algorithm and its Implementation Based on Neural Network
p.252
The Auto Restoration of Paper Fragments Rules Based on the Traveling Salesman Model
p.256
Calculation of Diffraction Patterns on inside Cylindrical Surface
p.260
Dynamic Construction of Voronoi Diagram for a Set of Points and Straight Line Segments
p.264
The Study on a New Approximate Method of Computing Electromagnetic Scattering from Multilayer Rough Sea Surfaces
p.268
Observer Design for Lipschitz Nonlinear Systems with Output Uncertainty
p.277

The Auto Restoration of Paper Fragments Rules Based on the Traveling Salesman Model

Article Preview

Abstract:

The restoration of regular paper fragments can be solved just as the Traveling Salesman Problem. Paper pretreatment and edge matching are the main steps during the restoration process, which contain binarization, screening between the left and right boundary depending the width of paper margins. For some longer paper fragments, the transverse splicing can be realized with Greed Algorithm. But the algorithm will get a non-ideal restoration for more fine paper fragments. Therefore the noise-suppressed processing before clustering from line to line through projection is essential in order to make sure that the regular English fragments can get the regularity like Chinese characters. The two experiments get an 100% correct rates when using the method combining the improved genetic algorithm for traveling salesman problem.combining the improved genetic algorithm for traveling salesman problem.

You might also be interested in these eBooks
Modern Tendencies in Engineering Sciences View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volume 533)

Pages:

256-259

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.533.256

Citation:

Cite this paper

Online since:

February 2014

Authors:

Ao Jun Zhou*

Keywords:

Binarization, Greedy Algorithm, Improved Genetic Algorithm (IGA), TSP

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

References

[1] KHOTANZAD A, LU J H. Classification of invariant image representations using a neural network [J]. IEEE T ran s ASSP, Vol. 38 No. 6 (1990) p.1028-p.1038.

DOI: 10.1109/29.56063

Google Scholar

[2] XingjianZi，JianPing Wang. Extraction method based on wavelet transform image characteristic strokes of Chinese characters. Computer Engineering and Applications, Vol. 48 No. 12 (2012) p.1-p.3 In Chinese.

Google Scholar

[3] Beibei Zheng. Improved genetic algorithm with fragments stitching. Computer and Modernization, 2011，p.2-p.5 In Chinese.

Google Scholar