Li Ru, Liu Shuaicheng, Wang Guangfu, Liu Guanghui, Zeng Bing
IEEE Trans Image Process. 2022;31:513-524. doi: 10.1109/TIP.2021.3120052. Epub 2021 Dec 16.
The paper proposes a solution based on Generative Adversarial Network (GAN) for solving jigsaw puzzles. The problem assumes that an image is divided into equal square pieces, and asks to recover the image according to information provided by the pieces. Conventional jigsaw puzzle solvers often determine the relationships based on the boundaries of pieces, which ignore the important semantic information. In this paper, we propose JigsawGAN, a GAN-based auxiliary learning method for solving jigsaw puzzles with unpaired images (with no prior knowledge of the initial images). We design a multi-task pipeline that includes, (1) a classification branch to classify jigsaw permutations, and (2) a GAN branch to recover features to images in correct orders. The classification branch is constrained by the pseudo-labels generated according to the shuffled pieces. The GAN branch concentrates on the image semantic information, where the generator produces the natural images to fool the discriminator, while the discriminator distinguishes whether a given image belongs to the synthesized or the real target domain. These two branches are connected by a flow-based warp module that is applied to warp features to correct the order according to the classification results. The proposed method can solve jigsaw puzzles more efficiently by utilizing both semantic information and boundary information simultaneously. Qualitative and quantitative comparisons against several representative jigsaw puzzle solvers demonstrate the superiority of our method.
本文提出了一种基于生成对抗网络(GAN)的解决拼图问题的方法。该问题假设一幅图像被分割成大小相等的正方形小块,并要求根据这些小块提供的信息恢复图像。传统的拼图求解器通常基于小块的边界来确定它们之间的关系,而忽略了重要的语义信息。在本文中,我们提出了JigsawGAN,一种基于GAN的辅助学习方法,用于解决具有未配对图像(对初始图像没有先验知识)的拼图问题。我们设计了一个多任务管道,其中包括:(1)一个分类分支,用于对拼图排列进行分类;(2)一个GAN分支,用于按正确顺序将特征恢复为图像。分类分支受到根据打乱的小块生成的伪标签的约束。GAN分支专注于图像语义信息,其中生成器生成自然图像以欺骗判别器,而判别器则区分给定图像是属于合成目标域还是真实目标域。这两个分支通过一个基于流的扭曲模块连接,该模块根据分类结果对特征进行扭曲以校正顺序。所提出的方法通过同时利用语义信息和边界信息,可以更有效地解决拼图问题。与几种有代表性的拼图求解器进行的定性和定量比较证明了我们方法的优越性。