The DOI matches its Crossref record.
Predictive Coding Based on Efficient Motion Estimation
Abstract
A computationally simpler and effective method is proposed for estimating motion in a video sequence. The paper outlines a search technique based on conjugate directions [3], [4] and another simpler technique called the one-at-a-time search [3]. Based on the comparison of the two methods, the latter technique is adopted as the basis for further research. The adopted technique is compared with brute force search, existing 2-D logarithmic search [1], and a modified version of it [2], for motion compensated prediction [5].
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
A new three-step search algorithm for block motion estimation
Li, R., Zeng, B., & Liou, M. L. (1994) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/76.313138 · Cited by 1,536
VLSI architectures for video compression-a survey
Pirsch, P., Demassieux, N., & Gehrke, W. (1995) · Proceedings of the IEEE · doi:10.1109/5.364465 · Cited by 294
Metadata
- Authors
- Srinivasan, R., & Rao, K.
- Venue
- IEEE Transactions on Communications
- Published
- 1985-08
- Volume
- 33
- Issue
- 8
- Pages
- 888-896
- ISSN
- 0096-2244 (ISSN-L)
- OpenAlex
- W2020182573
- Cited by
- 487
- References
- 0
- FWCI
- 6.13
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Predictive Coding Based on Efficient Motion Estimation. https://app.cochat.ai/papers/10.1109/tcom.1985.1096398
- The paper
- Srinivasan, R., & Rao, K. (1985). Predictive Coding Based on Efficient Motion Estimation. IEEE Transactions on Communications. https://doi.org/10.1109/tcom.1985.1096398
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
