Review the use of transmission losses to network losses
This commit is contained in:
@@ -226,7 +226,7 @@ Thus, in order to achieve higher reconstruction quality, different approaches sh
|
||||
|
||||
This section presents the general architecture proposed for \ac{ec}-aware video encoding, describing its main functional blocks, and providing an introduction for the subsequent detailed descriptions.
|
||||
Figure~\ref{FIG5:BlockDiagram} illustrates the architecture of the proposed \ac{ec}-aware encoding scheme.
|
||||
After the video encoder, it includes data loss simulation at the \ac{nal} for every slice. Subsequently, \ac{ec} is applied to the simulated losses in order to find the best methods that should be used to reconstruct the lost slices in case of transmission errors.
|
||||
After the video encoder, it includes data loss simulation at the \ac{nal} for every slice. Subsequently, \ac{ec} is applied to the simulated losses in order to find the best methods that should be used to reconstruct the lost slices in case of errors and packet loss.
|
||||
Saliency-weighted \ac{ec} mode decision is used to select the optimal \ac{ec} mode from the best trade-off between \ac{ec} distortion, using the original input video~($f$) as reference, and the number of bits required for signalling.
|
||||
Then, the optimal \ac{ec} mode is sent to the decoder along with the mismatch residue computed as a difference between the transmitted and recovered frames.
|
||||
Finally, the scalable extension of the \ac{hevc} standard is used to encode this residue information.
|
||||
@@ -421,8 +421,8 @@ Realistic conditions were used for transmission, by allowing independent losses
|
||||
\label{SEC4:IntraPerformance}
|
||||
|
||||
In this section the performance of the proposed method is evaluated only for intra frames, in order to demonstrate its efficiency in reducing error propagation.
|
||||
Since intra \acs{cu} result in higher amount of bits, they also require a higher number of packets, making them more prone to transmission errors and losses.
|
||||
Results indicate that for an intra-period of 16 frames, approximately 42\% of the packets correspond to intra coded slices, which is a non-negligible probability of one of them being hit by transmission errors.
|
||||
Since intra \acs{cu} result in higher amount of bits, they also require a higher number of packets, making them more prone to errors and data loss.
|
||||
Results indicate that for an intra-period of 16 frames, approximately 42\% of the packets correspond to intra coded slices, which is a non-negligible probability of one of them being hit by transmission errors which would lead to packet loss.
|
||||
Moreover, by limiting the proposed method to intra frames, the amount of required overhead is reduced.
|
||||
In this case a constant $\lambda_0=10$ was used, without taking into consideration saliency estimation. This value results from an exhaustive search targetting acceptable quality gains with a low overhead (i.e., average overhead under 5\%).
|
||||
|
||||
@@ -708,7 +708,7 @@ For instance, in comparison with the method in \cite{DualFrameME2015} the propos
|
||||
Results in Table~\ref{tab:overall_gain_ratio} also show that the small loss of coding efficiency in error-free transmission is clearly surpassed by the quality gains under error-prone transmission conditions.
|
||||
The methods in \cite{ROPERefGenJan2010,DualFrameME2015} are based on modified predictions, while the method in \cite{VPxResiliencePCS2016} uses redundant data without any further optimisation.
|
||||
Both of these approaches require low additional computational complexity.
|
||||
However, as observed in the results shown in Table~\ref{tab:overall_gain_ratio}, the lower additional complexity also corresponds to lower quality gains in case of transmission errors.
|
||||
However, as observed in the results shown in Table~\ref{tab:overall_gain_ratio}, the lower additional complexity also corresponds to lower quality gains in case of packet loss.
|
||||
|
||||
|
||||
|
||||
|
||||
Reference in New Issue
Block a user