Improving the Motion Processing Hierarchy for Attending to Visual Motion
Bibliographic record
Abstract
Visual motion has been studied for decades now. Attention to motion using Selective Tuning involves a top-down selection mechanism within a feed-forward motion hierarchy. Researchers have proposed various models for the motion hierarchy. In this thesis, we introduce a learnable hierarchy, based on fully convolutional networks, ST-Motion-Net. The Selective Tuning model for visual attention is demonstrated on ST-Motion-Net to localize motion patterns and segment moving objects. We create two datasets, Blender-MP and Blender-Complex, to evaluate ST-Motion-Net on motion pattern detection, localization, and motion segmentation tasks. ST-Motion-Net achieves excellent performance on motion pattern detection and localization for each area of ST-Motion-Net. For motion segmentation, we evaluate 2-Frame-Area-V1 of ST-Motion-Net on the task. 2-Frame-V1 contains neurons that respond to translation motion, given 2 most recent frames of a temporal sequence. 2-Frame-V1 achieves 86.84% IoU on Blender-MP-Test, which surpass some state-of-the-art models. On Blender-Complex-Test, 2-Frame-V1 reaches 52.61% IoU, which also achieves state-of-the-art performance.
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.000 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.006 | 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".