HackerPapers

arXiv:1812.10553cs.CV

Solving Archaeological Puzzles

Niv Derech, Ayellet Tal, Ilan Shimshoni

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

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.

arXiv comments
Journal reference
DOI
Subjects
cs.CVComputer Vision and Pattern Recognition

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Jun 2021 to Jun 2021.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. How to think clearly 1 comment
    • Ah, I think I may see the missed connection! It's like a jigsaw puzzle because archaeologists really do assemble fragments of old scripts. Sometimes the translation efforts can only give you probabilistic answers that in turn influence where you're likely to place a fragment. A…

      ludwigschubertView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.