MétaCan
Menu
← Back to cohort

RAST 4.0: Restorable Arbitrary Style Transfer via Content Leakage Correction

2025· article· W7163158916 on OpenAlexaff
Yingnan Ma, Xudong Li, Anup Basu

Bibliographic record

Venuenot available
Typearticle
Language
FieldComputer Science
TopicNatural Language Processing Techniques
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsLeakage (economics)Quality (philosophy)Reliability (semiconductor)Metrology

Abstract

fetched live from OpenAlex

Style transfer aims to synthesize images by combining the content structure of one image with the target style. The RAST framework has been developed to enhance content fidelity through a multi-restoration mechanism. However, prior versions, such as RAST 1.0 and RAST 2.0, encountered issues related to color deviation and insufficient style embedding. In this work, we introduce the RAST 4.0 framework to refine the style transfer process. RAST 4.0 incorporates content leakage correction to maintain content integrity. Additionally, we modify the restoration process to optimize the style embedding performance, ensuring a more effective and balanced integration of style information. Extensive qualitative and quantitative experiments demonstrate that RAST 4.0 surpasses previous RAST frameworks and state-of-the-art methods in both content preservation and style consistency, while maintaining computational efficiency.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation 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: Empirical · Consensus signal: none
Teacher disagreement score0.008
Threshold uncertainty score0.026

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0020.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0080.004

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.020
GPT teacher head0.259
Teacher spread0.239 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicNatural Language Processing Techniques→French-language works237,207→