Siamese-Discriminant Deep Reinforcement Learning for Solving Jigsaw Puzzles with Large Eroded Gaps

نویسندگان

چکیده

Jigsaw puzzle solving has recently become an emerging research area. The developed techniques have been widely used in applications beyond solving. This paper focuses on Puzzles with Large Eroded Gaps (JPwLEG). We formulate the reassembly as a combinatorial optimization problem and propose Siamese-Discriminant Deep Reinforcement Learning (SD2RL) to solve it. A Q-network (DQN) is designed visually understand puzzles, which consists of two sets Siamese Discriminant Networks, one set perceive pairwise relations between vertical neighbors another for horizontal neighbors. proposed DQN considers not only evidence from incumbent fragment but also support its four trained using replay experience carefully rewards guide search sequence swaps reach correct solution. Two JPwLEG datasets are constructed evaluate method, experimental results show that SD2RL significantly outperforms state-of-the-art methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Square Jigsaw Puzzles with Loop Constraints

We present a novel algorithm based on “loop constraints” for assembling non-overlapping square-piece jigsaw puzzles where the rotation and the position of each piece are unknown. Our algorithm finds small loops of puzzle pieces which form consistent cycles. These small loops are in turn aggregated into higher order “loops of loops” in a bottom-up fashion. In contrast to previous puzzle solvers ...

متن کامل

Solving Jigsaw Puzzles with Linear Programming

We propose a novel Linear Program (LP) based formulation for solving jigsaw puzzles. We formulate jigsaw solving as a set of successive global convex relaxations of the standard NP-hard formulation, that can describe both jigsaws with pieces of unknown position and puzzles of unknown position and orientation. The main contribution and strength of our approach comes from the LP assembly strategy...

متن کامل

Unsupervised Learning of Visual Representations by Solving Jigsaw Puzzles

In this paper we study the problem of image representation learning without human annotation. Following the principles of selfsupervision, we build a convolutional neural network (CNN) that can be trained to solve Jigsaw puzzles as a pretext task, which requires no manual labeling, and then later repurposed to solve object classification and detection. To maintain the compatibility across tasks...

متن کامل

Solving nonogram puzzles by reinforcement learning

We study solvers of nonogram puzzles, which are good examples of constraint-satisfaction problems. Given an optimal solving module for solving a given line, we compare performance of three algorithmic solvers used to select the order in which to solve lines with a reinforcement-learningbased solver. The reinforcement-learning (RL) solver uses a measure of reduction of distance to goal as a rewa...

متن کامل

Solving Jigsaw Puzzles using Paths and Cycles

There has been a growing interest in image jigsaw puzzles with square shaped pieces. A solver takes as input square shaped patches of the same size belonging to an image and attempts to reconstruct the image. The key components of a jigsaw solver are a compatibility metric and an assembly algorithm. A compatibility metric uses the color content of the image patches to identify which pairs of pi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2023

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v37i2.25325