Solving jigsaw puzzles by computer
Annals of Operations Research
Recognizing general curved objects efficiently
Geometric invariance in computer vision
Invariant signatures for planar shape recognition under partial occlusion
CVGIP: Image Understanding
International Journal of Computer Vision
3D Part Segmentation Using Simulated Electrical Charge Distributions
IEEE Transactions on Pattern Analysis and Machine Intelligence
Differential and Numerically Invariant Signature Curves Applied to Object Recognition
International Journal of Computer Vision
Numerically Invariant Signature Curves
International Journal of Computer Vision
Intelligent Optimisation Techniques: Genetic Algorithms, Tabu Search, Simulated Annealing and Neural Networks
A shape and image merging technique to solve jigsaw puzzles
Pattern Recognition Letters
A global approach to automatic solution of jigsaw puzzles
Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometrySoCG2002
Recognizing Partially Occluded Parts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Classification of signature curves using latent semantic analysis
IWMM'04/GIAE'04 Proceedings of the 6th international conference on Computer Algebra and Geometric Algebra with Applications
IEEE Transactions on Image Processing
Jigsaw puzzles with pieces of unknown orientation
CVPR '12 Proceedings of the 2012 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
A texture based approach to reconstruction of archaeological finds
VAST'05 Proceedings of the 6th International conference on Virtual Reality, Archaeology and Intelligent Cultural Heritage
Extensions of Invariant Signatures for Object Recognition
Journal of Mathematical Imaging and Vision
Hi-index | 0.00 |
We present a method for automatically solving apictorial jigsaw puzzles that is based on an extension of the method of differential invariant signatures. Our algorithms are designed to solve challenging puzzles, without having to impose any restrictive assumptions on the shape of the puzzle, the shapes of the individual pieces, or their intrinsic arrangement. As a demonstration, the method was successfully used to solve two commercially available puzzles. Finally we perform some preliminary investigations into scalability of the algorithm for even larger puzzles.