Exploiting Unbroken Surface Congruity for the Acceleration of Fragment Reassembly

Simple item page
dc.contributor.authorSavelonas, Michalis A.en_US
dc.contributor.authorAndreadis, Anthousisen_US
dc.contributor.authorPapaioannou, Georgiosen_US
dc.contributor.authorMavridis, Pavlosen_US
dc.contributor.editorTobias Schreck and Tim Weyrich and Robert Sablatnig and Benjamin Stularen_US
dc.date.accessioned2017-09-27T06:39:37Z
dc.date.available2017-09-27T06:39:37Z
dc.date.issued2017
dc.description.abstractVirtual 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.en_US
dc.description.sectionheadersRetrieval, Classification, and Matching
dc.description.seriesinformationEurographics Workshop on Graphics and Cultural Heritage
dc.identifier.doi10.2312/gch.20171305
dc.identifier.isbn978-3-03868-037-6
dc.identifier.issn2312-6124
dc.identifier.pages137-144
dc.identifier.urihttps://doi.org/10.2312/gch.20171305
dc.identifier.urihttps://diglib.eg.org:443/handle/10.2312/gch20171305
dc.publisherThe Eurographics Associationen_US
dc.subjectComputing methodologies
dc.subjectShape analysis
dc.subjectApplied computing
dc.subjectArts and humanities
dc.titleExploiting Unbroken Surface Congruity for the Acceleration of Fragment Reassemblyen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
137-144.pdf
Size:
9.47 MB
Format:
Adobe Portable Document Format
Download
Collections
GCH 2017 - Eurographics Workshop on Graphics and Cultural Heritage