Princeton > CS Dept > PIXL > Graphics > Publications Local Access 

Learning How to Match Fresco Fragments
Journal on Computing and Cultural Heritage, November 2011

Thomas Funkhouser, Hijung Shin, Corey Toler-Franklin,
Antonio García Castañeda, Benedict Brown, David Dobkin,
Szymon Rusinkiewicz, Tim Weyrich


Abstract

One of the main problems faced during reconstruction of fractured archaeological artifacts is sorting through a large number of candidate matches between fragments to find the relatively few that are correct. Previous computer methods for this task provided scoring functions based on a variety of properties of potential matches, including color and geometric compatibility across fracture surfaces. However, they usually consider only one or at most a few properties at once, and therefore provide match predictions with very low precision. In this article, we investigate a machine learning approach that computes the probability that a match is correct based on the combination of many features. We explore this machine learning approach for ranking matches in three different sets of fresco fragments, finding that classifiers based on many match properties can be significantly more effective at ranking proposed matches than scores based on any single property alone. Our results suggest that it is possible to train a classifier on match properties in one dataset and then use it to rank predicted matches in another dataset effectively. We believe that this approach could be helpful in a variety of cultural heritage reconstruction systems.

Citation (BibTeX)

Thomas Funkhouser, Hijung Shin, Corey Toler-Franklin, Antonio García Castañeda, Benedict Brown, David Dobkin, Szymon Rusinkiewicz, and Tim Weyrich. Learning How to Match Fresco Fragments. Journal on Computing and Cultural Heritage 4(2), November 2011.

Paper
  PDF file

Links
  An earlier version of this paper appeared in the Eurographics 2011 area track on Cultural Heritage