GANzzle: Reframing jigsaw puzzle solving as a retrieval task using a generative mental image
Not on the map. Why?
Abstract (arXiv)
Puzzle solving is a combinatorial challenge due to the difficulty of matching adjacent pieces. Instead, we infer a mental image from all pieces, which a given piece can then be matched against avoiding the combinatorial explosion. Exploiting advancements in Generative Adversarial methods, we learn how to reconstruct the image given a set of unordered pieces, allowing the model to learn a joint embedding space to match an encoding of each piece to the cropped layer of the generator. Therefore we frame the problem as a R@1 retrieval task, and then solve the linear assignment using differentiable Hungarian attention, making the process end-to-end. In doing so our model is puzzle size agnostic, in contrast to prior deep learning methods which are single size. We evaluate on two new large-scale datasets, where our model is on par with deep learning methods, while generalizing to multiple puzzle sizes.
Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 10 of its 27 references that are in the map. First posted on arXiv 12 Jul 2022.
Builds on
10 of 27 references.
References · 10
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2014Deep Learning Face Attributes in the Wildcited by 3,693
- 2016Unsupervised Learning of Visual Representations by Solving Jigsaw Puzzlescited by 1,382
- 2019MaskGAN: Towards Diverse and Interactive Facial Image Manipulationcited by 628
- 2015Multi-view Convolutional Neural Networks for 3D Shape Recognitioncited by 565
- 2020Deepzzle: Solving Visual Jigsaw Puzzles with Deep Learning andShortest Path Optimizationcited by 20
- 2018Learning Representations of Sets through Optimized Permutationscited by 15
- 2019Solving Jigsaw Puzzles with Eroded Boundariescited by 14
- 2017A Genetic Algorithm-Based Solver for Very Large Jigsaw Puzzlescited by 13
- 2019Complementarity-Preserving Fracture Morphology for Archaeological Fragmentscited by 1
Built on by
Citing papers per year: 2023: 2; 2024: 2; 2025: 3; 2026: 3.
10 papers.
- 2024DiffAssemble: A Unified Graph-Diffusion Model for 2D and 3D Reassemblycited by 33
- 2024Re-assembling the past: The RePAIR dataset and benchmark for real world 2D and 3D puzzle solvingcited by 19
- 2023Multi-Phase Relaxation Labeling for Square Jigsaw Puzzle Solvingcited by 7
- 2023Positional Diffusion: Ordering Unordered Sets with Diffusion Probabilistic Modelscited by 5
- 2025PuzLM: Solving Jigsaw Puzzles with Sequence-to-Sequence Language Modelscited by 4
- 2026The Missing GAP: From Solving Square Jigsaw Puzzles to Handling Real World Archaeological Fragmentscited by 3
- 2025ReassembleNet: Learnable Keypoints and Diffusion for 2D Fresco Reconstructioncited by 2
- 2025Benchmarking Content-Based Puzzle Solvers on Corrupted Jigsaw Puzzlescited by 0
- 2026JigSync: Gauge-Resolved Synchronization for Jigsaw Reassembly under Unknown Piece Orientationcited by 0
- 2026Fix the Match, Not the Solver: STITCH -- a Self-Supervised Compatibility Measure for Eroded Visual Puzzlescited by 0
- 2026Fix the Match, Not the Solver: STITCH -- a Self-Supervised Compatibility Measure for Eroded Visual Puzzles9 Oct 2026
- 2026JigSync: Gauge-Resolved Synchronization for Jigsaw Reassembly under Unknown Piece Orientation16 Sep 2026
- 2026The Missing GAP: From Solving Square Jigsaw Puzzles to Handling Real World Archaeological Fragments12 May 2026
- 2025PuzLM: Solving Jigsaw Puzzles with Sequence-to-Sequence Language Models9 Nov 2025
- 2025Benchmarking Content-Based Puzzle Solvers on Corrupted Jigsaw Puzzles10 Jul 2025
- 2025ReassembleNet: Learnable Keypoints and Diffusion for 2D Fresco Reconstruction27 May 2025
- 2024Re-assembling the past: The RePAIR dataset and benchmark for real world 2D and 3D puzzle solving31 Oct 2024
- 2024DiffAssemble: A Unified Graph-Diffusion Model for 2D and 3D Reassembly29 Feb 2024
- 2023Multi-Phase Relaxation Labeling for Square Jigsaw Puzzle Solving26 Mar 2023
- 2023Positional Diffusion: Ordering Unordered Sets with Diffusion Probabilistic Models20 Mar 2023