MétaCan
Menu
Back to cohort
Record W2166727092 · doi:10.1109/crv.2013.54

Robust Solvers for Square Jigsaw Puzzles

2013· article· en· W2166727092 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicImage Processing and 3D Reconstruction
Canadian institutionsUniversity of Manitoba
Fundersnot available
KeywordsJigsawRobustness (evolution)Computer scienceSolverPairwise comparisonArtificial intelligenceAlgorithmTheoretical computer scienceMathematicsProgramming language

Abstract

fetched live from OpenAlex

A jigsaw puzzle solver reconstructs the original image from a given collection of non-overlapping image fragments using their color and shape information. In this paper we introduce new techniques for solving square jigsaw puzzles (with no prior knowledge of the initial image) that improves the accuracy of the state-of-the-art jigsaw puzzle solvers. While the current puzzle solving techniques are based on finding enhanced compatibility metrics across piece boundaries, we combine the existing techniques to achieve higher accuracy and robustness, i.e., our solver outperforms the known solvers even when the piece boundaries are imprecise. Unlike the most successful puzzle solvers that use greedy pairwise compatibility metrics among puzzle boundaries, we incorporate global information that enhances performance. As a step towards the future goal of developing an automated assembler for real-life corrupted image fragments or shredded documents, we examine puzzles that are corrupted by noise. Our proposed compatibility metrics shows robustness even in such scenarios.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.923
Threshold uncertainty score0.274

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

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.

Opus teacher head0.025
GPT teacher head0.214
Teacher spread0.189 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations21
Published2013
Admission routes1
Has abstractyes

Explore more

Same topicImage Processing and 3D ReconstructionFrench-language works237,207