Title: An Efficient Technique to Recompose Archaeological Artifacts from Fragments
Publisher: IEEE Computer Society
Publication Year: 2014
JRC N°: JRC92432
ISBN: 978-1-4799-7227-2
URI: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7136671&isnumber=7136639
DOI: 10.1109/VSMM.2014.7136671
Type: Articles in periodicals and books
Abstract: This paper introduces a novel approach to automatically recompose archaeological broken artifacts from fragments.The aim of the proposed technique is to assist restoration personnel in the tedious task of reconstructing ancient relics found in excavation sites. Starting from unstructured point clouds of fragments, our approach attempts to recompose the originalartifact by finding the individual rigid transformations that better align all the fragments. To efficiently do so, a pre-processing stage executed where the size of the problem is considerably reduced: singular keypoints in the original point cloud are selected based on a multi-scale feature extraction process driven by the saliency of each point. Computing a modified version of the PFH descriptor, the local neighborhood of each keypoint is described in a compact histogram. Using exclusively the selected keypoints and their associated descriptors, a very fast one-to-one search algorithm is executed for each possible pair of fragments.This process uses a three-level hierarchical search strategy driven by the local similarity between keypoints, and applying a set of geometric consistence tests for intermediate results. Finally, a graph-based global registration algorithm uses all the individual matches to compute the final reconstruction of the artifact by creating clusters of matching fragments, appending new potential matches and joining individual clusters into bigger structures.Empirical tests have proven the technique to be extremely fast while keeping memory requirements very low.
JRC Directorate:Nuclear Safety and Security

Files in This Item:
There are no files associated with this item.

Items in repository are protected by copyright, with all rights reserved, unless otherwise indicated.