Learn More
In the square jigsaw puzzle problem one is required to reconstruct the complete image from a set of non-overlapping, unordered, square puzzle parts. Here we propose a fully automatic solver for this problem, where unlike some previous work, it assumes no clues regarding parts' location and requires no prior knowledge about the original image or its(More)
The jigsaw puzzle is a well known problem, which many encounter during childhood. Given a set of parts, one needs to reconstruct the original image. This problem is known to be NP-complete. In this paper I describe a greedy solver with several improvements. Before discussing the general idea and improvements, I will discuss some important known metrics that(More)
  • 1