Advertisement

Jigsaw puzzle solving using approximate string matching and best-first search

Structural Approaches
Part of the Lecture Notes in Computer Science book series (LNCS, volume 719)

Abstract

In this paper we describe a new method for jigsaw puzzle solving. The main steps of the method are local shape analysis followed by global assembly. Local shape analysis is based on an approximate string matching procedure that detects corresponding partial boundaries of pairs of puzzle pieces. In the assembly phase, ambiguities that may result from local shape matching are resolved using a best-first tree search procedure with backtracking. The method takes real images of puzzle pieces as input data. It has been completely implemented and successfully tested on a number of puzzles.

Keywords

Global Solution Input Graph Local Shape String Match Solution Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    T. Altmann, Solving the jigsaw-puzzle in linear time, in Applied Artificial Intelligence 3, 1989, 453–462Google Scholar
  2. [2]
    H. Freeman, L. Garder, Apictorial jigsaw puzzles: The computer solution of a problem in pattern recognition, in IEEE Trans. on Electronic Comp. EC-13, 2, 1964, 118–127Google Scholar
  3. [3]
    G.M. Radack, N.I. Badler, Jigsaw puzzle matching using a boundary centered polar encoding, in Computer Graphics and Image Processing 19, 1982, 1–17Google Scholar
  4. [4]
    G.C. Burdea, H.J. Wolfson, Solving jigsaw puzzles by a robot, in IEEE Trans. on Robotics and Automation, Vol. 5, No.6, 1989, 752–764Google Scholar
  5. [5]
    H. Wolfson, Solving jigsaw puzzles by computer, in Annals of Operations Research, No. 12, 1988, 51–64Google Scholar
  6. [6]
    H. Bunke, U. Bühler, 2-D invariant shape recognition using string matching, Proc. 2nd Int. Conf. on Automation, Robotics and Computer Vision, 1992, CV20.1.1-CV 20.1.5Google Scholar
  7. [7]
    H. Bunke, T. Glauser, Viewpoint independent representation and recognition of polygonal faces in 3-D space, accepted for publication in IEEE Trans. on Robotics and Automation. To appear 1993Google Scholar
  8. [8]
    R.A. Wagner, M.J. Fischer, The string-to-string correction problem, in Journal of ACM Vol. 21, No. 1, 1974, 168–173 3–21Google Scholar
  9. [9]
    H. Bunke, Recent advances in string matching, in H. Bunke (ed.): Advances in structural and syntactic pattern recognition, World Scientific Publ. Co., 1993, 3–21Google Scholar
  10. [10]
    H. Tamura, S. Sakane, F. Tomita, N. Yokoya, M. Komeko, K. Sakane, Design and implementation of SPIDER — a transportable image processing software package, in Computer Vision, Graphics, and Image Processing 23, 1983, 273–294Google Scholar
  11. [11]
    R. Sastry, N. Ranganathan, H. Bunke, Systolic architectures for partial polygon recognition, in H. Bunke (ed.): Advances in structural and syntactic pattern recognition, World Scientific Publ. Co., 1993, 542–551Google Scholar
  12. [12]
    G. Kaufmann, Puzzle Solving Using Computer Vision, MS Thesis, University of Bern, Switzerland, 1992 (in German)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  1. 1.Institut für Informatik und angewandte MathematikUniversität BernBernSwitzerland

Personalised recommendations