Abstract
The most challenging aspect of rebuilding the puzzle is finding out the right pair of pieces of the image. To do this, we need, an accurate estimation of the pairwise compatibility measure between local patches and the assembly strategy. In this paper, we propose a novel pairwise compatibility measure for the assembly of computational square jigsaw puzzles using Gist and color distance. This possible combination of gradient and color features improves the assembling pieces and can deal with the majority of the problems encountered in state-of-the-art. We also propose the rotation-based strategy to enable working on multiple parts and rebuild completed puzzles from local matching candidates. The experimental results on the frequently used data-sets sufficiently show that the suggested compatibility metric surpasses the latest approaches.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of King Saud University - Computer and Information Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
