Sequence Matching Genetic Algorithm for Square Jigsaw Puzzles

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18450%2F14%3A50002589" target="_blank" >RIV/62690094:18450/14:50002589 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1007/978-3-662-44654-6" target="_blank" >http://dx.doi.org/10.1007/978-3-662-44654-6</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-662-44654-6" target="_blank" >10.1007/978-3-662-44654-6</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Sequence Matching Genetic Algorithm for Square Jigsaw Puzzles

Popis výsledku v původním jazyce

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 algorithmsto 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 positionin 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.

Název v anglickém jazyce

Sequence Matching Genetic Algorithm for Square Jigsaw Puzzles

Popis výsledku anglicky

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 algorithmsto 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 positionin 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.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

V - Vyzkumna aktivita podporovana z jinych verejnych zdroju

Rok uplatnění

2014

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

IFIP Advances in information and communication technology

ISSN

1868-4238

e-ISSN

—

Svazek periodika

436

Číslo periodika v rámci svazku

Neuveden

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

8

Strana od-do

317-324

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—