The boundary-gray matching algorithm of scrapped paper based on cluster
Niu Ya-fen · Journal of Science of Teachers' College and University · 2014
Proposed an algorithm of boundary-grayscale matching based on cluster for rectangle paper fragments.It is mainly related to the pretreatment of debris,the edge extraction of gray-value,fragments of clustering and matching.Clustering and matching is the most key part of the fragments stitching.By clustering,the number of the matched pieces can be reduced to improve the matching accuracy.It is advantageous to the computer search.Moreover,the matching algorithm selects parts of the left or right(or upper and lower)boundary-grayscale,which greatly compress the amount of information.It can not only improve the computer processing speed but also have high matching precision and good effect.Experiments showed that this algorithm is applicable to match the rectangle pieces.Furthermore,it has the characteristics of efficient,rapid and stable.