Image Sequence Processing For Motion Detection And Estimation In Unstructured Environments
Bibliographic record
Abstract
In real-world decision and control applications requiring motion information as sensory input, the detection and estimation of motion from image sequences is constrained by the available computational resources (time,memory,cpu). In this context, a flexible image processing algorithm which can balance computational resources against desired accuracy in motion estimation has been developed. This algorithm extends the Multistage Hypothesis Testing algorithm [2] to detect and track moving objects in a computationally constrained environment. Unlike standard feature-based or gradient-based techniques for motion analysis, the extended MHT algorithm (1) integrates its motion estimates across multiple image frames, and (2) directs computational resources to the moving regions of interest. The MHT algorithm can be used to detect and track a variety of point and/or linear object features. The initial detection of object features is posed as a rate-constrained detection problem [l]. This ensures that the number of detected features does not overload the computational resources of the motion estimator. The MHT algorithm exploits the timeoptimality of sequential hypothesis testing (Truncated Sequential Probability Ratio Tests) to rapidly search the large space of possible feature trajectories. The resultant detected trajectories are clustered by the hypothesis-tree data structure of the MHT algorithm. This allows for robust motion estimation incorporating information from previous image frames. Multiple trajectory segments are then extended in time, yielding a set of feature trajectories in the image plane. Three-dimensional motion information is then extracted from these 2dimensional feature trajectories. The resulting system provides flexible and efficient motion detection and feature correspondence, within computational constraints, suitable for input to the motion estimation module of an intelligent autonomous system.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".