March 2002
Barus & Holley, Rm. 312 - Eng. bldg. 3rd floor, 3pm.
We address the problem of how to automatically reconstruct pottery vessels from a collection of sherds using a variety of features and their comparisons. To solve the problem, we designed a computational framework that is founded on the primitive operations of ``match'' proposal and evaluation. A match defines the geometric relationship between a pair of sherds. This framework affords a natural decomposition of the computation required by an automatic assembly process. Specifically, pair-wise matches are proposed and subsequently evaluated by a series of independent feature similarity modules. Assembly strategies are abstracted from the feature-specific sherd details and operate solely in terms of the probabilistic output of pair-wise proposals and evaluations.
Our framework, which is modular and extensible, paves the way for a system to automatically reconstruct pottery vessels. We demonstrate a greedy assembly strategy that predicts likely pairs and triples of sherds using a handful of proposal and evaluation modules.
Last Updated: April 8, 2002