|Title:||Solving Archaeological Puzzles
|Supervisors:||Ayellet Tal, Ilan Shimshoni
|Currently accessibly only within the Technion network|
|Abstract:||Puzzle solving is a difficult problem in its own right, even when the pieces are all square and build up a natural image. But what if these ideal conditions do not hold? One such application domain is archaeology, where restoring an artifact from its fragments is highly important. From the point of view of computer vision, archaeological puzzle solving is very challenging, due to three additional difficulties: the fragments are of general shape; they are abraded, especially at the boundaries (where the strongest cues for matching should exist); and the domain of valid transformations between the pieces is continuous. The key contribution of this paper is a fully-automatic and general algorithm that addresses puzzle solving in this intriguing domain. We show that our state-of-the-art approach manages to correctly reassemble dozens of broken artifacts and frescoes.
Our novel approach is based on four key ideas. First, in order to address fragment abrasion, we propose to extrapolate each fragment prior to reassembly. Second, we suggest a transformation sampling method, which is based on the notion of configuration space. Third, we propose a new measure, which takes into account the special characteristics of the domain, such as the gaps between the pieces, color fading, and spurious edges. Finally, we define the notion of confidence in the match and consider it during placement.
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/2019/MSC/MSC-2019-08), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the MSC technical reports of 2019
To the main CS technical reports page
Computer science department, Technion