MétaCan
Menu
Back to cohort
Record W4396974164 · doi:10.23977/jaip.2024.070207

Vision Recognition and Positioning Optimization of Industrial Robots Based on Deep Learning

2024· article· en· W4396974164 on OpenAlexvenueno aff
Xiran Su

Bibliographic record

VenueJournal of Artificial Intelligence Practice · 2024
Typearticle
Languageen
FieldEngineering
TopicAdvanced Algorithms and Applications
Canadian institutionsnot available
Fundersnot available
KeywordsArtificial intelligenceComputer visionComputer scienceRobotDeep learningHuman–computer interaction

Abstract

fetched live from OpenAlex

Visual recognition and positioning optimization of industrial robots play a vital role in automatic production. Aiming at this problem, this study proposes a method of visual recognition and positioning optimization based on deep learning, namely, Multi-Scale Attention-based Deep Learning Visual Localization Network (MSA-DLVN). By introducing a multi-scale attention mechanism, this method can effectively improve the visual perception and positioning accuracy of industrial robots in complex environments. The comparative experiments on real scene data sets show that MSA-DLVN method is significantly superior to traditional methods in visual positioning optimization and workpiece recognition. Specifically, the positioning accuracy of MSA-DLVN method is 1.3cm higher than that of baseline method, and the accuracy of workpiece identification is 9 percentage points higher. In addition, MSA-DLVN method maintains good robustness and universality in different experimental scenarios and data sets. This study provides a reliable solution for industrial robot visual recognition and positioning optimization, which is helpful to promote the development of industrial automation production.

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.001
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.009
Threshold uncertainty score0.018

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
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.049
GPT teacher head0.321
Teacher spread0.272 · 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

Citations0
Published2024
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Artificial Intelligence PracticeSame topicAdvanced Algorithms and ApplicationsFrench-language works237,207