Efficient and fast predictive block motion estimation for low bit rate video coding
Bibliographic record
Abstract
An efficient block based motion estimation algorithm is proposed and evaluated for performance improvement. Spatio-temporal correlation characteristics and histograms of motion vector magnitude and direction are investigated through computer simulation with test video sequences. Its initial search pixel location is predicted spatially from the neighboring macro block in the current picture frame. In order to utilize center oriented motion vector characteristics from the histogram analysis, fast estimation algorithms such as three step search, diamond search, 2D logarithmic search and 1-D gradient search are evaluated and compared in terms of its search performance with respect to Euclidean search distance. A new predictive 1-D gradient search algorithm is proposed which shows the best results for motion video having moderate motion inside and is applicable for low bit rate video coding such as video telephony. Computer simulation using test video sequences in the H.263 framework shows that the proposed algorithm reduces computation cost measured in the number of SAD calculations. Its compression quality represented in terms of PSNR is improved further than conventional methods by controlling the search termination condition. It is proved that the proposed algorithm improves the search speed as well as PSNR performance of 1-D gradient motion estimation and outperformed other fast algorithms with respect to search speed. Furthermore, its search performance can be traded off with computation cost according to application requirements.
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.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 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".