The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Successive elimination algorithm for motion estimation
Abstract
The correspondence presents a fast exhaustive search algorithm for motion estimation. The basic idea is to obtain the best estimate of the motion vectors by successively eliminating the search positions in the search window and thus decreasing the number of matching evaluations that require very intensive computations. Simulation results demonstrate that although the performance of the proposed algorithm is the same as that using the exhaustive search, the computation time has been reduced significantly.
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
Cites
Displacement Measurement and Its Application in Interframe Image Coding
Jain, J., & Jain, A. (1981) · IEEE Transactions on Communications · doi:10.1109/tcom.1981.1094950 · Cited by 1,598
MOTION COMPENSATED INTER-FRAME CODING FOR VIDEO CONFERENCING
Koga, T. (1981) · Medical Entomology and Zoology · Cited by 1,471
New fast algorithms for the estimation of block motion vectors
Liu, B., & Zaccarin, A. (1993) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/76.212720 · Cited by 502
Predictive Coding Based on Efficient Motion Estimation
Srinivasan, R., & Rao, K. (1985) · IEEE Transactions on Communications · doi:10.1109/tcom.1985.1096398 · Cited by 487
Methods for measuring small displacements of television images
Cafforio, C., & Rocca, F. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055602 · Cited by 243
Dynamic search-window adjustment and interlaced search for block-matching algorithm
Lee, L.-W., Wang, J. Y., Lee, J., et al. (1993) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/76.180692 · Cited by 117
Cited by
Temporal Trajectory Aware Video Quality Measure
Barkowsky, M., Bialkowski, J., Eskofier, B., Bitto, R., & Kaup, A. (2009) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2009.2015375 · Cited by 75
Metadata
- Authors
- Li, W., & Salari, E.
- Venue
- IEEE Transactions on Image Processing
- Published
- 1995
- Volume
- 4
- Issue
- 1
- Pages
- 105-107
- ISSN
- 1057-7149 (ISSN-L)
- OpenAlex
- W2054484909
- Cited by
- 500
- References
- 6
- FWCI
- 6.44
- 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
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.