A global approach to automatic solution of jigsaw puzzles

Authors:
David Goldberg;Christopher Malon;Marshall Bern
Affiliations:
Palo Alto Research Center, 3333 Coyote Hill Rd., Palo Alto, CA;MIT Department of Mathematics, Cambridge, MA;Palo Alto Research Center, 3333 Coyote Hill Rd., Palo Alto, CA
Venue:
Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometry—SoCG2002
Year:
2004

Citing 8
Cited 18

Identification of partially obscured objects in two and three dimensions by matching noisy characteristic

International Journal of Robotics Research
Solving jigsaw puzzles by computer

Annals of Operations Research
On curve matching

IEEE Transactions on Pattern Analysis and Machine Intelligence
Solving the jigsaw puzzle problem in linear time

Applied Artificial Intelligence
Optismoothing: an optimization-driven approach to mesh smoothing

Finite Elements in Analysis and Design - Special issue—Robert J. Melosh medal competition
Jigsaw Puzzle Solving Using Approximate String Matching and Best-First Search

CAIP '93 Proceedings of the 5th International Conference on Computer Analysis of Images and Patterns
Constructing 2D Curve Atlases

MMBIA '00 Proceedings of the IEEE Workshop on Mathematical Methods in Biomedical Image Analysis
Determining molecular conformation from distance or density data

Determining molecular conformation from distance or density data

Reassembling fractured objects by geometric matching

ACM SIGGRAPH 2006 Papers
Globally Consistent Reconstruction of Ripped-Up Documents

IEEE Transactions on Pattern Analysis and Machine Intelligence
Pairwise Matching of 3D Fragments Using Cluster Trees

International Journal of Computer Vision
Solving jigsaw puzzles using image features

Pattern Recognition Letters
Image-Based Techniques for Shredded Document Reconstruction

PSIVT '09 Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology
Digital anastylosis of the Octagon in Ephesos

Journal on Computing and Cultural Heritage (JOCCH)
Automatic color based reassembly of fragmented images and paintings

IEEE Transactions on Image Processing
A contour matching algorithm to reconstruct ruptured documents

Proceedings of the 32nd DAGM conference on Pattern recognition
A memetic algorithm for reconstructing cross-cut shredded text documents

HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
Local context discrimination in signature neural networks

IWINAC'11 Proceedings of the 4th international conference on Interplay between natural and artificial computation: new challenges on bioinspired applications - Volume Part II
Reconstruction of shredded document based on image feature matching

Expert Systems with Applications: An International Journal
Communication by identity discrimination in bio-inspired multi-agent systems

Concurrency and Computation: Practice & Experience
Analyzing and simulating fracture patterns of theran wall paintings

Journal on Computing and Cultural Heritage (JOCCH)
An optimization approach for extracting and encoding consistent maps in a shape collection

ACM Transactions on Graphics (TOG) - Proceedings of ACM SIGGRAPH Asia 2012
Global consistency in the automatic assembly of fragmented artefacts

VAST'11 Proceedings of the 12th International conference on Virtual Reality, Archaeology and Cultural Heritage
Analyzing fracture patterns in theran wall paintings

VAST'10 Proceedings of the 11th International conference on Virtual Reality, Archaeology and Cultural Heritage
Automatic classification of archaeological pottery sherds

Journal on Computing and Cultural Heritage (JOCCH)
Automatic Solution of Jigsaw Puzzles

Journal of Mathematical Imaging and Vision

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new algorithm for automatically solving jigsaw puzzles by shape alone. The algorithm can solve more difficult puzzles than could be solved before, without the use of backtracking or branch-and-bound. The algorithm can handle puzzles in which pieces border more than four neighbors, and puzzles with as many as 200 pieces. Our overall strategy follows that of previous algorithms but applies a number of new ideas, such as robust fiducial points, "highest-confidence-first" search, and frequent global reoptimization of partial solutions.