Journal ArticleDOI
Automated solutions to incomplete jigsaw puzzles
Robert Tybon,Donald Kerr +1 more
Reads0
Chats0
TLDR
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, and indicates that no one algorithm can be used to solve the multitude of possible scenarios involved in the re-Assembly of incompleteJigsaw puzzles.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.read more
Citations
More filters
Proceedings ArticleDOI
From Square Pieces to Brick Walls: The Next Challenge in Solving Jigsaw Puzzles
Shir Gur,Ohad Ben-Shahar +1 more
TL;DR: It is argued that solving brick wall puzzles may be reduced to finding the correct offset between two neighboring pieces, and performance can be made comparable to the state-of-the-art in solving the simpler square piece puzzles.
Journal ArticleDOI
An alternative clustering approach for reconstructing cross cut shredded text documents
TL;DR: This paper proposes a clustering approach for solving the problem of reconstructing cross-cut shredded documents and defines a new cost function which mainly relies on black pixels to measure the cost of pairing two shreds together.
Proceedings ArticleDOI
Plane-curve-based matching for broken bronze mirror reassembling
TL;DR: Wang et al. as discussed by the authors used watershed algorithm to segment and mark each fracture, and the longest common curve was found by combining corners detection, coarse matching and fine matching, taking length, angle and curvature into account.
References
More filters
Journal ArticleDOI
Some simplified NP-complete graph problems
TL;DR: This paper shows that a number of NP - complete problems remain NP -complete even when their domains are substantially restricted, and determines essentially the lowest possible upper bounds on node degree for which the problems remainNP -complete.
Proceedings ArticleDOI
A global approach to automatic solution of jigsaw puzzles
TL;DR: The overall strategy follows that of previous algorithms but applies a number of new ideas, such as robust fiducial points, "highest- confidence-first" search, and frequent global reoptimization of partial solutions.
Journal ArticleDOI
A shape and image merging technique to solve jigsaw puzzles
Fenghui Yao,Guifeng Shao +1 more
TL;DR: An algorithm for solving subsets of typical (canonical) jigsaw puzzles that combines shape and image matching with a cyclic "growth" process that tries to place pieces in their correct positions is proposed.
Journal ArticleDOI
Solving the jigsaw puzzle problem in linear time
TL;DR: An algorithm is introduced that efficiently matches parts of boundaries of two-dimensional objects in order to assemble apictorial jigsaw puzzles using Weiner's string matching technique combined with compact position trees to find the longest shared pattern between two strings.
Journal ArticleDOI
Hierarchical hypernet for pipelining
TL;DR: A new hierarchical hypernet which is an extension of hypernet suggested by Hwang and Ghosh is proposed which is suitable for pipelining and hence the speed up achieved in various algorithms is illustrated using space time diagrams.