PSQP: Puzzle Solving by Quadratic Programming

In this article we present the first effective method based on global optimization for the reconstruction of image puzzles comprising rectangle pieces—Puzzle Solving by Quadratic Programming (PSQP). The proposed novel mathematical formulation reduces the problem to the maximization of a constrained quadratic function, which is solved via a gradient ascent approach. The proposed method is deterministic and can deal with arbitrary identical rectangular pieces. We provide experimental results showing its effectiveness when compared to state-of-the-art approaches. Although the method was developed to solve image puzzles, we also show how to apply it to the reconstruction of simulated strip-shredded documents, broadening its applicability.

[1]  W. Marande,et al.  Mitochondrial DNA as a Genomic Jigsaw Puzzle , 2007, Science.

[2]  Edson Justino,et al.  Reconstructing shredded documents through feature matching. , 2006, Forensic science international.

[3]  Stephen V. Rice,et al.  Software tools and test data for research and testing of page-reading OCR systems , 2005, IS&T/SPIE Electronic Imaging.

[4]  Andrew C. Gallagher.  Jigsaw puzzles with pieces of unknown orientation , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.

[5]  Tarak Gandhi,et al.  An automatic jigsaw puzzle solver , 1994, Proceedings of 12th International Conference on Pattern Recognition.

[6]  Klaus Hansen,et al.  Solving jigsaw puzzles using image features , 2008, Pattern Recognit. Lett..

[7]  E. Seneta.  Non-negative Matrices and Markov Chains , 2008 .

[8]  Micha Sharir,et al.  Identification of Partially Obscured Objects in Two and Three Dimensions by Matching Noisy Characteristic Curves , 1987 .

[9]  Nathan S. Netanyahu,et al.  A Genetic Algorithm-Based Solver for Very Large Jigsaw Puzzles , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.

[10]  William T. Freeman,et al.  A probabilistic image jigsaw puzzle solver , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[11]  J. B. Rosen.  The gradient projection method for nonlinear programming: Part II , 1961 .

[12]  Jorge Stolfi,et al.  A Multi-Scale Method for the Re-Assembly of Fragmented Objects , 2000 .

[13]  H. Freeman,et al.  Apictorial Jigsaw Puzzles: The Computer Solution of a Problem in Pattern Recognition , 1964, IEEE Trans. Electron. Comput..

[14]  Grigore C. Burdea,et al.  Solving jigsaw puzzles by a robot , 1989, IEEE Trans. Robotics Autom..

[15]  Marshall W. Bern,et al.  A global approach to automatic solution of jigsaw puzzles , 2002, SCG '02.

[16]  Ohad Ben-Shahar,et al.  A fully automated greedy square jigsaw puzzle solver , 2011, CVPR 2011.

[17]  Dewen Hu,et al.  Globally Consistent Reconstruction of Ripped-Up Documents , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[18]  Benjamin B. Kimia,et al.  Archaeological Fragment Reconstruction Using Curve-Matching , 2003, 2003 Conference on Computer Vision and Pattern Recognition Workshop.

[19]  Mu-Chun Su,et al.  A puzzle solver and its application in speech descrambling , 2007 .

[20]  William T. Freeman,et al.  The Patch Transform , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[21]  David B. Cooper,et al.  Solving Square Jigsaw Puzzles with Loop Constraints , 2014, ECCV.

[22]  J. B. Rosen.  The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints , 1960 .

[23]  Tim Weyrich,et al.  A system for high-volume acquisition and matching of fresco fragments: reassembling Theran wall paintings , 2008, ACM Trans. Graph..

[24]  Erik D. Demaine,et al.  Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity , 2007, Graphs Comb..