MétaCan
Menu
Back to cohort
Record W2681199647 · doi:10.1109/ccece.2017.7946596

Data-driven image stylization using graph-based filtering

2017· article· en· W2681199647 on OpenAlex
Hamidreza Sadreazami, Amir Asif, Arash Mohammadi

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
TopicComputer Graphics and Visualization Techniques
Canadian institutionsConcordia University
Fundersnot available
KeywordsComputer scienceArtificial intelligenceStylized factComputer visionGraphLuminanceFilter (signal processing)Pattern recognition (psychology)Theoretical computer science

Abstract

fetched live from OpenAlex

In this work, we consider the problem of image abstraction and stylization. A graph-based framework is proposed to render real images into painterly-style ones and create a simple stylized format from color images. The goal is to abstract images by simplifying their visual content while preserving edges and emphasizing most of the perceptually important information. To this end, the low-contrast regions of an image are first smoothened using iterative graph filters in both the vertex and spectral domains. The abstracted luminance channel is quantized and sharpened using an iterative highpass graph filter in the spectral domain. The effectiveness of the proposed graph-based image stylization method is verified through simulations. It is shown that the proposed method can yield significantly better visual quality for stylized images as compared to other existing works.

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 categoriesScholarly communication
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.987
Threshold uncertainty score1.000

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.0010.000
Scholarly communication0.0010.002
Open science0.0030.001
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.105
GPT teacher head0.372
Teacher spread0.267 · 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