Jigsaw Puzzle Solving as a Consistent Labeling Problem

Marina Khoroshiltseva, Ben Vardi, Alessandro Torcinovich, Arianna Traviglia, Ohad Ben-Shahar, Marcello Pelillo

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


We explore the idea of abstracting the jigsaw puzzle problem as a consistent labeling problem, a classical concept introduced in the1980 s by Hummel and Zucker for which a solid theory and powerful algorithms are available. The problem amounts to maximizing a well-known quadratic function over a probability space which we solve using standard relaxation labeling algorithms endowed with matrix balancing mechanisms to enforce one-to-one correspondence constraints. Preliminary experimental results on publicly available datasets demonstrate the feasibility of the proposed approach.

Original languageEnglish
Title of host publicationComputer Analysis of Images and Patterns - 19th International Conference, CAIP 2021, Proceedings
EditorsNicolas Tsapatsoulis, Andreas Panayides, Theo Theocharides, Andreas Lanitis, Andreas Lanitis, Constantinos Pattichis, Constantinos Pattichis, Mario Vento
PublisherSpringer Science and Business Media Deutschland GmbH
Number of pages11
ISBN (Print)9783030891305
StatePublished - 1 Jan 2021
Event19th International Conference on Computer Analysis of Images and Patterns, CAIP 2021 - Virtual, Online
Duration: 28 Sep 202130 Sep 2021

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume13053 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference19th International Conference on Computer Analysis of Images and Patterns, CAIP 2021
CityVirtual, Online

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Jigsaw Puzzle Solving as a Consistent Labeling Problem'. Together they form a unique fingerprint.

Cite this