A Polynomial function in the Automatic Reconstruction of Fragmented Objects

The reconstruction of archaeological objects is a very challenging problem and solving this problem is important. Occasionally, archaeological workers suffer when trying to match object fragments together, especially when there is a presence of significant gaps in the fragments, or even in the case of similarity, where fragments are mixed with fragments of other objects. The main theme of this study is a proposed method for the reconstruction of pottery from archaeological fragmented pots and vases, depending on the use of a polynomial function. In any case, there is an important fact that should be mentioned: The assembly of any object will rely on the edges of the fragment firstly, then the color and texture. Therefore, this study has adopted the edges of the fragments as a condition when reconstructing the objects, by exploiting the edges of the fragments as an important feature, mainly due to the fact that edges of the fragments are lines, corners and curves. A Canny filter was used to identify the edges of the fragments. In addition, for the purpose of obtaining the vector of coefficient for the set of edges, a polynomial function algorithm was applied. Lastly, the experiments shows that the algorithm is effective, especially when applying the correlation coefficient formula in the classification phase by using the data set which consists of 56 pieces and each one has edges at a rate of 3-5 cm. The experimental results achieved a high success rate that means the proposed system may produce high performance to recognize and match the edges by using a polynomial function to extract features and to classify them by using a correlation coefficient.

[1]  Tim Weyrich,et al.  Global Consistency in the Automatic Assembly of Fragmented Artefacts , 2011, VAST.

[2]  Ardeshir Goshtasby,et al.  On the Canny edge detector , 2001, Pattern Recognit..

[3]  David B. Cooper,et al.  Axially Symmetric 3D Pots Configuration System Using Axis of Symmetry and Break Curve , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.

[4]  Benjamin B. Kimia,et al.  HINDSITE: A user-interactive framework for fragment assembly , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Workshops.

[5]  Fangfang Zhang,et al.  Two-dimensional contour matching algorithm based on multiscale space , 2011, International Conference on Computer Research and Development.

[6]  Jorge Stolfi,et al.  Measuring the Information Content of Fracture Lines , 2005, International Journal of Computer Vision.

[7]  Tim Weyrich,et al.  Multi-feature matching of fresco fragments , 2010, ACM Trans. Graph..

[8]  Ko Nishino,et al.  A flexible approach to reassembling thin artifacts of unknown geometry , 2013 .

[9]  Dinesh Manocha,et al.  SOLVING SYSTEMS OF POLYNOMIAL EQUATIONS , 2002 .

[10]  Kentaro Imajo Fast Gaussian filtering algorithm using splines , 2012, Proceedings of the 21st International Conference on Pattern Recognition (ICPR2012).

[11]  Qi Li-Ying,et al.  Kernel fuzzy clustering based classification of Ancient-Ceramic fragments , 2010, 2010 2nd IEEE International Conference on Information Management and Engineering.

[12]  Ali Shokoufandeh,et al.  Classification of archaeological ceramic fragments using texture and color descriptors , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Workshops.

[13]  Constantin Papaodysseus,et al.  2D fragmented object reconstruction with the use of the chromatic and thematic content , 2011, Pattern Analysis and Applications.

[14]  Tim Weyrich,et al.  Learning how to match fresco fragments , 2011, JOCCH.

[15]  Petros Daras,et al.  Automatic classification of archaeological pottery sherds , 2012, JOCCH.