A small target motion detection algorithm in complex dynamic environment
Bibliographic record
Abstract
Small object motion detection in complex dynamic environments has long been a challenge in computer vision due to the limited visual features of small objects and the presence of numerous fake features in the complex background.Biological studies revealed a specialized class of neurons in the insect brain, known as small target motion detectors (STMDs), which possess the remarkable ability to flawlessly detect small object motion within the visual field.Inspired by this remarkable biological discovery, researchers proposed various small object motion detection visual networks that demonstrate promising performance in detecting small object motion.However, these visual networks lack the capability to effectively filter out background fake features, which leads to a significant number of fake features in their detection results.To address this challenge, in this paper, we propose a novel visual neural network inspired by the insect visual system and the differential responses of STMD neurons to targets and background fake feature, capable of detecting small objects and eliminating background fake features.Our visual network primarily consists of two stages: a motion information processing stage and a response discrimination stage.The motion information processing stage detects object motion by extracting object motion information, while the response discrimination stage discriminates between small objects and background fake features by utilizing the response information from the motion information processing stage.Experimental results demonstrate that our visual network successfully filters out background false positives and performs significantly better in detecting small targets in complex dynamic backgrounds.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
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".