Prediction-Based Flexible Triangle Search Algorithm for Block Based Motion Estimation
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
This paper presents a technique that predicts the initial search direction for the flexible triangle search algorithm (FTS), which was introduced in previous work by the authors. The FTS algorithm is a fast block-matching algorithm for block-based motion estimation. In the FTS, a search triangle is used to find the best matching blocks between two frames through successive iterations. During the search, the triangle changes its direction and size using reflection, expansion, contraction, and translation operations. These operations provide the triangle with the necessary flexibility to perform coarse or fine search and to locate the best matching blocks while checking fewer search positions compared to most other search algorithms. Analysis of the FTS behavior showed that the proper selection of the starting triangle for the search reduces the required number of block-matching evaluations by directing the search earlier in the direction of the minimum. In this paper, a prediction-based FTS, the PFTS, is introduced. In the PFTS, a prediction step is added to obtain the initial triangle for the search. Simulation results indicate that the PFTS requires a smaller number of block matching operations than that of the FTS. In addition, the compression ratio was improved slightly while the visual quality of the reconstructed sequence remained the same compared to the FTS
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.
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.000 |
| 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 it