Exploiting Unbroken Surface Congruity for the Acceleration of Fragment Reassembly
|Title||Exploiting Unbroken Surface Congruity for the Acceleration of Fragment Reassembly|
|Publication Type||Conference Proceedings|
|Year of Conference||2017|
|Authors||Savelonas, MA, Andreadis, A, Papaioannou, G, Mavridis, P|
|Conference Name||EUROGRAPHICS Workshop on Graphics and Cultural Heritage|
Virtual reassembly problems are often encountered in the cultural heritage domain. The reassembly or "puzzling" problem is typically described as the process for the identification of corresponding pieces within a part collection, followed by the clustering and pose estimation of multiple parts that result in a virtual representation of assembled objects. This work addresses this problem with an efficient, user-guided computational approach. The proposed approach augments the typical reassembly pipeline with a smart culling step, where geometrically incompatible fragment combinations can be quickly rejected. After splitting each fragment into potentially fractured and intact facets, each intact facet is examined for prominent linear or curved structures and a heuristic test is employed to evaluate the plausibility of facet pairs, by comparing the number of feature curves associated with each facet, as well as the geometric texture of associated intact surfaces. This test excludes many pairwise combinations from the remaining part of the reassembly process, significantly reducing overall time cost. For all facet pairs that pass the initial plausibility test, pairwise registration driven by enhanced simulated annealing is applied, followed by multipart registration. The proposed reassembly approach is evaluated on real scanned data and our experiments demonstrate an increase in efficiency that ranges from 30% to more than 500% in some cases, depending on the number of culled combinations.