MétaCan
Menu
Back to cohort

Colour Image Gradient Regression Reintegration

2018· article· en· W2909240331 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

VenueColor and Imaging Conference · 2018
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Vision and Imaging
Canadian institutionsSimon Fraser University
FundersEngineering and Physical Sciences Research Council
KeywordsImage (mathematics)RegressionArtificial intelligenceComputer scienceComputer visionStatisticsMathematics

Abstract

fetched live from OpenAlex

Suppose we process an image and alter the image gradients in each colour channel R,G,B. Typically the two new x and y component fields p,q will be only an approximation of a gradient and hence will be nonintegrable. Thus one is faced with the problem of reintegrating the resulting pair back to image, rather than derivative of image, values. This can be done in a variety of ways, usually involving some form of Poisson solver. Here, in the case of image sequences or video, we introduce a new method of reintegration, based on regression from gradients of log-images. The strength of this idea is that not only are Poisson reintegration artifacts eliminated, but also we can carry out the regression applied to only thumbnail images. The novel approach here is to regress derivatives (using only thumbnails) and then replace reintegration itself by the much simpler use of the resulting regression coefficients on non-derivative, full-size images. We investigate the utility of the method by applying it to the intrinsic-image problem as a first test, and then also to the night-to-day problem as a second test. We find that the new algorithm performs well, and is fast. Moreover eliminating Poisson artifacts results in clearer, more sharp output images that can show far less ghosting.

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

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.016
GPT teacher head0.292
Teacher spread0.276 · 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