An adaptive search ordering for rate-constrained successive elimination algorithms

Trudeau, Luc, Coulombe, Stéphane and Desrosiers, Christian. 2015. « An adaptive search ordering for rate-constrained successive elimination algorithms ». In 2015 IEEE International Conference on Image Processing (ICIP) (Quebec City, QC, Canada, Sept. 27-30, 2015) pp. 207-211. IEEE.
Compte des citations dans Scopus : 7.

Preview	PDF Coulombe S. 2015 12102 An adaptive search ordering for.pdf - Accepted Version Use licence: All rights reserved to copyright holder. Download (301kB) | Preview
Preview	PDF Coulombe S. 2015 12102 poster An adaptive search ordering for.pdf - Presentation Use licence: All rights reserved to copyright holder. Download (1MB) | Preview

Abstract

This paper proposes a solution for the problem of unnecessary cost function evaluations, found when combining the successive elimination algorithm with a spiral scan search ordering. Our experiments show that the implementation of such a combination inside the HEVC reference software leads to unnecessary cost function evaluations. On the tested video sequences, an average of 3.46% unnecessary cost function evaluations was measured. Considering only small block sizes (e.g., 4×8 and 8×4), this average rises to 8.06%. To solve this problem, we propose an adaptive scan ordering of block matching candidates within the search area. When used with our early termination threshold, the proposed approach will only evaluate necessary cost functions, without impacting rate-distortion.

Item Type:	Conference proceeding
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:	18 Jan 2016 20:16
Last Modified:	21 Aug 2018 20:56
URI:	https://espace2.etsmtl.ca/id/eprint/12102

Actions (login required)

View Item