Algorithm design for optimizing color analysis and teaching effect in oil paintings with AI technology support
Bibliographic record
Abstract
This paper discusses the application of AI color analysis technology in oil painting teaching, combined with experiments to verify its effect on improving teaching quality.Firstly, the core algorithm of AI color analysis technology is analyzed, and the implementation scheme of digital image sharpening preprocessing is proposed based on the RGB color model, and the edge and color information of the image is extracted based on the improved Canny operator.Improved GAN completes the reconstruction of the oil painting image, and the characteristic colors of the oil painting are extracted using the optimized K-means clustering algorithm.The oil painting images are selected for color feature analysis, and the color matching scheme is improved based on the color feature results to construct the color analysis process based on AI technology in oil painting teaching.Finally, students from art colleges were selected as the research subjects, and a control experiment was designed to investigate the effect of AI color analysis in teaching.The p-value of the five factors of the experimental group and the control group's post-test scores of creativity of modeling, application of color, color richness, emotional tendency of color and expression of the theme are all less than 0.05, and the average scores of the experimental group in these five aspects, 3.66, 3.74, 3.85, 3.77, 3.34, are all significantly larger than those of the control group, which indicates that the experimental group using AI color analysis to assist teaching has significantly widened the gap between the control group and the experimental group in terms of the use of color.It shows that the experimental group using AI color analysis to assist teaching has a significant gap with the control group in the use of color.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".