Genetic-based square jigsaw puzzle solver using the combined color+texture compatibility criterion
Bibliographic record
Abstract
When reconstructing jigsaw puzzles, the state-of-the-art algorithms struggle to distinguish between identically colored pieces that belong to different objects. This limitation significantly impacts the accuracy of puzzle solvers, especially in complex images with repetitive colors or textures. To address this issue, we propose a new GA-based square jigsaw puzzle solver. A combined color and texture discriminator is incorporated into the proposed solver to prevent pieces that have the same color but come from distinct objects from being joined together incorrectly. Color and texture features are extracted separately using the sum of square distances and Gabor filter. To evaluate the performance of the proposed solver, we used a dataset consisting 66 images: 20 puzzles with 432 pieces from the MIT collection, 20 puzzles with 540 pieces, and 20 puzzles with 805 pieces from the McGill collection, and 3 puzzles with 2360 pieces, and 3 puzzles with 3300 pieces from the Pomeranz collection. For the direct, neighbor, and largest component comparisons, the proposed method’s accuracy is 92.91%, 96.66%, and 90.83%, respectively. The proposed method demonstrates an improvement of 11.9%, and 3.65% in accuracy based on direct and neighbor comparison criteria, on the database images when compared to current state-of-the-art GA-based square jigsaw puzzle solver.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".