The reassembly of fractured 3D objects is a critical problem in computationa l archaeology, and other application domains. An essential part of this problem is to distinguish the regions of the object that belong to the original surface from the fractured ones. A general strategy to solve this region cla ssification problem is to first divide the surface of the object into distinct facets and then classify each one of them based on statistical properties. While many relevant algorithms have been previously proposed ( [ PKT01], [ HFG∗06], [ WW08]), a comparative evaluation of some well-known segmentation strategies, when used in the co ntext f such a problem, is absent from the bibliography. In this poster we present our ongoing work on the e valuation of the performance and quality of segmentation algorithms when operating on fractured objects. We a lso present a novel method for the classification of the segmented regions to intact and fractured, based on th eir s atistical properties.
[1]
Johannes Wallner,et al.
Integral invariants for robust geometry processing
,
2009,
Comput. Aided Geom. Des..
[2]
Helmut Pottmann,et al.
Reassembling fractured objects by geometric matching
,
2006,
ACM Trans. Graph..
[3]
Simon Winkelbach,et al.
Pairwise Matching of 3D Fragments Using Cluster Trees
,
2008,
International Journal of Computer Vision.
[4]
Morgan McGuire,et al.
The alchemy screen-space ambient obscurance algorithm
,
2011,
HPG '11.
[5]
M WahlFriedrich,et al.
Pairwise Matching of 3D Fragments Using Cluster Trees
,
2008
.
[6]
Georgios Papaioannou,et al.
Virtual Archaeologist: Assembling the Past
,
2001,
IEEE Computer Graphics and Applications.