Abstract
Global reconstruction of two-dimensional wall paintings (frescoes) fromfragments is an important problem for many archaeological sites. The goal is to find the global position and rotation for each fragment so that all fragments jointly "reconstruct" the original surface (i.e., solve the puzzle). Manual fragment placement is difficult and time-consuming, especially when fragments are irregularly shaped and uncolored. Systems have been proposed to first acquire 3D surface scans of the fragments and then use computer algorithms to solve the reconstruction problem. These systems work well for small test cases and for puzzles with distinctive features, but fail for larger reconstructions of real wall paintings with eroded and missing fragments due to the complexity of the reconstruction search space. We address the search problem with an unsupervised genetic algorithm: we evolve a pool of partial reconstructions that grow through recombination and selection over the course of generations.We introduce a novel algorithm for combining partial reconstructions that is robust to noise and outliers, and we provide a new selection procedure that balances fitness and diversity in the population. In experiments with a benchmark dataset, our algorithm is able to achieve larger and more accurate global reconstructions than previous automatic algorithms.
Original language | English (US) |
---|---|
Article number | a2 |
Journal | Journal on Computing and Cultural Heritage |
Volume | 11 |
Issue number | 1 |
DOIs | |
State | Published - Dec 2017 |
All Science Journal Classification (ASJC) codes
- Conservation
- Information Systems
- Computer Science Applications
- Computer Graphics and Computer-Aided Design
Keywords
- 2D reconstruction
- Computational archaeology
- Data mining
- Genetic programming
- Machine learning
- Statistics