Sequence Matching Genetic Algorithm for Square Jigsaw Puzzles

Abstract : Our paper presents a new method for solving the rectangle piece jigsaw puzzle problem. The puzzle image is RGB full color and because of uniform shape of the individual pieces the process of puzzle assembly is based on information of the pixel values along the border line of the piece only. We have utilized a genetic algorithm that searches for the optimal piece arrangement using dissimilarity between adjacent pieces as the measure of progress. Unlike the previous attempts to utilize genetic algorithms to solve the problem, we have proposed a new heuristic asexual operator that aims at identification of points of fraction within partially assembled picture, extraction of supposed sequence of correctly joint pieces, and its insertion into a new position in such a way that, if possible, the segment is enlarged. Our approach has been successfully tested and the algorithm is capable of solving puzzles consisting of several hundred pieces.
Document type :
Conference papers
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal.inria.fr/hal-01391329
Contributor : Hal Ifip <>
Submitted on : Thursday, November 3, 2016 - 11:00:14 AM
Last modification on : Friday, December 1, 2017 - 1:16:36 AM
Long-term archiving on : Saturday, February 4, 2017 - 1:09:15 PM

File

978-3-662-44654-6_31_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Josef Hynek. Sequence Matching Genetic Algorithm for Square Jigsaw Puzzles. 10th IFIP International Conference on Artificial Intelligence Applications and Innovations (AIAI), Sep 2014, Rhodes, Greece. pp.317-324, ⟨10.1007/978-3-662-44654-6_31⟩. ⟨hal-01391329⟩

Share

Metrics

Record views

100

Files downloads

345