MétaCan
Menu
Back to cohort
Record W2567338558 · doi:10.1109/crv.2016.29

Image Restoration via Deep-Structured Stochastically Fully-Connected Conditional Random Fields (DSFCRFs) for Very Low-Light Conditions

2016· article· en· W2567338558 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 institutionsUniversity of Waterloo
Fundersnot available
KeywordsConditional random fieldImage restorationArtificial intelligenceComputer scienceNoise (video)Image (mathematics)Computer visionRandom fieldSet (abstract data type)Image processingPattern recognition (psychology)MathematicsStatistics

Abstract

fetched live from OpenAlex

Very low-light conditions are problematic for current robotic vision algorithms as captured images are subject to high levels of ISO noise. We propose a novel deep-structured stochastically fully-connected conditional random field (DSFCRF) model for image restoration in very low-light conditions. The DSFCRF model combines the improved performance of deep-structured graphical models with the reduced complexity of stochastically fully-connected random fields. The proposed model was compared to state-of-the-art image restoration methods using a set of images contaminated with synthetically generated noise and a set of natural images captured in very low-light conditions. Experimental results indicate the potential of DSFCRFs for low-light image restoration.

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.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.678
Threshold uncertainty score0.636

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.002
Open science0.0010.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.007
GPT teacher head0.266
Teacher spread0.258 · 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
Published2016
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Image Processing TechniquesFrench-language works237,207