An Innovative Algorithm for Solving Jigsaw Puzzles Using Geometrical and Color Features

  • M. Makridis
  • N. Papamarkos
  • C. Chamzas
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3773)

Abstract

The proposed technique deals with jigsaw puzzles and takes advantage of both geometrical and color features. It is considered that an image is being divided into pieces. The shape of these pieces is not predefined, yet the background’s color is. The whole method concerns a recurrent algorithm, which initially, finds the most important corner points around the contour of a piece, afterwards performs color segmentation with a Kohonen’s SOFM based technique and finally uses a comparing routine. This routine is based on the corner points found before. It compares a set of angles, the color of the image around the region of the corner points, the color of the contour and finally compares sequences of points by calculating the Euclidean distance of luminance between them. At a final stage the method decides which pieces match. If the result is not satisfying, the algorithm is being repeated with new adaptive modified parameter values as far as the corner points and the color segmentation is concerned.

Keywords

Image Reconstruction Corner Point Candidate Point Contour Boundary Color Segmentation 
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.

References

  1. 1.
    Freeman, H., Gardner, L.: Apictorial jigsaw puzzles: The computer solution of a problem in pattern recognition. IEEE Trans. on Electronic Computers 13, 118–127 (1964)CrossRefGoogle Scholar
  2. 2.
    Kong, W., Kimia, B.B.: On solving 2D and 3D puzzles using curve matching. In: Proc. IEEE Computer Vision and Pattern Recognition (2001)Google Scholar
  3. 3.
    da Gama Leitao, H.C., Stolfi, J.: Automatic reassembly of irregular fragments. Tech. Report IC-98-06, Univ. of Campinas (1998)Google Scholar
  4. 4.
    da Gama Leitao, H.C., Stolfi, J.: Information Contents of Fracture Lines. Tech. Report IC-99-24, Univ. of Campinas (1999)Google Scholar
  5. 5.
    Leutwyle, K.: Solving a digital jigsaw puzzle, http://www.sciam.com/explorations/2001/062501fresco/
  6. 6.
    Levoy, M.: The digital Forma Urbis Romae project, http://www.graphics.stanford.edu/projects/forma-urbis/
  7. 7.
    Wang, C.: Determining the Molecular Conformation from Distance or Density Data. PhD thesis, Department of Electrical Engineering and Computer Science, MIT (2000)Google Scholar
  8. 8.
    Papamarkos, N., Atsalakis, A., Strouthopoulos, C.: Adaptive Color Reduction. IEEE Trans. on Systems, Man, and Cybernetics-Part B 32(1), 44–56 (2002)CrossRefGoogle Scholar
  9. 9.
    Papamarkos, N.: Color reduction using local features and a SOFM neural network. Int. Journal of Imaging Systems and Technology 10(5), 404–409 (1999)CrossRefGoogle Scholar
  10. 10.
    Atsalakis, A., Papamarkos, N., Kroupis, N., Soudris, D., Thanailakis, A.: A Color Quantization Technique Based On Image Decomposition and Its Hardware Implementation. IEE Proceedings Vision, Image and Signal Processing 151, 511–524 (2004)CrossRefGoogle Scholar
  11. 11.
    Wolfson, H.: On curve matching. PAMI 12, 483–489 (1990)Google Scholar
  12. 12.
    Chetverikov, D.: Zs. Szabo. A Simple and E_cient Algorithm for Detection of High Curvature Points in Planar Curves. In: M. Vincze, editor, Robust Vision for Industrial Applications, volume 128 of Schriftenreihe der Osterreihicshen Computer Gesellschaft, pp. 175,184, Steyr, Austria, Osterreihicshe Computer Gesellschaft (1999)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • M. Makridis
    • 1
  • N. Papamarkos
    • 1
  • C. Chamzas
    • 1
  1. 1.Image Processing and Multimedia Laboratory, Department of Electrical & Computer EngineeringDemocritus University of ThraceXanthiGreece

Personalised recommendations