Add new related work
This commit is contained in:
@@ -145,7 +145,7 @@ In order to generate such reference frames the following can be applied
|
||||
where $\check f_n^i$ is a reference frame pixel, $\alpha$ is the leak factor, and $C$ is a constant value.
|
||||
The use of leaky predictions has been used in the past for error control especially in scalable video coding \cite{LeakyPredScalable2002}, where $C$ in Equation~(\ref{EQ2:LeakyPredConstant}) is replace by a lower layer error-free reconstruction. 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}.
|
||||
|
||||
In order to overcome the coding efficiency problem weighted prediction can be used with similar advantages. Since \ac{h264} motion compensation can be applied from two individual previously encoded frames and combined together to generate a single prediction for the current frame \cite{WeightedBiPred2005}.
|
||||
In order to overcome the coding efficiency problem weighted prediction can be used with similar advantages. Since \ac{h264} motion compensation can be applied from two individual previously encoded frames and combined together to generate a single prediction for the current frame \cite{WeightedBiPred2005}. In the case of \ac{hevc}, a method was proposed to force the use of dual inter-frame prediction~\ctie{DualFrameME2015} leading to lower error propagations.
|
||||
In case of leaky prediction instead of applying motion compensation is applied once, but with an interpolated frame obtained as follow:
|
||||
\begin{equation}\label{EQ2:LeakyPredDual}
|
||||
\check f_n^i = \alpha \hat f_n^i + (1- \alpha) \hat f_{n-1}^i.
|
||||
@@ -276,11 +276,12 @@ For example, the primary picture may be coded with fine quantization, while the
|
||||
One the one hand if the primary picture is received, the redundant information is discarded.
|
||||
One the other hand if errors occur and the primary picture is lost, the redundant one is used to provide a lower level of reconstructed quality and contain the error propagation.
|
||||
|
||||
Zhu \emph{et al.} investigated the paradigm of redundant picture coding in \ac{h264} standard~\cite{RedudantPicsJan2009}.
|
||||
Different approaches were investigated in order to achieve a mixed method based on both reference picture selection to obtain a clean decoding without error propagation and a hierarchical allocation of the redundant pictures to increase the error robustness.
|
||||
Redundant pictures achieve good performance under error prone conditions, since they introduce secondary pictures that can be decoded when the primary picture is not available.
|
||||
Zhu \emph{et al.} investigated the paradigm of redundant picture coding in \ac{h264} standard~\cite{RedudantPicsJan2009}.
|
||||
Different approaches were investigated in order to achieve a mixed method based on both reference picture selection to obtain a clean decoding without error propagation and a hierarchical allocation of the redundant pictures to increase the error robustness. In~\cite{VPxResiliencePCS2016} the key frames are encoded and transmitted at lower bitrate to be used in case of error to replace the missing frame.
|
||||
Redundant pictures achieve good performance under error prone conditions, since they introduce secondary pictures that can be decoded when the primary picture is not available.
|
||||
|
||||
Moreover, redundant pictures might also work as localisation techniques when different reference frames are selected. However, such approaches generate large amount of redundant data and overheads. In~\cite{RedundantMVsJune2008} a newer approach was proposed to reduce the amount of information in the redundant pictures of the \ac{h264} standard, by introducing only redundant \acs{mv}. This approach increases the overall system performance by presenting an efficient trade-off between the resultant bitrate and the error robustness.
|
||||
Moreover, redundant pictures might also work as localisation techniques when different reference frames are selected. However, such approaches generate large amount of redundant data and overheads. In~\cite{RedundantMVsJune2008} a newer approach was proposed to reduce the amount of information in the redundant pictures of the \ac{h264} standard, by introducing only redundant \acs{mv}. This was also used in~\cite{VPxResilience2016}, where the motion information is used to recover the missing frame.
|
||||
These approaches increases the overall system performance by presenting an efficient trade-off between the redundant bitrate and the error robustness.
|
||||
|
||||
\subsection{Multiple description coding}
|
||||
|
||||
|
||||
Reference in New Issue
Block a user