MétaCan
Menu
Back to cohort
Record W3111820836 · doi:10.18280/ts.370511

An Automatic Insect Recognition Algorithm in Complex Background Based on Convolution Neural Network

2020· article· en· W3111820836 on OpenAlexvenueno aff
Xianrong Zhang, Gang Chen

Bibliographic record

VenueTraitement du signal · 2020
Typearticle
Languageen
FieldAgricultural and Biological Sciences
TopicSmart Agriculture and AI
Canadian institutionsnot available
Fundersnot available
KeywordsArtificial intelligenceComputer sciencePattern recognition (psychology)Convolution (computer science)Image (mathematics)Enhanced Data Rates for GSM EvolutionSet (abstract data type)Artificial neural networkAlgorithmComputer vision

Abstract

fetched live from OpenAlex

The existing insect recognition methods mostly segment the target region by traditional classification technology, failing to achieve a high accuracy in complex background. To solve the problem, this paper introduces the morphology-based edgeless active contour strategy to segment insects in complex background. The strategy integrates the morphological operation of gray image, and detects insect contours by narrow-band fast method. To enhance the background diversity of new samples, the authors improved the synthetic minority over-sampling technique (SMOTE) algorithm into a variable weight edge enhancement algorithm. Based on the SMOTE algorithm, the proposed algorithm increases the weight of the edge area as adjacent images are superimposed into a new image, making the background of the new image more complex. Finally, the proposed method was coupled with DenseNet-121 to recognize insects in images with complex background. The results show that the accuracy of the network was nearly 10% higher on the balanced set than on the unbalanced set, suggesting that our method is feasible and accurate.

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.000
metaresearch head score (Gemma)0.000
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.007
Threshold uncertainty score0.014

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
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.079
GPT teacher head0.234
Teacher spread0.156 · 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 designBench or experimental
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

Citations13
Published2020
Admission routes1
Has abstractyes

Explore more

Same venueTraitement du signalSame topicSmart Agriculture and AIFrench-language works237,207