Title :
A metaheuristic approach for solving jigsaw puzzles
Author :
Ghasemzadeh, Hassan
Abstract :
Puzzle solving is the art of pattern recognition which has found many applications in different areas such as restoration and reconstruction of archeological findings, repairing of broken objects, solving jigsaw puzzles, molecular docking problem, etc. There are two inherent problems in solving a general jigsaw puzzle; one is how to search through possible arrangements efficiently. The other one is devising some piece matching technique. To our best knowledge, current literature lacks a thorough investigation of the first problem. This paper investigates this problem in depth. Furthermore, different metaheuristic approaches to solve this problem are explored.
Keywords :
ant colony optimisation; genetic algorithms; pattern matching; search problems; simulated annealing; ant colony optimisation; genetic algorithms; jigsaw puzzle solving; metaheuristic approach; pattern recognition; piece matching technique; simulated annealing; Accuracy; Biological cells; Complexity theory; Genetic algorithms; Simulated annealing; Sociology; Statistics; Genetic Algorithm; Jigsaw Puzzle; Max-Min Ant Colony System; Simulated Annealing;
Conference_Titel :
Intelligent Systems (ICIS), 2014 Iranian Conference on
Conference_Location :
Bam
Print_ISBN :
978-1-4799-3350-1
DOI :
10.1109/IranianCIS.2014.6802604