JigsawNet: Shredded Image Reassembly using Convolutional Neural Network and Loop-based Composition
Not on the map. Why?
Abstract (arXiv)
This paper proposes a novel algorithm to reassemble an arbitrarily shredded image to its original status. Existing reassembly pipelines commonly consist of a local matching stage and a global compositions stage. In the local stage, a key challenge in fragment reassembly is to reliably compute and identify correct pairwise matching, for which most existing algorithms use handcrafted features, and hence, cannot reliably handle complicated puzzles. We build a deep convolutional neural network to detect the compatibility of a pairwise stitching, and use it to prune computed pairwise matches. To improve the network efficiency and accuracy, we transfer the calculation of CNN to the stitching region and apply a boost training strategy. In the global composition stage, we modify the commonly adopted greedy edge selection strategies to two new loop closure based searching algorithms. Extensive experiments show that our algorithm significantly outperforms existing methods on solving various puzzles, especially those challenging ones with many fragment pieces.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 11 Sep 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 1; 2025: 2; 2026: 3.
7 papers.
- 2022PuzzleFusion: Unleashing the Power of Diffusion Models for Spatial Puzzle Solvingcited by 17
- 2024Re-assembling the past: The RePAIR dataset and benchmark for real world 2D and 3D puzzle solvingcited by 17
- 2025ReassembleNet: Learnable Keypoints and Diffusion for 2D Fresco Reconstructioncited by 2
- 2026The Missing GAP: From Solving Square Jigsaw Puzzles to Handling Real World Archaeological Fragmentscited by 2
- 2025Solving Convex Partition Visual Jigsaw Puzzlescited by 1
- 2026Motion-Guided Semantic Alignment with Negative Prompts for Zero-Shot Video Action Recognitioncited by 0
- 2026An Invariant Tangent-Angle Descriptor and a Band U-Net for 2D Fragment Adjacency Predictioncited by 0
- 2026An Invariant Tangent-Angle Descriptor and a Band U-Net for 2D Fragment Adjacency Prediction7 Oct 2026
- 2026The Missing GAP: From Solving Square Jigsaw Puzzles to Handling Real World Archaeological Fragments12 May 2026
- 2026Motion-Guided Semantic Alignment with Negative Prompts for Zero-Shot Video Action Recognition18 Apr 2026
- 2025Solving Convex Partition Visual Jigsaw Puzzles6 Nov 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
- 2022PuzzleFusion: Unleashing the Power of Diffusion Models for Spatial Puzzle Solving24 Nov 2022