Thumbnail
Access Restriction
Subscribed

Author Vendrell-Vidal, Eduardo ♦ Snchez-Belenguer, Carlos
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2014
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Automatic reconstruction ♦ GPU ♦ Global registration ♦ Hierarchical
Abstract This article addresses the problem of automatic reconstruction of ancient artifacts from archaeological fragments. The technique described here focuses on pairwise matching of flat fragments (typically fresco fragments), and it is intended to be the core of a larger system for artifact reconstruction. Global registration techniques are challenging due to the combinatory explosion that happens in the solution space: the goal is to find the best alignment among all possible ones without an initialization. This fact defines the duality between performance and correction that we face in this work. The proposed technique defines a cost function to evaluate the quality of an alignment based on a discrete sampling of the fragments that ensures data alignment. Starting from an exhaustive search strategy, the technique progressively incorporates new features that lead to a hierarchical search strategy. Convergence and correction of the resulting technique are ensured using an optimistic cost function. Internal search calculations are optimized so the only operations performed are additions, subtractions, and comparisons over aligned data. All heavy geometric operations are carried out by the GPU on a preprocessing stage that only happens once per fragment.
ISSN 15564673
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2014-06-01
Publisher Place New York
e-ISSN 15564711
Journal Journal on Computing and Cultural Heritage (JOCCH)
Volume Number 7
Issue Number 3
Page Count 19
Starting Page 1
Ending Page 19


Open content in new tab

   Open content in new tab
Source: ACM Digital Library