Fix abreviations and equations referencing
This commit is contained in:
1 parent
935eb96ed4
commit
52d96c729a
11 files changed
+40
-144
No files matched your search
@@ -125,7 +125,7 @@ E\left\{\left( \tilde f_t^i \right)^2 \right\} = \left(1-p\right) \left( \left(
|
||||
\end{equation}
|
||||
assuming that the pixel $i$ is predicted from pixel $j$ in the previous frame.
|
||||
The prediction error $e_t^i$ is quantised to the value $\hat e_t^i$, which is transmitted to the decoder along with the motion information.
|
||||
Equations~\ref{EQ2:E2EDIntra} to~\ref{EQ2:E2EDInter} provide a measure of the distortion, taking into consideration not only the coding distortion but also the possibility of frame loss and consequent \ac{ec} distortion.
|
||||
Equations~(\ref{EQ2:E2EDIntra}) to~(\ref{EQ2:E2EDInter}) provide a measure of the distortion, taking into consideration not only the coding distortion but also the possibility of frame loss and consequent \ac{ec} distortion.
|
||||
|
||||
This method was used in \cite{ROPEJun2000} to switch between intra and inter coding modes with the aim of reducing the temporal dependencies, thus achieving enhanced error robustness in video transmission.
|
||||
In \cite{AdvancesROPEHE2642007} this was optimised to quarter pixel estimation, and in \cite{ROPEBurst2009} the same method was extended for burst losses, by introducing the burst loss probability into the original end-to-end estimation.
|
||||
@@ -199,7 +199,7 @@ In such approach, the reconstructed reference frames are scaled down by applying
|
||||
\check f_t^i = \alpha \hat f_t^i + (1- \alpha)C,
|
||||
\end{equation}
|
||||
where $\hat f_t^i$ is a reference frame, $\alpha$ is the leaky factor used to control the amount of information from the reconstructed frame present in the new frame $\check f_t^i$, and $C$ is a constant value.
|
||||
Leaky prediction has been used in the past for error control, especially in scalable video coding \cite{LeakyPredScalable2002}, where $C$ in Equation~(\ref{EQ2:LeakyPredConstant}) is replaced by a lower layer error-free reconstructed frame. In case of single layer coding, the use of a constant value has significant impact on the coding efficiency leading to higher bitrate, as shown in \cite{LeakyPredConstant1973}. The $\alpha$ parameter allows to control the effect of the constant value, and thus the coding efficiency.
|
||||
Leaky prediction has been used in the past for error control, especially in scalable video coding \cite{LeakyPredScalable2002}, where $C$ in~(\ref{EQ2:LeakyPredConstant}) is replaced by a lower layer error-free reconstructed frame. In case of single layer coding, the use of a constant value has significant impact on the coding efficiency leading to higher bitrate, as shown in \cite{LeakyPredConstant1973}. The $\alpha$ parameter allows to control the effect of the constant value, and thus the coding efficiency.
|
||||
By decreasing $\alpha$, the coding efficiency increases, but the exponential decay in error propagation becomes less significant.
|
||||
|
||||
% MHMCP_TCSVT2006
|
||||
@@ -211,7 +211,7 @@ Alternatively, the two previously encoded frames can be used to generate an inte
|
||||
\check f_t^i = \alpha \hat f_t^i + (1- \alpha) \hat f_{t-1}^i.
|
||||
\end{equation}
|
||||
Therefore, it is possible to decrease the error propagation using $\check f_t^i$ as reference frame for prediction, if only one of the original encoded frames is lost (i.e., $\hat f_{t}^i$ or $\hat f_{t-1}^i$). This is due to the fact that $\check f_t^i$ contains information from both $\hat f_{t}^i$ and $\hat f_{t-1}^i$.
|
||||
In Equation~(\ref{EQ2:LeakyPredDual}) $\hat f_{n}^i$ and $\hat f_{n-1}^i$ always correspond to the encoded frames and the generated frames ($\check f_t^i $) are not used to interpolate subsequent frames. This corresponds to a finite impulse response filter.
|
||||
In~(\ref{EQ2:LeakyPredDual}) $\hat f_{n}^i$ and $\hat f_{n-1}^i$ always correspond to the encoded frames and the generated frames ($\check f_t^i $) are not used to interpolate subsequent frames. This corresponds to a finite impulse response filter.
|
||||
|
||||
|
||||
\begin{figure}[tb]
|
||||
@@ -234,12 +234,12 @@ This limits the impact of errors in the background region to affect the \ac{roi}
|
||||
Moreover, since the leaky predictions are only confined to some specific regions, higher coding efficiency is achieved when compared with other methods.
|
||||
|
||||
|
||||
The method proposed in \cite{ROPERefGenJan2010} extends the traditional leaky prediction expressed in Equation~(\ref{EQ2:LeakyPredDual}) by replacing the previous encoded frame ($\hat f_{t-1}^i.$) by the previous interpolated frame ($\check f_t^i$). This results in the following:
|
||||
The method proposed in \cite{ROPERefGenJan2010} extends the traditional leaky prediction expressed in~(\ref{EQ2:LeakyPredDual}) by replacing the previous encoded frame ($\hat f_{t-1}^i.$) by the previous interpolated frame ($\check f_t^i$). This results in the following:
|
||||
\begin{equation}\label{EQ2:LeakyPredIIR}
|
||||
\check f_t^i = \alpha \hat f_t^i + (1- \alpha) \check f_{t-1}^i.
|
||||
\end{equation}
|
||||
The above equation corresponds to an infinite impulse response filter.
|
||||
Comparing both Equations~\ref{EQ2:LeakyPredDual}~and~\ref{EQ2:LeakyPredIIR} for the same $\alpha$, the latter implies stronger filtering than the former.
|
||||
Comparing both~(\ref{EQ2:LeakyPredDual})~and~(\ref{EQ2:LeakyPredIIR}) for the same $\alpha$, the latter implies stronger filtering than the former.
|
||||
Therefore, reference frames generated with heavier filtering have higher resilience against error propagation, but less correlation with the original frame, which negatively impacts inter predictions and hence coding efficiency.
|
||||
The idea of combining multiple predictions was also applied in the \ac{hevc} standard by combining it with end-to-end distortion to select the optimal predictions~\cite{DualFrameME2015}.
|
||||
|
||||
|
||||
Reference in new issue
Block a user