The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Motion vector refinement for high-performance transcoding
Abstract
In transcoding, simply reusing the motion vectors extracted from an incoming video bit stream may not result in the best quality. In this paper, we show that the incoming motion vectors become nonoptimal due to the reconstruction errors. To achieve the best video quality possible, a new motion estimation should be performed in the transcoder. We propose a fast-search adaptive motion vector refinement scheme that is capable of providing video quality comparable to that can be achieved by performing a new full-scale motion estimation but with much less computation. We discuss the case when some incoming frames are dropped for frame-rate conversions, and propose motion vector composition method to compose a motion vector from the incoming motion vectors. The composed motion vector can also be refined using the proposed motion vector refinement scheme to achieve better results.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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 · cited 2×
“That is, if the checking points are closed to the global minimum, then the chance of hitting the optimal motion vector without being trapped in a local minimum will be higher [ 19 ], [20].”
BackgroundTranscoder architectures for video coding
Bjork, N., & Christopoulos, C. (1998) · IEEE Transactions on Consumer Electronics · doi:10.1109/30.663734 · Cited by 150
Cited by
Video transcoding architectures and techniques: an overview
Vetro, A., Christopoulos, C., & Sun, H. (2003) · IEEE Signal Processing Magazine · doi:10.1109/msp.2003.1184336 · Cited by 679
Video transcoding: an overview of various techniques and research issues
Ahmad, I., Wei, X., Sun, Y., & Zhang, Y.-Q. (2005) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2005.854472 · Cited by 333
Xin, J., Lin, C.-W., & Sun, M.-T. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2004.839620 · Cited by 326
Self-citation
Metadata
- Authors
- Youn, J., Sun, M.-T., & Lin, C.-W.
- Venue
- IEEE Transactions on Multimedia
- Published
- 1999-03
- Volume
- 1
- Issue
- 1
- Pages
- 30-40
- ISSN
- 1520-9210 (ISSN-L)
- OpenAlex
- W2143589929
- Cited by
- 215
- References
- 2
- FWCI
- 17.12
- 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.