Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Automated solutions to incomplete jigsaw puzzles

Automated solutions to incomplete jigsaw puzzles The jigsaw puzzle re-assembly problem has been investigated only intermittently in the research literature. One potential theoretical line of research concerns jigsaw puzzles that do not have a complete set of puzzle pieces. These incomplete puzzles represent a difficult aspect of this problem that is outlined but can not be resolved in the current research. The computational experiments conducted in this paper demonstrate that the proposed re-assembly algorithm being optimised to re-assemble the complete jigsaw puzzles is not efficient when applied to the puzzles with missing pieces. Further work was undertaken to modify the proposed algorithm to enable efficient re-assembly of incomplete jigsaw puzzles. Consequently, a heuristic strategy, termed Empty Slot Prediction, was developed to support the proposed algorithm, and proved successful when applied to certain sub-classes of this problem. The results obtained indicate that no one algorithm can be used to solve the multitude of possible scenarios involved in the re-assembly of incomplete jigsaw puzzles. Other variations of the jigsaw puzzle problem that still remain unsolved are presented as avenues for future research. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Artificial Intelligence Review Springer Journals

Automated solutions to incomplete jigsaw puzzles

Artificial Intelligence Review , Volume 32 (4) – Oct 24, 2009

Loading next page...
 
/lp/springer-journals/automated-solutions-to-incomplete-jigsaw-puzzles-VfKmxOa6xF

References (6)

Publisher
Springer Journals
Copyright
Copyright © 2009 by Springer Science+Business Media B.V.
Subject
Computer Science; Computer Science, general; Artificial Intelligence (incl. Robotics)
ISSN
0269-2821
eISSN
1573-7462
DOI
10.1007/s10462-009-9134-5
Publisher site
See Article on Publisher Site

Abstract

The jigsaw puzzle re-assembly problem has been investigated only intermittently in the research literature. One potential theoretical line of research concerns jigsaw puzzles that do not have a complete set of puzzle pieces. These incomplete puzzles represent a difficult aspect of this problem that is outlined but can not be resolved in the current research. The computational experiments conducted in this paper demonstrate that the proposed re-assembly algorithm being optimised to re-assemble the complete jigsaw puzzles is not efficient when applied to the puzzles with missing pieces. Further work was undertaken to modify the proposed algorithm to enable efficient re-assembly of incomplete jigsaw puzzles. Consequently, a heuristic strategy, termed Empty Slot Prediction, was developed to support the proposed algorithm, and proved successful when applied to certain sub-classes of this problem. The results obtained indicate that no one algorithm can be used to solve the multitude of possible scenarios involved in the re-assembly of incomplete jigsaw puzzles. Other variations of the jigsaw puzzle problem that still remain unsolved are presented as avenues for future research.

Journal

Artificial Intelligence ReviewSpringer Journals

Published: Oct 24, 2009

There are no references for this article.