Enhanced Inter-Prediction Via Shifting Transformation in the H.264/AVC

Blasi, Saverio; Peixoto, Eduardo; Izquierdo, Ebroul

doi:10.1109/tcsvt.2012.2214931

Cited by 6 publications

(16 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Taking that into account, it is rather remarkable that the shifting transformation can improve coding eciency as much as shown in experiments [9]. Therefore, an insight on why EIP with ST works might provide useful insight on the general matching criterion denition problem.…”

Section: 2mentioning

confidence: 83%

“…However, it has gone largely unnoticed in these terms, since it was given a very dierent interpretation. In 2012, Blasi et al proposed the enhanced inter-prediction (EIP) method to improve the BMC approach [9].…”

Section: 2mentioning

confidence: 99%

“…They also devised an algorithm to compute the optimal shift if the SAD is used as a measure of the residual and provided a closed solution to the problem if the SSD is used instead. Their implementation of EIP with ST in the H.264/AVC standard using the JM reference software [10] with the SAD metric showed signicant gains over the base encoder [9]. In our work, however, rather than in its precise value, we are more interested in a particular interpretation of the optimal shift.…”

Section: 2mentioning

confidence: 99%

“…In 2012, Blasi et al proposed their enhanced inter-prediction (EIP) technique [9]. This technique aims at improving the R-D performance of the BMC approach by considering a set of transformed candidate blocks P instead of the original candidate blocks P in the search area.…”

Section: Enhanced Inter-prediction and The Shifting Transformationmentioning

confidence: 99%

“…A particularly eective transformation for the implementation the EIP approach is the shifting transformation (ST) [9], also proposed by Blasi et al along with the EIP itself. The ST is a single parameter transformation Θ(•|s).…”

Section: Enhanced Inter-prediction and The Shifting Transformationmentioning

confidence: 99%

See 4 more Smart Citations

Motion compensation with minimal residue dispersion matching criteria

Oliveira¹

View full text Add to dashboard Cite

With the ever growing demand for video services, video compression techniques have become a technology of central importance for communication systems. Industry standards for video coding have emerged, allowing the integration between these services and the most diverse devices. The almost entirety of these standards adopt a hybrid coding model combining dierential and transform coding methods, with block-based motion compensation (BMC) at the core of its prediction step. The BMC method have become the single most important technique to exploit the strong temporal redundancy typical of most video sequences. In fact, much of the improvements in video coding eciency over the past two decades can be attributed to incremental renements to the BMC technique. In this work, we propose another such renement. A key issue to the BMC framework is motion estimation (ME), i.e., the selection of appropriate motion vectors (MV). Coding standards tend to strictly regulate the coding syntax and decoding processes for MV's and residual information, but the ME algorithm itself is left at the discretion of the codec designers. However, though virtually any MV selection criterion will allow for correct decoding, judicious MV selection is critical to the overall codec performance, providing the encoder with a competitive edge in the market. Most ME algorithms rely on the minimization of a cost function for the candidate prediction blocks given a target block, usually the sum of absolute dierences (SAD) or the sum of squared dierences (SSD). The minimization of any of these cost functions will select the prediction that results in the smallest residual, each in a dierent but well dened sense. In this work, we show that the prediction of minimal residue dispersion is frequently more ecient than the usual prediction of minimal residue size. As proof of concept, we propose the double matching criterion algorithm (DMCA), a simple two-pass algorithm to exploit both of these MV selection criteria in turns. Dispersion minimizing and size minimizing predictions are carried out independently. The encoder then compares these predictions in terms of rate-distortion performance and outputs only the most ecient one. For the dispersion minimizing pass of the DMCA, we also propose the total absolute deviation from the mean (TADM) as the measure of residue dispersion to be minimized in ME. The usual SAD is used as the ME cost function in the size minimizing pass. The DMCA with SAD/TADM was implemented in a modied version of the JM reference software encoder for the widely popular H.264/AVC coding standard. Absolute compliance to the standard was maintained, so that no modications on the decoder side were necessary. Results show signicant improvements over the unmodied H.264/AVC encoder.

show abstract

Section: 2mentioning

confidence: 83%

Section: 2mentioning

confidence: 99%

Section: 2mentioning

confidence: 99%

Section: Enhanced Inter-prediction and The Shifting Transformationmentioning

confidence: 99%

Section: Enhanced Inter-prediction and The Shifting Transformationmentioning

confidence: 99%

See 3 more Smart Citations