We present a novel approach to the problem of puzzle solving as it relates to archaeological fragment reconstruction. We begin with a set of broken fragments. In the first stage, we compare every pair of fragments and use partial curve matching to find similar portions of their respective boundaries. Partial curve matching is typically a very difficult problem because the specification of the partial curves are highly unconstrained and curve matching is computationally expensive. To address the first problem, we only consider matches which begin at fragment corners and then use curve-matching with normalized energy to determine how far the match extends. We also reduce computational cost by employing a multi-scale approach. This allows us to quickly generate many possible matches at a coarse scale and only keep the best ones to be matched again at a finer scale. In the second stage, we take a rank-ordered list of pairwise matches to search for a globally optimal arrangement. The search is based on a best-first strategy which adds fragments with the highest pairwise affinity first, but then evaluates their confidence as part of the global solution by rewarding the formation of triple junctions which are dominant in archaeological puzzles. To prevent failure due to the inclusion of spurious matches, we employ a standard beam-search to simultaneously expand on multiple solutions. Results on several cases are demonstrated.
Archaeological Fragment Reconstruction Using Curve-Matching
2003-06-01
2751340 byte
Conference paper
Electronic Resource
English
Quadric-matching-based reconstruction of space curve [3545-07]
British Library Conference Proceedings | 1998
|Tracking Meteorological Structures Through Curve Matching using Geodesic Paths
British Library Conference Proceedings | 1998
|On Solving 2D and 3D Puzzles Using Curve Matching
British Library Conference Proceedings | 2001
|On solving 2D and 3D puzzles using curve matching
IEEE | 2001
|