MétaCan
Menu
Back to cohort
Record W1997803708 · doi:10.1109/icip.2011.6115689

Two-step super-resolution technique using bounded total variation and bisquare M-estimator under local illumination changes

2011· article· en· W1997803708 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 institutionsCarleton University
Fundersnot available
KeywordsUpsamplingArtificial intelligenceEstimatorComputer scienceSuperresolutionComputer visionImage resolutionFocus (optics)Iterative reconstructionImage (mathematics)Bounded functionImage registrationResolution (logic)Frame (networking)AlgorithmMathematicsOpticsStatistics

Abstract

fetched live from OpenAlex

In this paper, we present a super-resolution (SR) technique for images having arbitrarily-shaped local illumination changes. These variations tend to degrade the performance of the image registration, and hence impact the SR image reconstruction. Conventional SR techniques focus on enhancing the reconstruction step assuming aligned images. In this paper, we exploit our recent registration approach of images having illumination variations using a robust bisquare M-estimation. Then, we extend a bounded total variation-based approach for upsampling single frames to super-resolving multi-frames in order to reconstruct the unknown high-resolution (HR) frame. The proposed SR technique shows clear improvements over competing techniques in terms of objective metrics using simulated and real image pairs with illumination variations.

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

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.002
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.036
GPT teacher head0.282
Teacher spread0.246 · 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

Citations3
Published2011
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Image Processing TechniquesFrench-language works237,207