The calculated spectral minimum, then, is used in the future frames,, for spectral subtraction.
Intra macroblock refreshment can stop errors in the previous frames, while redundant coding is a way of preventing errors in the future frames.
Intra macroblock refreshment can stop errors in the previous frames, while redundant coding is a way of preventing and minimizing propagated errors in the future frames.
where γ K,…,γ-1,…0,γ1,…,γ L denotes the weights which are used to compensate the RTF, L denotes the number of past frames in the segment, and R denotes the number of future frames in the segment.
Bi-directional prediction is carried out by obtaining the differences between an MB partition and two reference blocks, one located in a previous frame and the other one in a future frame.
The opposite block is located and estimated using its MVP (MVP1 if it is located in the previous frame or MVP2 if it is located in the future frame).
The opposite block for a specific partition is estimated and located using the MV obtained with the backward or the forward prediction for that partition, depending on which frame it is located in (MVP1 if it is located in the previous frame or MVP2 if it is located in the future frame).
This slice CMSE prediction scheme uses certain parameters from the current encoded frame alone without using the future frames in the GOP.
In the second step, a search area region is estimated in the previous frame using MVP1, the opposite block is estimated in the future frame using MVP2 and the bi-directional prediction is performed by iterating in the previous frame (see Algorithm 1, line 4).
In the description of the algorithm we focus on the first step, locating the search area in the future frame.
