MétaCan
Menu
Back to cohort
Record W2010792847 · doi:10.1109/icdar.2013.105

A Probabilistic Model for Reconstruction of Torn Forensic Documents

2013· article· en· W2010792847 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 Alberta
Fundersnot available
KeywordsProbabilistic logicComputer scienceSet (abstract data type)Process (computing)Subject (documents)Data miningArtificial intelligenceOrder (exchange)Information retrievalWorld Wide Web

Abstract

fetched live from OpenAlex

In this paper we present a probabilistic approach to reconstruct a document from its torn pieces which is extremely helpful for the legal system. The method investigates several previously unexplored issues and proposes probabilistic dependencies of different (available) parts (or pieces) of a document. It iteratively calculates the probability of an arrangement subject to some constraints and attempts to produce the best possible configuration (or solution) using low level image statistics. The reconstruction method also ranks different (final) arrangements in order to help decision making process. Two types of data were used in the investigation. A set of documents where documents were torn naturally (as we do it in our daily life) and the second set consisting of documents that were torn to destroy particular evidences. Evaluation shows that the method is quite robust to tackle both the problems.

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: none
Teacher disagreement score0.978
Threshold uncertainty score0.223

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.015
GPT teacher head0.234
Teacher spread0.219 · 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

Citations4
Published2013
Admission routes1
Has abstractyes

Explore more

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