MétaCan
Menu
Back to cohort
Record W2166011696 · doi:10.1109/crv.2007.40

Images Restoration Using an Iterative Dynamic Programming Approach

2007· article· en· W2166011696 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
TopicAdvanced Image Processing Techniques
Canadian institutionsLaurentian University
Fundersnot available
KeywordsGrayscaleStreakImage restorationComputer scienceDynamic programmingImpulse noiseArtificial intelligenceNoise (video)Computer visionMinificationGaussian noiseIterative methodImpulse (physics)AlgorithmMathematical optimizationImage (mathematics)PixelImage processingMathematics

Abstract

fetched live from OpenAlex

A novel image restoration algorithm is presented in this paper. The restoration problem is formulated under the energy minimization framework and is solved using a dynamic programming-based approach. Through applying dynamic programming iteratively along both horizontal and vertical scanlines, the new algorithm can quickly converge to a near-global-optimal solution, without suffering the so-called streak artifacts. Experiments on both grayscale and color images demonstrate that the presented algorithm can effectively remove Gaussian noise and impulse noise from corrupted images, as well as to restore images with missing intensity values.

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.001
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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.943
Threshold uncertainty score0.451

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.003
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.031
GPT teacher head0.344
Teacher spread0.313 · 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

Citations1
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Image Processing TechniquesFrench-language works237,207