MétaCan
Menu
Back to cohort
Record W2806244818 · doi:10.1109/access.2018.2842202

Evolving Convolutional Neural Network and Its Application in Fine-Grained Visual Categorization

2018· article· en· W2806244818 on OpenAlexfundno aff
Qi Xuan, Haoquan Xiao, Chenbo Fu, Yi Liu

Bibliographic record

VenueIEEE Access · 2018
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Image and Video Retrieval Techniques
Canadian institutionsnot available
FundersNational Natural Science Foundation of ChinaCanadian Institute for Advanced ResearchNational Science Foundation
KeywordsComputer scienceConvolutional neural networkArtificial intelligenceCategorizationClassifier (UML)Pattern recognition (psychology)Class (philosophy)Deep neural networksMachine learningDeep learning

Abstract

fetched live from OpenAlex

Fine-grained visual categorization is one of the challenges in computer vision due to the high intra-class but low inter-class variances. Convolutional neural networks (CNNs) are widely used to solve this problem. However, a huge number of clearly labeled images are usually required to train a CNN model for a high precision, which may be quite costly and time consuming. To overcome this problem, in this paper, a novel evolving CNN (ECNN) is proposed, which can efficiently utilize the limited clearly labeled images and a large number of weakly labeled images. The overall framework contains two parts: one for collecting the weakly labeled images from the Internet by Web crawlers; and the other for updating the CNN classifier. Specifically, several different search engines are adopted to collect the weakly labeled images, in order to get relatively comprehensive results. The proposed method is demonstrated on several datasets, including CIFAR-10, Oxford pets, and Chinese food dataset. The results show that ECNN outperforms the traditional CNN and achieves the state-of-the-art in most cases.

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.002
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.020
Threshold uncertainty score0.040

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.002
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.023
GPT teacher head0.337
Teacher spread0.313 · 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

Citations22
Published2018
Admission routes1
Has abstractyes

Explore more

Same venueIEEE AccessSame topicAdvanced Image and Video Retrieval TechniquesFrench-language works237,207