FRANÇAIS
A showcase of ÉTS researchers’ publications and other contributions
SEARCH

Cost-based search ordering for rate-constrained motion estimation applied to HEVC

Downloads

Downloads per month over past year

Trudeau, Luc, Coulombe, Stéphane et Desrosiers, Christian. 2018. « Cost-based search ordering for rate-constrained motion estimation applied to HEVC ». IEEE Transactions on Broadcasting, vol. 64, nº 4. pp. 922-932.
Compte des citations dans Scopus : 3.

[img]
Preview
PDF
Coulombe S 2018 17138.pdf - Accepted Version
Use licence: All rights reserved to copyright holder.

Download (2MB) | Preview

Abstract

In the context of motion estimation for video coding, combining a successive elimination algorithm (SEA) with a motion estimation algorithm reduces the number of computed cost functions without impact on rate or distortion. The SEAs use the sum of absolute differences to eliminate motion vector candidates in the search area that cannot improve the current minimum. The novelty in this paper is that instead of relying on a static geometric pattern (i.e., like a spiral), we proposed a dynamic algorithm that creates a cost-based search orderings. A dynamic cost-based search ordering not only improves elimination but also allows for early termination which removes, on average, 61% of the block-matching loop iterations performed by the rate-constrained successive elimination algorithm (RCSEA). Our experiments show that the proposed solution is 5 times faster than the high efficiency video coding (HEVC) HM encoder software in full search mode with a 0.02% impact on BD-Rate. This is twice the speed of the HEVC HM software encoder using only the RCSEA.

Item Type: Peer reviewed article published in a journal
Professor:
Professor
Coulombe, Stéphane
Desrosiers, Christian
Affiliation: Génie logiciel et des technologies de l'information, Génie logiciel et des technologies de l'information
Date Deposited: 30 Jul 2018 21:03
Last Modified: 28 Jan 2020 16:31
URI: https://espace2.etsmtl.ca/id/eprint/17138

Actions (login required)

View Item View Item