Fast Template Matching-Based Reference Picture Padding for Video Coding

Reference Picture Padding is utilized in a variety of video coding standards. It allows motion vectors to point partly outside the reference picture in inter prediction. This approach provides advantages in compression efficiency. The method employed in current standards is repetative padding, which copies the pixels at the picture border outward. The major advantage of this approach is its low complexity. However, it is not optimal in terms of compression efficiency. Recently, motion-compensated padding has been introduced, which utilizes already coded content in the padding process. Another padding method is template matching-based padding, with the main downside being its high computational complexity. In this work, we propose a complexity reduction of the method by applying different measures, including an improved virtual target block increase and an early termination of the search, among other improvements. As a result, we achieve a decoder runtime increase of 1% and a BD-rate of -0.33% in a low delay subpicture scenario, outperforming motion-compensated padding with a decoder runtime increase of 9% and a BD-rate of -0.19%. In the random-access configuration we can show a consistent improvement by combining the methods over the stand-alone methods.

Authors

Institutions

Publication Details

Published
2024-09-27
DOI
https://doi.org/10.1109/icip51287.2024.10648005
Primary Topic
Video Coding and Compression Technologies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fast Template Matching-Based Reference Picture Padding for Video Coding

M Wien, Priyanka Das, Nicolas Neumann, Tim Claßen
Video Coding and Compression Technologies
article

Fast Template Matching-Based Reference Picture Padding for Video Coding

M Wien, Priyanka Das, Nicolas Neumann, Tim Claßen
article en

Abstract

Reference Picture Padding is utilized in a variety of video coding standards. It allows motion vectors to point partly outside the reference picture in inter prediction. This approach provides advantages in compression efficiency. The method employed in current standards is repetative padding, which copies the pixels at the picture border outward. The major advantage of this approach is its low complexity. However, it is not optimal in terms of compression efficiency. Recently, motion-compensated padding has been introduced, which utilizes already coded content in the padding process. Another padding method is template matching-based padding, with the main downside being its high computational complexity. In this work, we propose a complexity reduction of the method by applying different measures, including an improved virtual target block increase and an early termination of the search, among other improvements. As a result, we achieve a decoder runtime increase of 1% and a BD-rate of -0.33% in a low delay subpicture scenario, outperforming motion-compensated padding with a decoder runtime increase of 9% and a BD-rate of -0.19%. In the random-access configuration we can show a consistent improvement by combining the methods over the stand-alone methods.

Vol. 29
RWTH Aachen University (DE)
Openalex Percentile: Top 82%
Video Coding and Compression Technologies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.